General framework for deriving reproducible Krylov subspace algorithms: BiCGStab case (Q6135460)
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: General framework for deriving reproducible Krylov subspace algorithms: BiCGStab case |
scientific article; zbMATH DE number 7731564
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | General framework for deriving reproducible Krylov subspace algorithms: BiCGStab case |
scientific article; zbMATH DE number 7731564 |
Statements
General framework for deriving reproducible Krylov subspace algorithms: BiCGStab case (English)
0 references
25 August 2023
0 references
reproducibility
0 references
accuracy
0 references
floating-point expansion
0 references
long accumulator
0 references
fused multiply-add
0 references
preconditioned BiCGStab
0 references
0 references
0 references
0.7321913838386536
0 references
0.7299094796180725
0 references
0.7253304123878479
0 references
0.7215607762336731
0 references
0.7121449708938599
0 references