Skip to search formSkip to main contentSkip to account menu

Bidiagonal matrix

In mathematics, a bidiagonal matrix is a matrix with non-zero entries along the main diagonal and either the diagonal above or the diagonal below… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
BidiagonalizationLAPACKList of numerical analysis topicsQR algorithm

Broader (1)

Linear algebra

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2015
Review
2015
Black holes in massive gravity
We review the black hole (BH) solutions of the ghost-free massive gravity theory and its bimetric extension, and outline the main… 
Highly Cited
2010
Highly Cited
2010
Accelerating the reduction to upper Hessenberg, tridiagonal, and bidiagonal forms through hybrid GPU-based computing
2008
2008
Nonnegative matrices with prescribed extremal singular values
Highly Cited
2007
Highly Cited
2007
Calculating the singular values and pseudo-inverse of a matrix
A numerically stable and fairly fast scheme is described to compute the unitary matrices U and V which transform a given matrix A… 
2006
2006
Computing the Bidiagonal SVD Using Multiple Relatively Robust Representations
We describe the design and implementation of a new algorithm for computing the singular value decomposition (SVD) of a real… 
Highly Cited
2006
Highly Cited
2006
Global least squares method (Gl-LSQR) for solving general linear systems with several right-hand sides
2004
2004
Customizable triangular factorizations of matrices
Highly Cited
1995
Highly Cited
1995
A Divide-and-Conquer Algorithm for the Bidiagonal SVD
  • M. GuS. Eisenstat
  • SIAM Journal on Matrix Analysis and Applications
  • 1995
  • Corpus ID: 207080425
The authors present a stable and efficient divide-and-conquer algorithm for computing the singular value decomposition (SVD) of a… 
1994
1994
Parallel Tri- and Bi-Diagonalization of Bordered Bidiagonal Matrices
Highly Cited
1990
Highly Cited
1990
Accurate Singular Values of Bidiagonal Matrices
Computing the singular values of a bidiagonal matrix is the final phase of the standard algorithm for the singular value… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)