Full operator preconditioning and the accuracy of solving linear systems

05/17/2021
by   Stephan Mohr, et al.
0

Unless special conditions apply, the attempt to solve ill-conditioned systems of linear equations with standard numerical methods leads to uncontrollably high numerical error. Often, such systems arise from the discretization of operator equations with a large number of discrete variables. In this paper we show that the accuracy can be improved significantly if the equation is transformed before discretization, a process we call full operator preconditioning (FOP). It bears many similarities with traditional preconditioning for iterative methods but, crucially, transformations are applied at the operator level. We show that while condition-number improvements from traditional preconditioning generally do not improve the accuracy of the solution, FOP can. A number of topics in numerical analysis can be interpreted as implicitly employing FOP; we highlight (i) Chebyshev interpolation in polynomial approximation, and (ii) Olver-Townsend's spectral method, both of which produce solutions of dramatically improved accuracy over a naive problem formulation. In addition, we propose a FOP preconditioner based on integration for the solution of fourth-order differential equations with the finite-element method, showing the resulting linear system is well-conditioned regardless of the discretization size, and demonstrate its error-reduction capabilities on several examples. This work shows that FOP can improve accuracy beyond the standard limit for both direct and iterative methods.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/20/2023

Preconditioning for time-harmonic Maxwell's equations using the Laguerre transform

A method of numerically solving the Maxwell equations is considered for ...
research
09/02/2021

Matrix-oriented FEM formulation for stationary and time-dependent PDEs on x-normal domains

When numerical solution of elliptic and parabolic partial differential e...
research
01/02/2021

Fast parallel solution of fully implicit Runge-Kutta and discontinuous Galerkin in time for numerical PDEs, Part I: the linear setting

Fully implicit Runge-Kutta (IRK) methods have many desirable properties ...
research
12/08/2022

Physics-guided Data Augmentation for Learning the Solution Operator of Linear Differential Equations

Neural networks, especially the recent proposed neural operator models, ...
research
04/10/2018

A Fast Hierarchically Preconditioned Eigensolver Based On Multiresolution Matrix Decomposition

In this paper we propose a new iterative method to hierarchically comput...
research
10/31/2019

On the iterative solution of systems of the form A^T A x=A^Tb+c

Given a full column rank matrix A ∈R^m× n (m≥ n), we consider a special ...
research
08/03/2021

A well-conditioned direct PinT algorithm for first- and second-order evolutionary equations

In this paper, we propose a direct parallel-in-time (PinT) algorithm for...

Please sign up or login with your details

Forgot password? Click here to reset