Computing singular value decompositions of parameterized matrices with total nonpositivity to high relative accuracy
From MaRDI portal
Publication:1704844
The authors are concerned with accurately computing singular value decompositions (SVDs) of matrices. They present a new algorithm to compute SVDs of nonsingular totally nonpositive matrices to high relative accuracy. The new algorithm is developed by taking into account the property that there are \(n\times n\) independent parameters for any nonsingular totally nonpositive matrix of order \(n\) which determine all its singular values and singular vectors to high relative accuracy. Numerical results are presented to demonstrate the high relative accuracy of the proposed algorithm.
Recommendations
- Accurate Singular Value Decompositions of Structured Matrices
- Computing the Singular Value Decomposition of a Product of Two Matrices
- Accurate Eigenvalues and SVDs of Totally Nonnegative Matrices
- Computing the singular value decomposition with high relative accuracy
- scientific article; zbMATH DE number 1005418
Cites work
- A matricial description of Neville elimination with applications to total positivity
- A New Perturbation Bound for the LDU Factorization of Diagonally Dominant Matrices
- A stable test for strict sign regularity
- A test and bidiagonal factorization for certain sign regular matrices
- Accurate computation of the smallest eigenvalue of a diagonally dominant M-matrix
- Accurate computations with collocation matrices of q-Bernstein polynomials
- Accurate Eigenvalues and SVDs of Totally Nonnegative Matrices
- Accurate Factorization and Eigenvalue Algorithms for Symmetric DSTU and TSC Matrices
- Accurate Singular Value Decompositions of Structured Matrices
- Accurate Singular Values of Bidiagonal Matrices
- Accurate solution of structured least squares problems via rank-revealing decompositions
- Accurate solutions of \(M\)-matrix algebraic Riccati equations
- Accurate SVDs of weakly diagonally dominant M-matrices
- Computing singular values of diagonally dominant matrices to high relative accuracy
- Computing the singular value decomposition with high relative accuracy
- scientific article; zbMATH DE number 5527834 (Why is no real title available?)
- scientific article; zbMATH DE number 1136347 (Why is no real title available?)
- scientific article; zbMATH DE number 3348831 (Why is no real title available?)
- Implicit standard Jacobi gives high relative accuracy
- On computing accurate singular values and eigenvalues of matrices with acyclic graphs
- On nonsingular sign regular matrices
- On Schur complements of sign regular matrices of order \(k\)
- Orthogonal Eigenvectors and Relative Gaps
- Relative perturbation analysis for eigenvalues and singular values of totally nonpositive matrices
- Shape preserving representations in computer aided geometric design
- Total nonpositivity of nonsingular matrices
- Total Positivity, QR Factorization, and Neville Elimination
- Totally nonnegative matrices
- Totally positive matrices
Cited in
(21)- Computing the singular value decomposition with high relative accuracy
- Numerical algorithms of the discrete coupled algebraic Riccati equation arising in optimal control systems
- Accurate computations of eigenvalues of quasi-Cauchy-Vandermonde matrices
- Computing eigenvalues of quasi-generalized Vandermonde matrices to high relative accuracy
- Accurate eigenvalues of some generalized sign regular matrices via relatively robust representations
- Extended irreducible Nekrasov matrices as subclasses of irreducible \(H\)-matrices
- Accurate solutions of weighted least squares problems associated with rank-structured matrices
- Positivity of dLV and mdLVs algorithms for computing singular values
- Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions
- Accurate Computations with Totally Nonnegative Matrices
- Accurate computations and applications of some classes of matrices
- Accurate Singular Value Decompositions of Structured Matrices
- A qd-type method for computing generalized singular values of BF matrix pairs with sign regularity to high relative accuracy
- Relative perturbation analysis for eigenvalues and singular values of totally nonpositive matrices
- Accurate Eigenvalues and SVDs of Totally Nonnegative Matrices
- The accurate and efficient solutions of linear systems for generalized sign regular matrices with certain signature
- Convex set-oriented singular value decomposition with bounded uncertainties
- Computing eigenvalues of quasi-rational Said-Ball-Vandermonde matrices
- Accurate computations of singular values and linear systems for polynomial-Vandermonde-type matrices
- Computing eigenvalues for products of two classes of sign regular matrices to high relative accuracy
- Accurate determinants of some classes of matrices
This page was built for publication: Computing singular value decompositions of parameterized matrices with total nonpositivity to high relative accuracy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1704844)
