Accurate computation of singular values in terms of shifted integrable schemes
From MaRDI portal
Publication:862095
DOI10.1007/BF03167593zbMATH Open1117.65055MaRDI QIDQ862095FDOQ862095
Authors: Masashi Iwasaki, Yoshimasa Nakamura 
Publication date: 5 February 2007
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Recommendations
- Positivity of dLV and mdLVs algorithms for computing singular values
- Error analysis of the mdLVs algorithm for computing bidiagonal singular values
- An application of the discrete Lotka–Volterra system with variable step-size to singular value computation
- An improved dqds type algorithm
- Accurate singular values and differential qd algorithms
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Lattice dynamics; integrable lattice equations (37K60) Dynamical systems in numerical analysis (37N30)
Cites Work
- LAPACK Users' Guide
- Title not available (Why is that?)
- Singular value decomposition and least squares solutions
- Title not available (Why is that?)
- Conserved Quantities of “Random-Time Toda Equation”
- Accurate Singular Values of Bidiagonal Matrices
- Title not available (Why is that?)
- On the convergence of a solution of the discrete Lotka Volterra system
- An application of the discrete Lotka–Volterra system with variable step-size to singular value computation
- A Gershgorin-type lower bound for the smallest singular value
- Accurate singular values and differential qd algorithms
- Discrete-time Volterra chain and classical orthogonal polynomials
- The discrete Lotka-Volterra system computes singular values
Cited In (12)
- An application of the Kato-temple inequality on matrix eigenvalues to the dqds algorithm for singular values
- The discrete Lotka-Volterra system computes singular values
- Integrable discrete hungry systems and their related matrix eigenvalues
- A Bäcklund transformation between two integrable discrete hungry systems
- The ultradiscrete Toda lattice and the Smith normal form of bidiagonal matrices
- Discrete Lotka-Volterra with shift algorithm for computing matrix eigenvalues and singular values
- A new subtraction-free formula for lower bounds of the minimal singular value of an upper bidiagonal matrix
- Error analysis of the mdLVs algorithm for computing bidiagonal singular values
- A generalized eigenvalue algorithm for tridiagonal matrix pencils based on a nonautonomous discrete integrable system
- Equality conditions for lower bounds on the smallest singular value of a bidiagonal matrix
- Improving the Accuracy of Computed Singular Values
- Conserved quantities of the integrable discrete hungry systems
Uses Software
This page was built for publication: Accurate computation of singular values in terms of shifted integrable schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q862095)
