Talk:Levenberg–Marquardt algorithm: Difference between revisions

Revision as of 21:59, 2 July 2008

Revision as of 22:01, 2 July 2008

Line 80:

== Explanation of the poor performance of L-M in example ==

The data sequence has very high frequency components. The sparse sampling plan shown in the plots will necessarily contain aliasing error that is beyond any inverse algorithm. The way to correct this apparent poor performance of L-M is to sample the data train much more densely, e.g. in 0.001 step size, then the L-M will find the correct answer easily under a very wide range of initial conditions. It is really not L-M that is at fault here. <small>—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/66.88.135.150|66.88.135.150]] ([[User talk:66.88.135.150|talk]]) 21:59, 2 July 2008 (UTC)</small><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->