Operator shifting for noisy elliptic systems

In the computational sciences, one must often estimate model parameters from data subject to noise and uncertainty, leading to inaccurate results. In order to improve the accuracy of models with noisy parameters, we consider the problem of reducing error in an elliptic linear system with the operato...

Full description

Saved in:
Bibliographic Details
Published inResearch in the mathematical sciences Vol. 10; no. 4
Main Authors Etter, Philip A., Ying, Lexing
Format Journal Article
LanguageEnglish
Published Cham Springer International Publishing 01.12.2023
Springer Nature B.V
Subjects
Online AccessGet full text
ISSN2522-0144
2197-9847
DOI10.1007/s40687-023-00414-x

Cover

Loading…
More Information
Summary:In the computational sciences, one must often estimate model parameters from data subject to noise and uncertainty, leading to inaccurate results. In order to improve the accuracy of models with noisy parameters, we consider the problem of reducing error in an elliptic linear system with the operator corrupted by noise. We assume the noise preserves positive definiteness, but otherwise, we make no additional assumptions about the structure of the noise. Under these assumptions, we propose the operator shifting framework, a collection of easy-to-implement algorithms that augment a noisy inverse operator by subtracting an additional shift term. In a similar fashion to the James–Stein estimator, this has the effect of drawing the noisy inverse operator closer to the ground truth by reducing both bias and variance. We develop bootstrap Monte Carlo algorithms to estimate the required shift magnitude for optimal error reduction in the noisy system. To improve the tractability of these algorithms, we propose several approximate polynomial expansions for the operator inverse and prove desirable convergence and monotonicity properties for these expansions. We also prove theorems that quantify the error reduction obtained by operator shifting. In addition to theoretical results, we provide a set of numerical experiments on four different graph and grid Laplacian systems that all demonstrate the effectiveness of our method.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2522-0144
2197-9847
DOI:10.1007/s40687-023-00414-x