Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,023,882 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Bidiagonalization
LAPACK
List of numerical analysis topics
QR 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
E. Babichev
,
R. Brito
2015
Corpus ID: 118253750
We review the black hole (BH) solutions of the ghost-free massive gravity theory and its bimetric extension, and outline the main…
Expand
Highly Cited
2010
Highly Cited
2010
Accelerating the reduction to upper Hessenberg, tridiagonal, and bidiagonal forms through hybrid GPU-based computing
S. Tomov
,
Rajib Nath
,
J. Dongarra
Parallel Computing
2010
Corpus ID: 2238070
2008
2008
Nonnegative matrices with prescribed extremal singular values
E. Montaño
,
Mario Salas
,
R. Soto
Computers and Mathematics with Applications
2008
Corpus ID: 7969584
Highly Cited
2007
Highly Cited
2007
Calculating the singular values and pseudo-inverse of a matrix
G. Golub
,
W. Kahan
Milestones in Matrix Computation
2007
Corpus ID: 18407786
A numerically stable and fairly fast scheme is described to compute the unitary matrices U and V which transform a given matrix A…
Expand
2006
2006
Computing the Bidiagonal SVD Using Multiple Relatively Robust Representations
P. Willems
,
B. Lang
,
Christof Vömel
SIAM Journal on Matrix Analysis and Applications
2006
Corpus ID: 1135215
We describe the design and implementation of a new algorithm for computing the singular value decomposition (SVD) of a real…
Expand
Highly Cited
2006
Highly Cited
2006
Global least squares method (Gl-LSQR) for solving general linear systems with several right-hand sides
F. Toutounian
,
S. Karimi
Applied Mathematics and Computation
2006
Corpus ID: 10256797
2004
2004
Customizable triangular factorizations of matrices
Pengwei Hao
2004
Corpus ID: 16056033
Highly Cited
1995
Highly Cited
1995
A Divide-and-Conquer Algorithm for the Bidiagonal SVD
M. Gu
,
S. 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…
Expand
1994
1994
Parallel Tri- and Bi-Diagonalization of Bordered Bidiagonal Matrices
S. Huffel
,
Haesun Park
Parallel Computing
1994
Corpus ID: 9456518
Highly Cited
1990
Highly Cited
1990
Accurate Singular Values of Bidiagonal Matrices
J. Demmel
,
W. Kahan
SIAM Journal on Scientific Computing
1990
Corpus ID: 1424595
Computing the singular values of a bidiagonal matrix is the final phase of the standard algorithm for the singular value…
Expand
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)
ACCEPT & CONTINUE