Share Email Print

Proceedings Paper

Implementation of a superfast algorithm for symmetric positive definite linear equations of displacement rank 2
Author(s): Thomas K. Huckle
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 28 October 1994
PDF: 10 pages
Proc. SPIE 2296, Advanced Signal Processing: Algorithms, Architectures, and Implementations V, (28 October 1994); doi: 10.1117/12.190861
Show Author Affiliations
Thomas K. Huckle, Inst. fuer Angewandte (Germany)

Published in SPIE Proceedings Vol. 2296:
Advanced Signal Processing: Algorithms, Architectures, and Implementations V
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?