Re: equation question

*To*: mathgroup at smc.vnet.net*Subject*: [mg69942] Re: [mg69921] equation question*From*: "Chris Chiasson" <chris at chiasson.name>*Date*: Thu, 28 Sep 2006 06:14:31 -0400 (EDT)*References*: <200609271005.GAA00230@smc.vnet.net>

If you want to use numerical proceedures, penalty functions could help you out with constraints. If you don't want to write your own penalty functions, you could repose your FindRoot problem as an NMinimize on the absolute value of the difference between your lhs and rhs. On 9/27/06, dimmechan at yahoo.com <dimmechan at yahoo.com> wrote: > Hello. > > Consider the following simple examples of FindRoot application. > > FindRoot[Sin[x] == 2, {x, I}] > {x -> 1.5707963267948966 + 1.3169578969248168*I} > > FindRoot[Sin[x^2] == 2, {x, I + 1}] > {x -> 1.3454777060580754 + 0.4894016047219337*I} > > FindRoot[Sin[x^2] == 2, {x, 3*I + 2}] > {x -> 0.3004695589886017 + 2.1914997002654357*I} > > Is it possible for FindRoot (or in general in another way) to search > for solutions > in the complex plane in an particular domain e.g. searching in the > domain that > is made by the lines Re[x]=a1, Re[x]=a2 and Im[x]=b1, Im[b]=b2 ? > > I really appreciate any assistance. > > Regards > Dimitris > > -- http://chris.chiasson.name/

**References**:**equation question***From:*dimmechan@yahoo.com