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
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1515/amcs-2015-0055 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2401104724 / rank | |||
Normal rank | |||
Revision as of 00:28, 20 March 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
