Abstract

A new scheme with a shift of origin for computing singular values σk is presented. A shift θ is introduced into the recurrence relation defined by the discrete integrable Lotka-Volterra system with variable step-size. A suitable shift strategy is given so that the singular value computation becomes numerically stable. It is proved that variables in the new scheme converge to σ 2 - Σ θ2. A comparison of the zero-shift and the nonzero-shift routines is drawn. With respect to both the computational time and the numerical accuracy, it is shown that the nonzero-shift routine is more accurate and faster than a credible LAPACK routine for singular values at least in four different types of test matrices.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.