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.
Chapter PDF
Similar content being viewed by others
Keywords
- Orthogonal Factorization
- Symmetric Block
- Approximate Eigenvector
- Modern Computer System
- Block Tridiagonal Matrix
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Acoustics Research Institute of the Austrian Academy of Sciences: Vibrations in soils and liquids – transform method for layers with random properties. FWF-Project P16224-N07 (2004)
Bai, Y., Gansterer, W.N., Ward, R.C.: Block tridiagonalization of “effectively” sparse symmetric matrices. ACM Trans. Math. Softw. 30, 326–352 (2004)
Stewart, G.W.: Updating a rank-revealing ULV decomposition. SIAM J. Matrix Anal. Appl. 14, 494–499 (1993)
Park, H., Elden, L.: Downdating the rank-revealing URV decomposition. SIAM J. Matrix Anal. Appl. 16, 138–155 (1995)
Stewart, M., Van Dooren, P.: Updating a generalized URV decomposition. SIAM J. Matrix Anal. Appl. 22, 479–500 (2000)
Gansterer, W.N., Kreuzer, W., Ward, R.C.: Computing eigenvectors of block tridiagonal matrices (2005) (in preparation)
Gansterer, W.N., Ward, R.C., Muller, R.P.: An extension of the divide-and-conquer method for a class of symmetric block-tridiagonal eigenproblems. ACM Trans. Math. Softw. 28, 45–58 (2002)
Gansterer, W.N., Ward, R.C., Muller, R.P., Goddard III., W.A.: Computing approximate eigenpairs of symmetric block tridiagonal matrices. SIAM J. Sci. Comput. 25, 65–85 (2003)
Dhillon, I.S.: A New O(n 2) Algorithm for the Symmetric Tridiagonal Eigenvalue/Eigenvector Problem. PhD thesis, Computer Science Division (EECS), University of California at Berkeley (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gansterer, W.N. (2005). Computing Orthogonal Decompositions of Block Tridiagonal or Banded Matrices. In: Sunderam, V.S., van Albada, G.D., Sloot, P.M.A., Dongarra, J.J. (eds) Computational Science – ICCS 2005. ICCS 2005. Lecture Notes in Computer Science, vol 3514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11428831_4
Download citation
DOI: https://doi.org/10.1007/11428831_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26032-5
Online ISBN: 978-3-540-32111-8
eBook Packages: Computer ScienceComputer Science (R0)