Affiliation:
1. Faculty of Mathematics and Physics, Charles University, Prague 18675, Czech Republic
Abstract
With exascale-level computation on the horizon, the art of predicting the cost of computations has acquired a renewed focus. This task is especially challenging in the case of iterative methods, for which convergence behaviour often cannot be determined with certainty
a priori
(unless we are satisfied with potentially outrageous overestimates) and which typically suffer from performance bottlenecks at scale due to synchronization cost. Moreover, the amplification of rounding errors can substantially affect the practical performance, in particular for methods with short recurrences. In this article, we focus on what we consider to be key points which are crucial to understanding the cost of iteratively solving linear algebraic systems. This naturally leads us to questions on the place of numerical analysis in relation to mathematics, computer science and sciences, in general.
This article is part of a discussion meeting issue ‘Numerical algorithms for high-performance computational science’.
Funder
Grant Agency of the Czech Republic
Subject
General Physics and Astronomy,General Engineering,General Mathematics
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Full operator preconditioning and the accuracy of solving linear systems;IMA Journal of Numerical Analysis;2024-01-24
2. GMRES algorithms over 35 years;Applied Mathematics and Computation;2023-05
3. Towards Verified Rounding Error Analysis for Stationary Iterative Methods;2022 IEEE/ACM Sixth International Workshop on Software Correctness for HPC Applications (Correctness);2022-11
4. Assesment of soft error sensitivity of power flow analysis;Gazi Üniversitesi Mühendislik-Mimarlık Fakültesi Dergisi;2022-02-27
5. On time‐parallel preconditioning for the state formulation of incremental weak constraint 4D‐Var;Quarterly Journal of the Royal Meteorological Society;2021-08-17