Skip to search formSkip to main contentSkip to account menu
You are currently offline. Some features of the site may not work correctly.

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

Related topics

Related topics

6 relations
BidiagonalizationLAPACKList of numerical analysis topicsQR algorithm
Expand

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 solutions of the ghost-free massive gravity theory and its bimetric extension and outline the main… 
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2010
Highly Cited
2010
Accelerating the reduction to upper Hessenberg, tridiagonal, and bidiagonal forms through hybrid GPU-based computing
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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… 
  • figure 6.1
  • table 6.1
2004
2004
Customizable triangular factorizations of matrices
2001
2001
Fast and stable algorithms for reducing diagonal plus semiseparable matrices to tridiagonal and bidiagonal form
New algorithms to reduce a diagonal plus a symmetric semiseparable matrix to a symmetric tridiagonal one and an algorithm to… 
Highly Cited
1995
Highly Cited
1995
A Divide-and-Conquer Algorithm for the Bidiagonal SVD
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
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
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… 
  • table 2
  • table 3
  • table 4
  • table 5
1974
1974
Negative integral powers of a bidiagonal matrix
The elements of the inverse of a bidiagonal matrix have been expressed in a convenient form. The higher negative integral powers… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE