2010Unpublished venueRequires access

An Implementation of Matrix Eigenvalue Decomposition with Improved Jacobi Algorithm

Wei Mei, Ming Jin, Shuai Liu, Qiao Xiao Lin, Qian Wei Qiang

Open publisher page 5 citations

Abstract

Eigenvalue decomposition for real symmetric matrix is significant in mathematics and engineering. In engineering implementation, most of implementation for eigenvalue decomposition based on hardware prefers to choose Jacobi algorithm because of its inherent parallelism. But the calculated eigenvalue and its corresponding eigenvector from traditional Jacobi algorithm are unordered arrangement. To solve this problem, an improved Jacobi is proposed in this paper, which can get eigenvalue and eigenvector in descending order.

About this research paper

What this paper is about

Eigenvalue decomposition for real symmetric matrix is significant in mathematics and engineering. In engineering implementation, most of implementation for eigenvalue decomposition based on hardware prefers to choose Jacobi algorithm because of its inherent parallelism. But the calculated eigenvalue and its corresponding eigenvector from traditional Jacobi algorithm are unordered arrangement. To solve this problem, an improved Jacobi is proposed in this paper, which can get eigenvalue and eigenvector in descending order.

Why it matters

OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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

Eigenvalue decomposition for real symmetric matrix is significant in mathematics and engineering. In engineering implementation, most of implementation for eigenvalue decomposition based on hardware prefers to choose Jacobi algorithm because of its inherent parallelism. But the calculated eigenvalue and its corresponding eigenvector from traditional Jacobi algorithm are unordered arrangement. To solve this problem, an improved Jacobi is proposed in this paper, which can get eigenvalue and eigenvector in descending order.

Key concepts: Jacobi eigenvalue algorithm, Eigenvalues and eigenvectors, Divide-and-conquer eigenvalue algorithm, Eigendecomposition of a matrix, Jacobi method, Inverse iteration, Algorithm, Decomposition

Related papers

Back to paper searchBrowse research topicsOriginal source
An Implementation of Matrix Eigenvalue Decomposition with Improved Jacobi Algorithm — Research Paper | ScholarLens