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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2015
Review
2015
We review the black hole (BH) solutions of the ghost-free massive gravity theory and its bimetric extension, and outline the main… 
2008
2008
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… 
Highly Cited
2006
Highly Cited
1995
Highly Cited
1995
  • 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… 
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…