Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,004,575 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Bidiagonal matrix
Characteristic polynomial
Lanczos algorithm
List of numerical analysis topics
Expand
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
S. Vatankhah
,
R. Renaut
,
V. E. Ardestani
2017
Corpus ID: 10854054
A fast algorithm for solving the under-determined 3-D linear gravity inverse problem based on the randomized singular value…
Expand
2015
2015
Batched Linear Algebra Problems on GPU Accelerators
Tingxing Dong
2015
Corpus ID: 61249425
The emergence of multicore and heterogeneous architectures requires many linear algebra algorithms to be redesigned to take…
Expand
2013
2013
GENERALIZED GOLUB–KAHAN BIDIAGONALIZATION AND STOPPING CRITERIA∗
M. SIAMJ.
2013
Corpus ID: 264970767
The Golub–Kahan bidiagonalization algorithm has been widely used in solving leastsquares problems and in the computation of the…
Expand
2011
2011
DYNAMIC ORDERING FOR THE PARALLEL ONE-SIDED BLOCK-JACOBI SVD ALGORITHM
Vajteršic
,
ParNum
2011
Corpus ID: 14737124
The serial Jacobi algorithm (either one-sided or two-sided) for the computation of a singular value decomposition (SVD) of a…
Expand
2006
2006
Bidiagonalization as a fundamental decomposition of data in linear approximation problems
Z. Strakoš
,
C. Paige
2006
Corpus ID: 2820490
• First, the lower bidiagonal matrix A11 with nonzero bidiagonal elements has full column rank and its singular values are simple…
Expand
2005
2005
A High Performance C Package for Tridiagonalization of Complex Symmetric Matrices
Guohong Liu
,
S. Qiao
,
C. Qiao
2005
Corpus ID: 512107
Block algorithms have better performance than scalar and single vector algorithms due to their exploitation of memory hierarchy…
Expand
2004
2004
Information Retrieval Using Krylov Subspace Methods
K. Blom
2004
Corpus ID: 15946793
In this dissertation we discuss how simple Krylov subspace methods can be used for information retrieval (IR). The dissertation…
Expand
2003
2003
An Implicitly Restarted Lanczos Bidiagonalization Method for Computing Smallest Singular Triplets
E. Kokiopoulou
,
C. Bekas
,
Efstratios Gallopoulos
2003
Corpus ID: 16743274
We describe the development of a method for the efficient computation of the smallest singular values and corresponding vectors…
Expand
2001
2001
BLOCK BIDIAGONALIZATION METHODS FOR MULTIPLE NONSYMMETRIC LINEAR SYSTEMS
Dai
,
Hua
2001
Corpus ID: 124633973
The symmetric linear system gives us many simplifications and a possibility to adapt the computations to the computer at hand in…
Expand
1998
1998
BLOCK BIDIAGONALIZATION METHODS FORSOLVING NONSYMMETRIC LINEAR SYSTEMS WITHMULTIPLE RIGHT-HAND
Sideshua Dai
1998
Corpus ID: 15551519
Many applications require the solution of large nonsymmetric linear systems with multiple right-hand sides. Instead of applying…
Expand