Paper
23 February 1988 Approximate Inversion Of Positive Definite Matrices, Specified On A Multiple Band
H. Nelis, E. Deprettere, P. Dewilde
Author Affiliations +
Abstract
A fast algorithm is presented which can be used to compute an approximate inverse of a positive definite matrix if that matrix is specified only on a multiple band. The approximate inverse is the inverse of a matrix that closely matches the partially specified matrix. It has zeros in the positions that correspond to unspecified entries in the partially specified matrix. It is closely related to the so-called maximum-entropy extension of this matrix. The algorithm is very well suited for implementation on an array processor.
© (1988) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
H. Nelis, E. Deprettere, and P. Dewilde "Approximate Inversion Of Positive Definite Matrices, Specified On A Multiple Band", Proc. SPIE 0975, Advanced Algorithms and Architectures for Signal Processing III, (23 February 1988); https://doi.org/10.1117/12.948490
Lens.org Logo
CITATIONS
Cited by 18 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Matrices

Signal processing

Algorithms

Platinum

Array processing

Stochastic processes

Evolutionary algorithms

Back to Top