Results 71 to 80 of about 34,257 (101)
Studies on Accurate Singular Value Decomposition for Bidiagonal Matrices
, 2016 openaire +2 more sources
Studies on a Parallel Algorithm for Bidiagonal Singular Value Decomposition
Studies on a Parallel Algorithm for Bidiagonal Singular Value Decompositionopenaire +1 more source
Bidiagonal decompositions of Vandermonde-type matrices of arbitrary rank [PDF]
Journal of Computational and Applied Mathematics, 2023 We present a method to derive new explicit expressions for bidiagonal decompositions of Vandermonde and related matrices such as the (q-, h-) Bernstein-Vandermonde ones, among others. These results generalize the existing expressions for nonsingular matrices to matrices of arbitrary rank.
Juan Manuel Pena +2 more
exaly +10 more sources
Bidiagonal decompositions of oscillating systems of vectors [PDF]
Linear Algebra and Its Applications, 2008 The authors obtain necessary and sufficient conditions for a matrix \(V\) to be a matrix of eigenvectors of a totally positive matrix. Namely, this is the case if and only if \(V\) and \(V^{-T}\) are lowerly totally positive. These conditions translate into easy requirements on the parameters in the bidiagonal decompositions of \(V\) and \(V^{-T}\). By
Froilan M Dopico, Plamen Koev
exaly +4 more sources
Bidiagonal decompositions and total positivity of some special matrices [PDF]
Operators and Matrices, 2022 The article contains 15 pages.
Priyanka Grover, Veer Singh Panwar
exaly +5 more sources
Accurate bidiagonal decompositions of Cauchy–Vandermonde matrices of any rank [PDF]
Numerical Linear Algebra With ApplicationsAbstractWe present a new decomposition of a Cauchy–Vandermonde matrix as a product of bidiagonal matrices which, unlike its existing bidiagonal decompositions, is now valid for a matrix of any rank. The new decompositions are insusceptible to the phenomenon known as subtractive cancellation in floating point arithmetic and are thus computable to high ...
Juan Manuel Pena +2 more
exaly +8 more sources
Some of the next articles are maybe not open access.
More Accurate Bidiagonal Reduction for Computing the Singular Value Decomposition
SIAM Journal on Matrix Analysis and Applications, 2002As a preliminary stage for computing the singular value decomposition of a matrix \(A \in R^{m \times n}\) (\(m \geq n\)) the reduction of \(A\) to a bidiagonal form is discussed, i.e. one has to find orthogonal matrices \(U \in R^{n \times n}\) and \(V \in R^{m \times m}\) such that \(U^T A^T V = (B 0)\) with a bidiagonal \((n \times n)\) matrix \(B\).
Jesse L Barlow
exaly +3 more sources
Singular value decomposition for bidiagonal filter matrices
Applied Mathematics and Computation, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jesús Gutiérrez-Gutiérrez +1 more
openaire +1 more source
Accurate Singular Values of Bidiagonal Matrices
SIAM Journal on Scientific and Statistical Computing, 1990 omputing the singular values of a bidiagonal matrix is the fin al phase of the standard algow rithm for the singular value decomposition of a general matrix.
James Demmel, W Kahan
exaly +1 more source