The non-symmetric \(s\)-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR (Q327002)
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: The non-symmetric s-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR |
scientific article; zbMATH DE number 6638060
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The non-symmetric \(s\)-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR |
scientific article; zbMATH DE number 6638060 |
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
0 references
0 references
0 references
0.90035105
0 references
0.87162745
0 references
0.8659903
0 references
0.8648323
0 references
0.85174775
0 references
