Hi all,

when making a polynomial fit on a data set with n points it should always be
possible to find a n-1 degree polynomial expression that gives a mean
squared error equal to 0 (well, rounding errors make this an 'almost' 0) 
When using the SVD algoritm in the General Plynomial Fit.vi this isn't
always the case.
Is this due to the qualities of the SVD algorithm ?
E.g. the Givens algorithm seems more stable. My math is a little rusty so
I'll appreciate comments from you math-gurus that I know reside out there.

Best regards,
Lars-Goran

** Confidentiality Statement and Disclaimer **
Proprietary or confidential information belonging to Gambro AB or to one of
its affiliated companies may be contained in this message. If you are not
the addressee indicated in this message (or responsible for the delivery of
the message to such person), please do not copy or deliver this message to
anyone. In such case, please destroy this message and notify the sender by
reply e-mail. Please advise the sender immediately if you or your employer
do not consent to Internet e-mail for messages of this kind.
Opinions, conclusions and other information in this message that pertain to
the sender's employer and its products and services represent the opinion of
the sender and do not necessarily represent or reflect the views and
opinions of the employer. 
** End of Statement **


Reply via email to