# Bidiagonal matrix

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2014

2014

- ACM Trans. Math. Softw.
- 2014

We show how both the tridiagonal and bidiagonal QR algorithms can be restructured so that they become rich in operations that canâ€¦Â (More)

Is this relevant?

Highly Cited

2013

Highly Cited

2013

- 2013

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

- IEEE Transactions on Parallel and Distributedâ€¦
- 2010

The objective of this paper is to extend, in the context of multicore architectures, the concepts of tile algorithms [Buttari etâ€¦Â (More)

Is this relevant?

2006

2006

- SIAM J. Matrix Analysis Applications
- 2006

We describe the design and implementation of a new algorithm for computing the singular value decomposition of a real bidiagonalâ€¦Â (More)

Is this relevant?

2005

2005

- SIAM J. Matrix Analysis Applications
- 2005

Abstract. Let T = LÎ©Lt be an invertible, unreduced, indefinite tridiagonal symmetric matrix with Î© a diagonal signature matrixâ€¦Â (More)

Is this relevant?

2000

2000

- 2000

There has been much recent interest, initiated by work of the physicists Hatano and Nelson, in the eigenvalues of certain randomâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- SIAM J. Matrix Analysis Applications
- 1995

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

- International Conference on Supercomputing
- 1994

In this paper, a review of methods for the solution of general bidiagonal systems of equations is done. Gaussian Elimination, theâ€¦Â (More)

Is this relevant?

1991

1991

- 1991

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

- SIAM J. Scientific Computing
- 1990

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)

Is this relevant?