Parallel computation of spectral portrait of large matrices by Davidson type methods (Q1385160)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Parallel computation of spectral portrait of large matrices by Davidson type methods |
scientific article; zbMATH DE number 1146038
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel computation of spectral portrait of large matrices by Davidson type methods |
scientific article; zbMATH DE number 1146038 |
Statements
Parallel computation of spectral portrait of large matrices by Davidson type methods (English)
0 references
26 September 1999
0 references
The paper concerns spectral portrait computations and plotting for non-normal sparse and large matrices. The method chosen has been proposed by \textit{E. R. Davidson} [J. Comput. Phys. 17, 87-94 (1975; Zbl 0293.65022)]. The authors develop an efficient parallelization of this method which allows to compute the spectral portraits on distributed-memory parallel computer systems. For the general Davidson method, a selection of two preconditioners is shown which improves the performanc of parallel implementations. The computational experiments performed on a Paragon computer confirm the efficiency of the parallelization approach.
0 references
parallel computation
0 references
Davidson type methods
0 references
sparse matrices
0 references
numerical examples
0 references
spectral portrait
0 references
preconditioners
0 references
computational experiments
0 references
Paragon computer
0 references