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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Gansterer, W. N. (2005). Computing orthogonal decompositions of block tridiagonal or banded matrices. In Lecture Notes in Computer Science (Vol. 3514, pp. 25–32). Springer Verlag. https://doi.org/10.1007/11428831_4
Mendeley helps you to discover research relevant for your work.