Software for simplified Lanczos and QMR algorithms (Q1917424): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: QMRPACK / rank | |||
Normal rank |
Revision as of 16:14, 29 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Software for simplified Lanczos and QMR algorithms |
scientific article |
Statements
Software for simplified Lanczos and QMR algorithms (English)
0 references
5 January 1997
0 references
The paper describes Fortran-77 implementations of some simplified versions of the three-term and coupled two-term Lanczos algorithm and the associated quasi-minimal residual (QMR) iteration algorithms for general \(J\)-symmetric and \(J\)-Hermitian matrices. These implementations represent counterparts to the algorithms already contained in the authors software package QMRPACK. Section 2 briefly reviews the Lanczos process and the QMR method. In Section 3, the general concept of simplified Lanczos algorithms is discussed, and a few examples are given. In Section 4, the authors describe implementation issues for the simplified algorithms. Section 5 considers one of the algorithms in more detail. In Section 6, a list of the implemented simplified algorithms is given. Section 7 describes an example driver for two of the algorithms, and in Section 8, results of numerical experiments are reported. In Section 9, the authors make some concluding remarks.
0 references
quasi-minimal residual iteration
0 references
eigenvalue computation
0 references
\(J\)-symmetric matrices
0 references
Lanczos algorithm
0 references
\(J\)-Hermitian matrices
0 references
software package QMRPACK
0 references
QMR method
0 references
numerical experiments
0 references