1996•Unpublished venueRequires access

EIGENVALUE SHIFT SUPERRESOLUTION ALGORITHM

Costind Beijing

Open publisher page 0 citations

Abstract

The convergence of the inverse correlation matrix iteration algorithm is analyzed. In order to avoid computing the inverse correlation matrix in the algorithm, this paper presents an eigenvalue shift iteration algorithm, and analyzes its convergence. Finally, the simulated results are given.

About this research paper

What this paper is about

The convergence of the inverse correlation matrix iteration algorithm is analyzed. In order to avoid computing the inverse correlation matrix in the algorithm, this paper presents an eigenvalue shift iteration algorithm, and analyzes its convergence. Finally, the simulated results are given.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The convergence of the inverse correlation matrix iteration algorithm is analyzed. In order to avoid computing the inverse correlation matrix in the algorithm, this paper presents an eigenvalue shift iteration algorithm, and analyzes its convergence. Finally, the simulated results are given.

Key concepts: Convergence (economics), Algorithm, Eigenvalues and eigenvectors, Inverse iteration, Inverse, Mathematics, Matrix (chemical analysis), Power iteration

Related papers

Back to paper searchBrowse research topicsOriginal source
EIGENVALUE SHIFT SUPERRESOLUTION ALGORITHM — Research Paper | ScholarLens