Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2024 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Accuracy controlled data assimilation for parabolic problems
HTML articles powered by AMS MathViewer

by Wolfgang Dahmen, Rob Stevenson and Jan Westerdiep;
Math. Comp. 91 (2022), 557-595
DOI: https://doi.org/10.1090/mcom/3680
Published electronically: September 24, 2021

Abstract:

This paper is concerned with the recovery of (approximate) solutions to parabolic problems from incomplete and possibly inconsistent observational data, given on a time-space cylinder that is a strict subset of the computational domain under consideration. Unlike previous approaches to this and related problems our starting point is a regularized least squares formulation in a continuous infinite-dimensional setting that is based on stable variational time-space formulations of the parabolic partial differential equation. This allows us to derive a priori as well as a posteriori error bounds for the recovered states with respect to a certain reference solution. In these bounds the regularization parameter is disentangled from the underlying discretization. An important ingredient for the derivation of a posteriori bounds is the construction of suitable Fortin operators which allow us to control oscillation errors stemming from the discretization of dual norms. Moreover, the variational framework allows us to contrive preconditioners for the discrete problems whose application can be performed in linear time, and for which the condition numbers of the preconditioned systems are uniformly proportional to that of the regularized continuous problem. In particular, we provide suitable stopping criteria for the iterative solvers based on the a posteriori error bounds. The presented numerical experiments quantify the theoretical findings and demonstrate the performance of the numerical scheme in relation with the underlying discretization and regularization.
References
Similar Articles
Bibliographic Information
  • Wolfgang Dahmen
  • Affiliation: Department of Mathematics, University of South Carolina, Columbia, South Carolina 29208
  • MR Author ID: 54100
  • Email: wolfgang.anton.dahmen@googlemail.com
  • Rob Stevenson
  • Affiliation: Korteweg-de Vries (KdV) Institute for Mathematics, University of Amsterdam, P.O. Box 94248, 1090 GE Amsterdam, The Netherlands
  • MR Author ID: 310898
  • ORCID: 0000-0001-7623-3060
  • Email: r.p.stevenson@uva.nl
  • Jan Westerdiep
  • Affiliation: Korteweg-de Vries (KdV) Institute for Mathematics, University of Amsterdam, P.O. Box 94248, 1090 GE Amsterdam, The Netherlands
  • MR Author ID: 1356589
  • ORCID: 0000-0002-7028-5676
  • Email: j.h.westerdiep@uva.nl
  • Received by editor(s): November 16, 2020
  • Received by editor(s) in revised form: May 12, 2021, and June 21, 2021
  • Published electronically: September 24, 2021
  • Additional Notes: This research was supported in part by NSF Grants DMS ID 1720297 and DMS ID 2012469, by the SmartState and Williams-Hedberg Foundation, and by the Netherlands Organization for Scientific Research (NWO) under contract. no. 613.001.652
  • © Copyright 2021 American Mathematical Society
  • Journal: Math. Comp. 91 (2022), 557-595
  • MSC (2020): Primary 35B35, 35B45, 35K20, 35R25, 65F08, 65J20, 65M12, 65M30, 65M60
  • DOI: https://doi.org/10.1090/mcom/3680
  • MathSciNet review: 4379969