Similarity to totally positive matrices and accurate computations
From MaRDI portal
Publication:5962491
Recommendations
- Accurate computations with totally positive Bernstein-Vandermonde matrices
- Accurate Computations for Some Classes of Matrices
- Accurate computations and applications of some classes of matrices
- Accurate computation of the Moore-Penrose inverse of strictly totally positive matrices
- On nonnegative matrices similar to positive matrices
- Almost strictly totally positive matrices
- Accurate computations of matrices with bidiagonal decomposition using methods for totally positive matrices.
- On integral similitude matrices
- Accurate Eigenvalues and SVDs of Totally Nonnegative Matrices
Cites work
- scientific article; zbMATH DE number 1136347 (Why is no real title available?)
- scientific article; zbMATH DE number 3348831 (Why is no real title available?)
- A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems
- A test for strict sign-regularity
- Accurate Computations with Totally Nonnegative Matrices
- Accurate computations of matrices with bidiagonal decomposition using methods for totally positive matrices.
- Bidiagonal decompositions, minors and applications
- On the Schur and singular value decompositons of oscillatory matrices
- On the extension of some total positivity inequalities
- The Accurate and Efficient Solution of a Totally Positive Generalized Vandermonde Linear System
- The LU-factorization of totally positive matrices
- Total Positivity, $QR$ Factorization, and Neville Elimination
- Totally nonnegative matrices
- Totally positive matrices
- Totally positive matrices
Cited in
(2)
This page was built for publication: Similarity to totally positive matrices and accurate computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5962491)