The open archive for STFC research publications

ePubs will be undergoing scheduled maintenance on 19/06/2024 between 10:00-12:00 and the service will be unavailable during this time.

Full Record Details

DOI 10.5286/raltr.2011010
Persistent URL http://purl.org/net/epubs/work/24987033
Record Status Checked
Record Id 24987033
Title Chebyshev acceleration of iterative refinement
Abstract We analyse how variants of the Chebyshev algorithm can be used to accelerate the iterative refinement procedure without loss of numerical stability and at a computational cost at each iteration that is only marginally greater than that of iterative refinement. An error analysis of the procedure is presented and numerical tests on selected sparse test problems are used to corroborate the theory and illustrate the potential savings offered by Chebyshev acceleration.
Organisation CSE , CSE-NAG , STFC
Funding Information
Related Research Object(s): 12278633
Licence Information:
Language English (EN)
Type Details URI(s) Local file(s) Year
Report RAL Technical Reports RAL-TR-2011-010. 2011. RAL-TR-2011-010.pdf 2011