Anderson acceleration with approximate calculations: applications to scientific computing

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Pasini, Massimiliano Lupo, Laiu, M. Paul
Format: Preprint
Published: 2022
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866929328797777920
author Pasini, Massimiliano Lupo
Laiu, M. Paul
author_facet Pasini, Massimiliano Lupo
Laiu, M. Paul
contents We provide rigorous theoretical bounds for Anderson acceleration (AA) that allow for approximate calculations when applied to solve linear problems. We show that, when the approximate calculations satisfy the provided error bounds, the convergence of AA is maintained while the computational time could be reduced. We also provide computable heuristic quantities, guided by the theoretical error bounds, which can be used to automate the tuning of accuracy while performing approximate calculations. For linear problems, the use of heuristics to monitor the error introduced by approximate calculations, combined with the check on monotonicity of the residual, ensures the convergence of the numerical scheme within a prescribed residual tolerance. Motivated by the theoretical studies, we propose a reduced variant of AA, which consists in projecting the least-squares used to compute the Anderson mixing onto a subspace of reduced dimension. The dimensionality of this subspace adapts dynamically at each iteration as prescribed by the computable heuristic quantities. We numerically show and assess the performance of AA with approximate calculations on: (i) linear deterministic fixed-point iterations arising from the Richardson's scheme to solve linear systems with open-source benchmark matrices with various preconditioners and (ii) non-linear deterministic fixed-point iterations arising from non-linear time-dependent Boltzmann equations.
format Preprint
id arxiv_https___arxiv_org_abs_2206_03915
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle Anderson acceleration with approximate calculations: applications to scientific computing
Pasini, Massimiliano Lupo
Laiu, M. Paul
Numerical Analysis
Instrumentation and Methods for Astrophysics
Mathematical Physics
65F10, 65F50, 65G30, 65G50, 65N12, 65N15, 65Y20, 65Z05, 68T01, 68W20, 68W40
G.1.3; G.1.10
We provide rigorous theoretical bounds for Anderson acceleration (AA) that allow for approximate calculations when applied to solve linear problems. We show that, when the approximate calculations satisfy the provided error bounds, the convergence of AA is maintained while the computational time could be reduced. We also provide computable heuristic quantities, guided by the theoretical error bounds, which can be used to automate the tuning of accuracy while performing approximate calculations. For linear problems, the use of heuristics to monitor the error introduced by approximate calculations, combined with the check on monotonicity of the residual, ensures the convergence of the numerical scheme within a prescribed residual tolerance. Motivated by the theoretical studies, we propose a reduced variant of AA, which consists in projecting the least-squares used to compute the Anderson mixing onto a subspace of reduced dimension. The dimensionality of this subspace adapts dynamically at each iteration as prescribed by the computable heuristic quantities. We numerically show and assess the performance of AA with approximate calculations on: (i) linear deterministic fixed-point iterations arising from the Richardson's scheme to solve linear systems with open-source benchmark matrices with various preconditioners and (ii) non-linear deterministic fixed-point iterations arising from non-linear time-dependent Boltzmann equations.
title Anderson acceleration with approximate calculations: applications to scientific computing
topic Numerical Analysis
Instrumentation and Methods for Astrophysics
Mathematical Physics
65F10, 65F50, 65G30, 65G50, 65N12, 65N15, 65Y20, 65Z05, 68T01, 68W20, 68W40
G.1.3; G.1.10
url https://arxiv.org/abs/2206.03915