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

Algorithm in NDSolve and FindMinimum

  • To: mathgroup at smc.vnet.net
  • Subject: [mg70145] Algorithm in NDSolve and FindMinimum
  • From: "Texas A&M" <ultrathin1 at gmail.com>
  • Date: Thu, 5 Oct 2006 03:33:03 -0400 (EDT)

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: Re: Smarter way to calculate middle-right terms of continued fraction partial sums
  • Next by Date: Evaluation of 1/(1/a + 1/b + 1/r)
  • Previous by thread: On "Equilibrium points for..."
  • Next by thread: Re: Algorithm in NDSolve and FindMinimum