The non-symmetric \(s\)-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR (Q327002): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SLEPc / rank | |||
Normal rank | |||
Revision as of 17:11, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The non-symmetric \(s\)-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR |
scientific article |
Statements
The non-symmetric \(s\)-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR (English)
0 references
13 October 2016
0 references
synchronization-reducing
0 references
\(s\)-step Lanczos
0 references
\(s\)-step bicg
0 references
\(s\)-step QMR
0 references
efficient recurrences
0 references
