2009Gongcheng shuxue xuebaoRequires access

Parallel Refined Davidson Method for Solving the Large Scale Eigenproblem

Hua Dai

Open publisher page 1 citations

Abstract

A parallel refined Davidson method is presented for large sparse symmetric eigenvalue problems,its implementation on PC network parallel systems and shared memory computer systems,as well as the parallelism are analyzed. The rows of the matrix are distributed to each processor,and the individual processors run the program by using the orthogonal basis of projection subspace and the rows of the matrix. Combine with the restarting scheme,the method can solve several eigenvalues and its associated eigenvectors of the matrix,and the method is successfully used for computing the frequency of a plane wing. The numerical experiments are done on the PC network parallel system and shared memory parallel system IBM-P650.

About this research paper

What this paper is about

A parallel refined Davidson method is presented for large sparse symmetric eigenvalue problems,its implementation on PC network parallel systems and shared memory computer systems,as well as the parallelism are analyzed. The rows of the matrix are distributed to each processor,and the individual processors run the program by using the orthogonal basis of projection subspace and the rows of the matrix. Combine with the restarting scheme,the method can solve several eigenvalues and its associated eigenvectors of the matrix,and the method is successfully used for computing the frequency of a plane wing. The numerical experiments are done on the PC network parallel system and shared memory parallel system IBM-P650.

Why it matters

OpenAlex reports 1 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

A parallel refined Davidson method is presented for large sparse symmetric eigenvalue problems,its implementation on PC network parallel systems and shared memory computer systems,as well as the parallelism are analyzed. The rows of the matrix are distributed to each processor,and the individual processors run the program by using the orthogonal basis of projection subspace and the rows of the matrix. Combine with the restarting scheme,the method can solve several eigenvalues and its associated eigenvectors of the matrix,and the method is successfully used for computing the frequency of a plane wing. The numerical experiments are done on the PC network parallel system and shared memory parallel system IBM-P650.

Key concepts: Eigenvalues and eigenvectors, Row, Distributed memory, Parallel computing, Shared memory, Matrix (chemical analysis), Computer science, Subspace topology

Related papers

Back to paper searchBrowse research topicsOriginal source
Parallel Refined Davidson Method for Solving the Large Scale Eigenproblem — Research Paper | ScholarLens