Accurate Singular Values of Bidiagonal Matrices
DOI10.1137/0911052zbMATH Open0705.65027OpenAlexW2077166865WikidataQ56135298 ScholiaQ56135298MaRDI QIDQ3485795FDOQ3485795
Authors: William Kahan, James Demmel
Publication date: 1990
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0911052
Recommendations
- Accurate singular values and differential qd algorithms
- Computing the singular value decomposition with high relative accuracy
- More accurate bidiagonal reduction for computing the singular value decomposition
- Computing the Bidiagonal SVD Using Multiple Relatively Robust Representations
- On computing accurate singular values and eigenvalues of matrices with acyclic graphs
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Roundoff error (65G50) Numerical computation of matrix norms, conditioning, scaling (65F35)
Cited In (82)
- A Schatten-\(q\) low-rank matrix perturbation analysis via perturbation projection error bound
- Subtraction-free recurrence relations for lower bounds of the minimal singular value of an upper bidiagonal matrix
- Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian
- A shift strategy for superquadratic convergence in the dqds algorithm for singular values
- Computing the complete CS decomposition
- Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices
- A QR-method for computing the singular values via semiseparable matrices
- Accurate solutions of structured generalized Kronecker product linear systems
- Perturbation theory for the LDU factorization and accurate computations for diagonally dominant matrices
- Relative perturbation bounds for the unitary polar factor
- Accurate SVDs of polynomial Vandermonde matrices involving orthonormal polynomials
- A periodic qd-type reduction for computing eigenvalues of structured matrix products to high relative accuracy
- Computing eigenvectors of block tridiagonal matrices based on twisted block factorizations
- Results on the relative perturbation of the singular values of a matrix
- Accurate SVDs of weakly diagonally dominant M-matrices
- Implicit standard Jacobi gives high relative accuracy
- Computation of exact inertia and inclusions of eigenvalues (singular values) of tridiagonal (bidiagonal) matrices
- Relative perturbation theory. III: More bounds on eigenvalue variation
- Accurate computation of singular values in terms of shifted integrable schemes
- Optimal boundary feedback flow stabilization by model reduction
- On Moore-Penrose pseudoinverse computation for stiffness matrices resulting from higher order approximation
- A Parallel Algorithm for Computing the Eigenvalues of a Symmetric Tridiagonal Matrix
- On TSVD regularization for a Broyden-type algorithm
- Spectral sensitivity of products of bidiagonals
- On sensitivity of Gauss-Christoffel quadrature
- Fitting helices to data by total least squares
- An implicit shift bidiagonalization algorithm for ill-posed systems
- Numerical computation of an analytic singular value decomposition of a matrix valued function
- An algorithm to compute the polar decomposition of a \(3 \times 3\) matrix
- Highly accurate symmetric eigenvalue decomposition and hyperbolic SVD
- Residual bounds for some or all singular values
- Floating-point perturbations of Hermitian matrices
- Accurate computation of the smallest eigenvalue of a diagonally dominant \(M\)-matrix
- An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths
- More accurate bidiagonal reduction for computing the singular value decomposition
- Absolute and relative Weyl theorems for generalized eigenvalue problems
- On computing accurate singular values and eigenvalues of matrices with acyclic graphs
- An \({\mathcal O}(n^{2})\) algorithm for the bidiagonal SVD
- An implementation of the dqds algorithm (positive case)
- Computing singular values of diagonally dominant matrices to high relative accuracy
- Neville elimination for rank-structured matrices
- Accurate eigenvalues of certain sign regular matrices
- Continuous versions of some discrete maps or what goes on when the lights go out
- Estimating the largest singular values of large sparse matrices via modified moments
- Restructuring the tridiagonal and bidiagonal QR algorithms for performance
- Computing Gaussian quadrature rules with high relative accuracy
- Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems
- A CS decomposition for orthogonal matrices with application to eigenvalue computation
- A note on an upper and a lower bound on sines between eigenspaces for regular Hermitian matrix pairs
- Title not available (Why is that?)
- Relative perturbation theory. IV: \(\sin 2\theta\) theorems
- Error analysis of the mdLVs algorithm for computing bidiagonal singular values
- Relative perturbation theory for quadratic Hermitian eigenvalue problems
- Rigorous proof of cubic convergence for the dqds algorithm for singular values
- Improving the Accuracy of Computed Singular Values
- Superquadratic convergence of DLASQ for computing matrix singular values
- Computing singular value decompositions of parameterized matrices with total nonpositivity to high relative accuracy
- Iterative algorithms for computing the singular subspace of a matrix associated with its smallest singular values
- Accurate inverses for computing eigenvalues of extremely ill-conditioned matrices and differential operators
- Parallel codes for computing the numerical rank
- The singular value decomposition: anatomy of optimizing an algorithm for extreme scale
- Methods and algorithms of solving spectral problems for polynomial and rational matrices
- A HYBRID APPROACH FOR DETERMINANT SIGNS OF MODERATE-SIZED MATRICES
- Accurate eigenvalues and exact zero Jordan blocks of totally nonnegative matrices
- Accurate eigenvalues of some generalized sign regular matrices via relatively robust representations
- Computing the Bidiagonal SVD Through an Associated Tridiagonal Eigenproblem
- On stable parameter estimation and forecasting in epidemiology by the Levenberg-Marquardt algorithm with Broyden's rank-one updates for the Jacobian operator
- Accurate computations for eigenvalues of products of Cauchy-polynomial-Vandermonde matrices
- Computing eigenvalues of quasi-rational Said-Ball-Vandermonde matrices
- One-sided reduction to bidiagonal form
- Accurate algorithms for Bessel matrices
- A high performance QDWH-SVD solver using hardware accelerators
- The power of bidiagonal matrices
- Discrete Lotka-Volterra with shift algorithm for computing matrix eigenvalues and singular values
- Numerical methods for accurate computation of the eigenvalues of Hermitian matrices and the singular values of general matrices
- Title not available (Why is that?)
- Spatially quasi-periodic bifurcations from periodic traveling water waves and a method for detecting bifurcations using signed singular values
- A qd-type method for computing generalized singular values of BF matrix pairs with sign regularity to high relative accuracy
- A note on generating finer‐grain parallelism in a representation tree
- Evaluation of small elements of the eigenvectors of certain symmetric tridiagonal matrices with high relative accuracy
- Evaluation of news search engines based on information retrieval models
- On an eigenvector-dependent nonlinear eigenvalue problem from the perspective of relative perturbation theory
Uses Software
This page was built for publication: Accurate Singular Values of Bidiagonal Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3485795)