Paper
28 October 1994 Implementation of a superfast algorithm for symmetric positive definite linear equations of displacement rank 2
Thomas K. Huckle
Author Affiliations +
Abstract
In this paper we describe the implementation and first numerical results for the superfast algorithm based on a modified version of the Bitmead/Anderson-algorithm for real symmetric positive definite matrices of displacement rank 2. The total number of arithmetic operations for this algorithm is of order 93.75 nlog(n)2 flops. The method is based on repeatedly dividing the original problem into two subproblems with leading principal submatrix and the related Schur complement. All occurring matrices are represented by generating vectors of their displacement rank characterization.
© (1994) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Thomas K. Huckle "Implementation of a superfast algorithm for symmetric positive definite linear equations of displacement rank 2", Proc. SPIE 2296, Advanced Signal Processing: Algorithms, Architectures, and Implementations V, (28 October 1994); https://doi.org/10.1117/12.190861
Lens.org Logo
CITATIONS
Cited by 3 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Matrices

MATLAB

Fourier transforms

Zinc

Algorithm development

Adaptive optics

Americium

Back to Top