MathGroup Archive 2003

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: Applying multiple functions to multiple sets of arguements

  • To: mathgroup at smc.vnet.net
  • Subject: [mg42664] Re: Applying multiple functions to multiple sets of arguements
  • From: "Steve Luttrell" <luttrell at _removemefirst_westmal.demon.co.uk>
  • Date: Sat, 19 Jul 2003 03:19:50 -0400 (EDT)
  • References: <bf8f5g$5ne$1@smc.vnet.net>
  • Sender: owner-wri-mathgroup at wolfram.com

Use Outer as in the following example:

f = {f1, f2, f3};
x = {x1, x2};
Outer[#1[#2] &, f, x]

which produces the following output:

{{f1[x1], f1[x2]}, {f2[x1], f2[x2]}, {f3[x1], f3[x2]}}

--
Steve Luttrell
West Malvern, UK

"Rishi Roy" <rishiroy at umich.edu> wrote in message
news:bf8f5g$5ne$1 at smc.vnet.net...
> Hi all.  I was hoping someone cold help me.  I wanted a way to apply
> an arbitrary number of functions to an arbitrary number of sets of
> arguments.
>
> Meaning if I have n functions: {f1, f2, ...,fn} and m sets of
> arguments: {x1, x2, ..., xm}, how can I generate a list like:
> {{f1[x1], f1[x2], ...,f1[xm]},{f2[x1], f2[x2],
> ...,f2[xm]},...,{fn[x1], fn[x2], ...,fn[xm]}}?
>
> I am currently doing this by looping throgh both lists and populating
> each results one by one.  As expecting this is horribly slow.  I was
> hoping someone could recommend a faster, functional way to do this.  I
> tried using map, but couldnt get a handle on it.
>
> Any help would be greatly appreciated.  Thank you in advance.
>
> Rishi Roy
>



  • Prev by Date: Re: problem while loading packages
  • Next by Date: Simple recursion problem: there must be a simple answer!
  • Previous by thread: Re: Applying multiple functions to multiple sets of arguements
  • Next by thread: RE: Applying multiple functions to multiple sets of arguements