Computing orthogonal decompositions of block tridiagonal or banded matrices

Authors:
Wilfried N. Gansterer
Affiliations:
Institute of Distributed and Multimedia Systems, University of Vienna, Austria
Venue:
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I
Year:
2005

Citing 7
Cited 0

Updating a rank-revealing ULV decomposition

SIAM Journal on Matrix Analysis and Applications
Downdating the Rank-Revealing URV Decomposition

SIAM Journal on Matrix Analysis and Applications
A new O (N(2)) algorithm for the symmetric tridiagonal eigenvalue/eigenvector problem

A new O (N(2)) algorithm for the symmetric tridiagonal eigenvalue/eigenvector problem
An extension of the divide-and-conquer method for a class of symmetric block-tridiagonal eigenproblems

ACM Transactions on Mathematical Software (TOMS)
Updating a Generalized URV Decomposition

SIAM Journal on Matrix Analysis and Applications
Computing Approximate Eigenpairs of Symmetric Block Tridiagonal Matrices

SIAM Journal on Scientific Computing
Block tridiagonalization of "effectively" sparse symmetric matrices

ACM Transactions on Mathematical Software (TOMS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

A method for computing orthogonal URV/ULV decompositions of block tridiagonal (or banded) matrices is presented. The method discussed transforms the matrix into structured triangular form and has several attractive properties: The block tridiagonal structure is fully exploited; high data locality is achieved, which is important for high efficiency on modern computer systems; very little fill-in occurs, which leads to no or very low memory overhead; and in most practical situations observed the transformed matrix has very favorable numerical properties. Two variants of this method are introduced and compared.