SMath Studio Forum
»
SMath Studio
»
Samples
»
Solving overdetermined systems of linear equations
Rank: Member Groups: Registered
Joined: 18/05/2010(UTC) Posts: 27 Was thanked: 13 time(s) in 6 post(s)
|
I was reminded by the posts in, New variable programmatically; also: Solving under/over defined system of linear eqautions, that I'd recently used an algorithm for overdetermined systems that I'd unearthed in Wikipedia: I've documented it's use very simply so that even I'll know how to use it next time it's needed. (memory gets a lot worse with age ) Perhaps others will find it useful. http://smath.info/wiki/G...LinearEquationSystems.smBrian
|
3 users thanked bdrunagle for this useful post.
|
on 25/11/2016(UTC), on 26/11/2016(UTC), on 26/11/2016(UTC)
|
|
Rank: Advanced Member Groups: Registered
Joined: 03/03/2014(UTC) Posts: 418 Was thanked: 125 time(s) in 96 post(s)
|
Thanks alot; always good toclean up a worksheet from unnecessary plugin calls.
|
|
|
|
Rank: Guest
Groups: Registered
Joined: 04/07/2015(UTC) Posts: 6,866 Was thanked: 981 time(s) in 809 post(s)
|
The β snippet represents the 'Cholesky' solver, used directly for fitting polynomials to noisy data set. It is also the basic solver in association with the "Conjugate Gradient". Polynomial fit.sm (51kb) downloaded 28 time(s). Genfit Minimize MODEL [Gauss ERRstem].sm (63kb) downloaded 21 time(s).
|
1 user thanked Jean Giraud for this useful post.
|
|
|
SMath Studio Forum
»
SMath Studio
»
Samples
»
Solving overdetermined systems of linear equations
Forum Jump
You cannot post new topics in this forum.
You cannot reply to topics in this forum.
You cannot delete your posts in this forum.
You cannot edit your posts in this forum.
You cannot create polls in this forum.
You cannot vote in polls in this forum.