Paper
7 June 1995 Error analysis of a fast partial pivoting method for structured matrices
Douglas Robin Sweet, Richard P. Brent
Author Affiliations +
Abstract
Many matrices that arise in the solution of signal processing have a special displacement structure. For example, adaptive filtering and direction-of-arrival estimation yield matrices of a Toeplitz type. A recent method of Gohberg, Kailath, and Olshevsky (GKO) allows fast Gaussian elimination with partial pivoting for such structured matrices. In this paper, a rounding error analysis is performed on the Cauchy and Toeplitz variants of the GKO method. It is shown the error growth depends on the growth in certain auxiliary vectors, the generators, which are computed by the GKO algorithms, It is also shown that in certain circumstances, the growth in the generators can be large, and so the error growth is much larger than would be encountered with normal Gaussian elimination with partial pivoting. A modification of the algorithm to perform a type of row-column pivoting is proposed which may circumvent this problem.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Douglas Robin Sweet and Richard P. Brent "Error analysis of a fast partial pivoting method for structured matrices", Proc. SPIE 2563, Advanced Signal Processing Algorithms, (7 June 1995); https://doi.org/10.1117/12.211404
Lens.org Logo
CITATIONS
Cited by 24 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Matrices

Error analysis

Chemical elements

Algorithm development

Transform theory

Signal processing

Silicon

Back to Top