On parametrization of totally nonpositive matrices and applications
From MaRDI portal
Publication:2838741
DOI10.1002/nla.804zbMath1274.15049OpenAlexW2172048378MaRDI QIDQ2838741
Publication date: 10 July 2013
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.804
Factorization of matrices (15A23) Positive matrices and their generalizations; cones of matrices (15B48) Direct numerical methods for linear systems and matrix inversion (65F05)
Uses Software
Cites Work
- Accurate eigenvalues of certain sign regular matrices
- Total nonpositivity of nonsingular matrices
- Error analysis of the Björck-Pereyra algorithms for solving Vandermonde systems
- Fast algorithms of Björck-Pereyra type for solving Cauchy-Vandermonde linear systems
- Accurate SVDs of weakly diagonally dominant M-matrices
- Computing the singular value decomposition with high relative accuracy
- Accurate Computations with Totally Nonnegative Matrices
- Accuracy and Stability of Numerical Algorithms
- Relative Perturbation Bounds for Eigenvalues of Symmetric Positive Definite Diagonally Dominant Matrices
- Accurate Eigenvalues and SVDs of Totally Nonnegative Matrices
- The Accurate and Efficient Solution of a Totally Positive Generalized Vandermonde Linear System
- Totally positive matrices
This page was built for publication: On parametrization of totally nonpositive matrices and applications