A finite-step construction of totally nonnegative matrices with specified eigenvalues
DOI10.1007/s11075-015-9957-xzbMath1334.65074OpenAlexW2086231554MaRDI QIDQ891777
Koichi Kondo, Masashi Iwasaki, Hisayoshi Tsutsumi, Yoshimasa Nakamura, Kanae Akaiwa
Publication date: 17 November 2015
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-015-9957-x
algorithmnumerical exampleinverse eigenvalue problemdiscrete hungry Toda equationbanded totally nonnegative matrices
Computational methods for sparse matrices (65F50) Positive matrices and their generalizations; cones of matrices (15B48) Numerical solutions to inverse eigenvalue problems (65F18)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Error analysis for matrix eigenvalue algorithm based on the discrete hungry Toda equation
- Inner totally positive matrices
- The numerically stable reconstruction of Jacobi matrices from spectral data
- A tridiagonal matrix construction by the quotient difference recursion formula in the case of multiple eigenvalues
- The QR algorithm and scattering for the finite nonperiodic Toda lattice
- Some properties of totally positive matrices
- The numerically stable reconstruction of a Jacobi matrix from spectral data
- On a shifted \(LR\) transformation derived from the discrete hungry Toda equation
- Integrable discrete hungry systems and their related matrix eigenvalues
- Nonlinear Partial Difference Equations. II. Discrete-Time Toda Equation
- Bidiagonal Factorizations of Totally Nonnegative Matrices
- Proof of solitonical nature of box and ball systems by means of inverse ultra-discretization
- Totally positive matrices
This page was built for publication: A finite-step construction of totally nonnegative matrices with specified eigenvalues