Accurate Singular Values of Bidiagonal Matrices
From MaRDI portal
Publication:3485795
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
Cited in
(82)- A Schatten-q low-rank matrix perturbation analysis via perturbation projection error bound
- Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian
- Subtraction-free recurrence relations for lower bounds of the minimal singular value of an upper bidiagonal matrix
- Accurate eigenvalues and exact zero Jordan blocks of totally nonnegative matrices
- A HYBRID APPROACH FOR DETERMINANT SIGNS OF MODERATE-SIZED MATRICES
- A shift strategy for superquadratic convergence in the dqds algorithm for singular values
- Accurate eigenvalues of some generalized sign regular matrices via relatively robust representations
- Computing the complete CS decomposition
- A QR-method for computing the singular values via semiseparable matrices
- Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices
- Computing the Bidiagonal SVD Through an Associated Tridiagonal Eigenproblem
- 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
- On stable parameter estimation and forecasting in epidemiology by the Levenberg-Marquardt algorithm with Broyden's rank-one updates for the Jacobian operator
- 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
- Accurate computation of singular values in terms of shifted integrable schemes
- Relative perturbation theory. III: More bounds on eigenvalue variation
- Optimal boundary feedback flow stabilization by model reduction
- On Moore-Penrose pseudoinverse computation for stiffness matrices resulting from higher order approximation
- Accurate computations for eigenvalues of products of Cauchy-polynomial-Vandermonde matrices
- Spectral sensitivity of products of bidiagonals
- On TSVD regularization for a Broyden-type algorithm
- Fitting helices to data by total least squares
- One-sided reduction to bidiagonal form
- On sensitivity of Gauss-Christoffel quadrature
- A Parallel Algorithm for Computing the Eigenvalues of a Symmetric Tridiagonal Matrix
- Accurate algorithms for Bessel matrices
- Numerical computation of an analytic singular value decomposition of a matrix valued function
- Computing eigenvalues of quasi-rational Said-Ball-Vandermonde matrices
- An implicit shift bidiagonalization algorithm for ill-posed systems
- 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
- A high performance QDWH-SVD solver using hardware accelerators
- 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
- Absolute and relative Weyl theorems for generalized eigenvalue problems
- More accurate bidiagonal reduction for computing the singular value decomposition
- The power of bidiagonal matrices
- 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)
- Accurate eigenvalues of certain sign regular matrices
- Computing singular values of diagonally dominant matrices to high relative accuracy
- Continuous versions of some discrete maps or what goes on when the lights go out
- Neville elimination for rank-structured matrices
- Discrete Lotka-Volterra with shift algorithm for computing matrix eigenvalues and singular values
- Estimating the largest singular values of large sparse matrices via modified moments
- Numerical methods for accurate computation of the eigenvalues of Hermitian matrices and the singular values of general matrices
- Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems
- scientific article; zbMATH DE number 18990 (Why is no real title available?)
- Computing Gaussian quadrature rules with high relative accuracy
- A CS decomposition for orthogonal matrices with application to eigenvalue computation
- Restructuring the tridiagonal and bidiagonal QR algorithms for performance
- A note on an upper and a lower bound on sines between eigenspaces for regular Hermitian matrix pairs
- scientific article; zbMATH DE number 1138082 (Why is no real title available?)
- Relative perturbation theory. IV: \(\sin 2\theta\) theorems
- Error analysis of the mdLVs algorithm for computing bidiagonal singular values
- Spatially quasi-periodic bifurcations from periodic traveling water waves and a method for detecting bifurcations using signed singular values
- Relative perturbation theory for quadratic Hermitian eigenvalue problems
- Rigorous proof of cubic convergence for the dqds algorithm for singular values
- Superquadratic convergence of DLASQ for computing matrix singular values
- Improving the Accuracy of Computed Singular Values
- A qd-type method for computing generalized singular values of BF matrix pairs with sign regularity to high relative accuracy
- Computing singular value decompositions of parameterized matrices with total nonpositivity 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
- Iterative algorithms for computing the singular subspace of a matrix associated with its smallest singular values
- Parallel codes for computing the numerical rank
- Accurate inverses for computing eigenvalues of extremely ill-conditioned matrices and differential operators
- Evaluation of news search engines based on information retrieval models
- On an eigenvector-dependent nonlinear eigenvalue problem from the perspective of relative perturbation theory
- The singular value decomposition: anatomy of optimizing an algorithm for extreme scale
- Methods and algorithms of solving spectral problems for polynomial and rational matrices
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)
