Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
2000
*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 2000

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

Search the Archive

Re: Levenberg-Marquardt ?

  • To: mathgroup at smc.vnet.net
  • Subject: [mg23821] Re: Levenberg-Marquardt ?
  • From: atulksharma at yahoo.com
  • Date: Sat, 10 Jun 2000 03:00:32 -0400 (EDT)
  • References: <8hfddu$hgp@smc.vnet.net>
  • Sender: owner-wri-mathgroup at wolfram.com

On the web page maintained by Lukas Finschi, you will find code for the
L-M algorithm written in C with an accompanying calling routine via
Mathlink. Not exactly what you were looking for, but it is ready to run
from Mathematica (or S-Plus) and has the advantage of being fast.

The URL is: http://www.ifor.math.ethz.ch/~finschi/Papers/LevMar.html

Atul

--
------------------------------------------------------------------------
-
Atul Sharma MD, FRCP(C)
Pediatric Nephrologist,
McGill University/Montreal Children's Hospital





In article <8hfddu$hgp at smc.vnet.net>,
  mclean at physics.queensu.ca (Alastair McLean) wrote:
> Has the Levenberg-Marquard method of non-linear least
> squares minimisation been implemented as a Mathematica
> function or package yet ?
>
> Alastair McLean
> mclean at physics.queensu.ca
>
>


Sent via Deja.com http://www.deja.com/
Before you buy.


  • Prev by Date: Re: Re: programming DeleteRepetitions
  • Next by Date: Pattern Matching
  • Previous by thread: Re: Levenberg-Marquardt ?
  • Next by thread: problem with external programm