Positivity and Stability of the dLV Algorithm for Computing Matrix Singular Values

The discrete Lotka-Volterra algorithm for computing matrix singular values is considered. Positivity and boundedness of a parameter and variables are shown to guarantee a numerical stability of the algorithm. Orthogonal polynomials and integrable systems play a key role

Saved in:
Bibliographic Details
Published inSecond International Conference on Informatics Research for Development of Knowledge Society Infrastructure (ICKS'07) pp. 103 - 110
Main Authors Iwasaki, M., Nakamura, Y.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.01.2007
Subjects
Algorithm design and analysis
Convergence
Eigenvalues and eigenfunctions
Informatics
Mathematics
Numerical stability
Physics computing
Polynomials
Online AccessGet full text

Cover

More Information
Summary:The discrete Lotka-Volterra algorithm for computing matrix singular values is considered. Positivity and boundedness of a parameter and variables are shown to guarantee a numerical stability of the algorithm. Orthogonal polynomials and integrable systems play a key role
ISBN:9780769528113
0769528112
DOI:10.1109/ICKS.2007.22