Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
2006
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*November
*December
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 2006

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

Search the Archive

Re: Algorithm in NDSolve and FindMinimum

  • To: mathgroup at smc.vnet.net
  • Subject: [mg70152] Re: Algorithm in NDSolve and FindMinimum
  • From: dimmechan at yahoo.com
  • Date: Fri, 6 Oct 2006 01:57:52 -0400 (EDT)
  • References: <eg2eg8$78u$1@smc.vnet.net>

For the second question see first Implementation Notes:

http://documents.wolfram.com/mathematica/book/section-A.9.4

Then

http://documents.wolfram.com/mathematica/functions/NDSolve
http://documents.wolfram.com/mathematica/functions/FindRoot

Also take a look of Advanced Documentation in the Help-Browser.

Regards

Î?/Î? Texas A&M έγÏ?αÏ?ε:
> FindMinimum[
>     Block[{},
>       if1 = NDSolve[{fun[z1] == 0, h[0] == unknown1, h'[0] == 0},
>           h, {z1, 0, a}];  vans1 = (h[a])^2 /. if1[[1]];
>       vans1], {unknown1, 0.1, 1.2}]
>
> What this command really does?
> Do NDSolve (or FindMinimum) always use the same Algorithm?
> 
> Thanks,
> 
> Kai


  • Prev by Date: FoourierTransform of a function defined in sections
  • Next by Date: Need algorithm to convert general continued fraction to simple continued fraction
  • Previous by thread: Re: Algorithm in NDSolve and FindMinimum
  • Next by thread: Re: Algorithm in NDSolve and FindMinimum