On the solution of block Hessenberg systems
- 1 May 1995
- journal article
- research article
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 2 (3) , 287-296
- https://doi.org/10.1002/nla.1680020309
Abstract
This paper describes a divide‐and‐conquer strategy for solving block Hessenberg systems. For dense matrices the method is as efficient as Gaussian elimination; however, because it works almost entirely with the original blocks, it is much more efficient for sparse matrices or matrices whose blocks can be generated on the fly. For Toeplitz matrices, the algorithm can be combined with the fast Fourier transform.Keywords
This publication has 6 references indexed in Scilit:
- On the Orthogonality of Eigenvectors Computed by Divide-and-Conquer TechniquesSIAM Journal on Numerical Analysis, 1991
- A Fully Parallel Algorithm for the Symmetric Eigenvalue ProblemSIAM Journal on Scientific and Statistical Computing, 1987
- A divide and conquer method for the symmetric tridiagonal eigenproblemNumerische Mathematik, 1980
- Partitioning and Tearing Systems of EquationsJournal of the Society for Industrial and Applied Mathematics Series B Numerical Analysis, 1965
- On an Approach to Techniques for the Analysis of the Structure of Large Systems of EquationsSIAM Review, 1962
- A Set of Principles to Interconnect the Solutions of Physical SystemsJournal of Applied Physics, 1953