Skip to search formSkip to main contentSkip to account menu

Bidiagonalization

Known as: Bi-diagonalization 
Bidiagonalization is one of unitary (orthogonal) matrix decompositions such that U* A V = B, where U and V are unitary (orthogonal) matrices… 
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations
Bidiagonal matrixCharacteristic polynomialLanczos algorithmList of numerical analysis topics

Broader (1)

Numerical linear algebra

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
A fast algorithm for regularized focused 3-D inversion of gravity data using the randomized SVD
A fast algorithm for solving the under-determined 3-D linear gravity inverse problem based on the randomized singular value… 
2013
2013
GENERALIZED GOLUB–KAHAN BIDIAGONALIZATION AND STOPPING CRITERIA∗
The Golub–Kahan bidiagonalization algorithm has been widely used in solving leastsquares problems and in the computation of the… 
2013
2013
New Frontiers in Numerical Analysis and Scientific Computing — – A conference on the occasion of Lothar Reichel ’ s 60 th birthday and on the 20 th anniversary of ETNA April 19-20 , 2013
The LSQR iterative method for solving least-squares problems may require many iterations to determine an approximate solution… 
2011
2011
Contributions au traitement des signaux à valeurs sur des structures algébriques non-commutatives
Les travaux presentes s'interessent au traitement des signaux a valeurs sur des espaces non-commutatifs, en particulier sur le… 
2006
2006
Bidiagonalization as a fundamental decomposition of data in linear approximation problems
• First, the lower bidiagonal matrix A11 with nonzero bidiagonal elements has full column rank and its singular values are simple… 
2005
2005
A High Performance C Package for Tridiagonalization of Complex Symmetric Matrices
Block algorithms have better performance than scalar and single vector algorithms due to their exploitation of memory hierarchy… 
2004
2004
Information Retrieval Using Krylov Subspace Methods
In this dissertation we discuss how simple Krylov subspace methods can be used for information retrieval (IR). The dissertation… 
2003
2003
An Implicitly Restarted Lanczos Bidiagonalization Method for Computing Smallest Singular Triplets
We describe the development of a method for the efficient computation of the smallest singular values and corresponding vectors… 
1998
1998
BLOCK BIDIAGONALIZATION METHODS FORSOLVING NONSYMMETRIC LINEAR SYSTEMS WITHMULTIPLE RIGHT-HAND
Many applications require the solution of large nonsymmetric linear systems with multiple right-hand sides. Instead of applying… 
1994
1994
Parallel tri-diagonalization and bi-diagonalization of bordered bidiagonal matrices
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)