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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2015
Review
2015
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
2007
Highly Cited
2007
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
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
2001
2001
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
The authors present a stable and efficient divide-and-conquer algorithm for computing the singular value decomposition (SVD) of a… 
Highly Cited
1990
Highly Cited
1990
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
The elements of the inverse of a bidiagonal matrix have been expressed in a convenient form. The higher negative integral powers…