Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
SUMMARY A class of sign-symmetric P-matrices including all nonsingular totally positive matrices and their inverses as well as… Expand
Is this relevant?
Highly Cited
2010
Highly Cited
2010
We present a Hessenberg reduction (HR) algorithm for hybrid systems of homogeneous multicore with GPU accelerators that can… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
The objective of this paper is to extend, in the context of multicore architectures, the concepts of tile algorithms [Buttari et… Expand
  • figure 1
  • figure 4
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
2009
2009
This paper presents a new robust reference watermarking scheme based on wavelet packet transform (WPT) and bidiagonal singular… Expand
Is this relevant?
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… Expand
Is this relevant?
2006
2006
We describe the design and implementation of a new algorithm for computing the singular value decomposition (SVD) of a real… Expand
  • figure 6.1
  • table 6.1
Is this relevant?
Highly Cited
1995
Highly Cited
1995
The authors present a stable and efficient divide-and-conquer algorithm for computing the singular value decomposition (SVD) of a… Expand
Is this relevant?
1994
1994
We have previously presented various plane rotation patterns, which provide stable O(N2) algorithms for reducing a b-band matrix… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
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… Expand
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
1977
Highly Cited
1977
Necessary and sufficient conditions are given for the existence of the group and Drazin inverses of bidiagonal and triangular… Expand
Is this relevant?