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… (More)
Wikipedia

Related topics

Related topics

5 relations
BidiagonalizationLAPACKQR algorithmSingular value decomposition

Broader (1)

Linear algebra

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Restructuring the Tridiagonal and Bidiagonal QR Algorithms for Performance
We show how both the tridiagonal and bidiagonal QR algorithms can be restructured so that they become rich in operations that can… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 8
Is this relevant?
Highly Cited
2013
Highly Cited
2013
CALCULATING THE SINGULAR VALUES AND PSEUDO-INVERSE OF A MATRIX*
A numerically stable and fairly fast scheme is described to compute the unitary matrices U and V which transform a given matrix A… (More)
Is this relevant?
2010
2010
Parallel Two-Sided Matrix Reduction to Band Bidiagonal Form on Multicore Architectures
The objective of this paper is to extend, in the context of multicore architectures, the concepts of tile algorithms [Buttari et… (More)
  • figure 1
  • figure 4
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
2006
2006
Computing the Bidiagonal SVD Using Multiple Relatively Robust Representations
We describe the design and implementation of a new algorithm for computing the singular value decomposition of a real bidiagonal… (More)
  • figure 6.1
  • table 6.1
Is this relevant?
2005
2005
A Bidiagonal Matrix Determines Its Hyperbolic SVD to Varied Relative Accuracy
Abstract. Let T = LΩLt be an invertible, unreduced, indefinite tridiagonal symmetric matrix with Ω a diagonal signature matrix… (More)
Is this relevant?
2000
2000
Spectra , Pseudospectra , and Localization for Random Bidiagonal Matrices
There has been much recent interest, initiated by work of the physicists Hatano and Nelson, in the eigenvalues of certain random… (More)
  • figure 2.1
  • figure 2.2
  • figure 3.1
  • figure 4.1
  • figure 4.2
Is this relevant?
Highly Cited
1995
Highly Cited
1995
A Divide-and-Conquer Algorithm for the Bidiagonal SVD
Abstract. The authors present a stable and efficient divide-and-conquer algorithm for computing the singular value decomposition… (More)
Is this relevant?
Review
1994
Review
1994
A generalized vision of some parallel bidiagonal systems solvers
In this paper, a review of methods for the solution of general bidiagonal systems of equations is done. Gaussian Elimination, the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1991
1991
The Bidiagonal Singular Value Decomposition and Hamiltonian Mechanics
We consider computing the singular value decomposition of a bidiagonal matrix B. This problem arises in the singular value… (More)
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Accurate Singular Values of Bidiagonal Matrices
C Abstract om puting the singular valu es of a bidiagonal m atrix is the fin al phase of the stan dard algo-w rithm for the… (More)
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?