{"title":"Analysis of continuous data assimilation with large (or even infinite) nudging parameters","authors":"Amanda E. Diegel , Xuejian Li , Leo G. Rebholz","doi":"10.1016/j.cam.2024.116221","DOIUrl":null,"url":null,"abstract":"<div><p>This paper considers continuous data assimilation (CDA) in partial differential equation (PDE) discretizations where nudging parameters can be taken arbitrarily large. We prove that solutions are long-time optimally accurate for such parameters for the heat and Navier–Stokes equations (using implicit time stepping methods), with error bounds that do not grow as the nudging parameter gets large. Existing theoretical results either prove optimal accuracy but with the error scaled by the nudging parameter, or suboptimal accuracy that is independent of it. The key idea to the improved analysis is to decompose the error based on a weighted inner product that incorporates the (symmetric by construction) nudging term, and prove that the projection error from this weighted inner product is optimal and independent of the nudging parameter. We apply the idea to BDF2-finite element discretizations of the heat equation and Navier–Stokes equations to show that with CDA, they will admit optimal long-time accurate solutions independent of the nudging parameter, for nudging parameters large enough. Several numerical tests are given for the heat equation, fluid transport equation, Navier–Stokes, and Cahn–Hilliard that illustrate the theory.</p></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"456 ","pages":"Article 116221"},"PeriodicalIF":2.6000,"publicationDate":"2024-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational and Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0377042724004709","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
This paper considers continuous data assimilation (CDA) in partial differential equation (PDE) discretizations where nudging parameters can be taken arbitrarily large. We prove that solutions are long-time optimally accurate for such parameters for the heat and Navier–Stokes equations (using implicit time stepping methods), with error bounds that do not grow as the nudging parameter gets large. Existing theoretical results either prove optimal accuracy but with the error scaled by the nudging parameter, or suboptimal accuracy that is independent of it. The key idea to the improved analysis is to decompose the error based on a weighted inner product that incorporates the (symmetric by construction) nudging term, and prove that the projection error from this weighted inner product is optimal and independent of the nudging parameter. We apply the idea to BDF2-finite element discretizations of the heat equation and Navier–Stokes equations to show that with CDA, they will admit optimal long-time accurate solutions independent of the nudging parameter, for nudging parameters large enough. Several numerical tests are given for the heat equation, fluid transport equation, Navier–Stokes, and Cahn–Hilliard that illustrate the theory.
期刊介绍:
The Journal of Computational and Applied Mathematics publishes original papers of high scientific value in all areas of computational and applied mathematics. The main interest of the Journal is in papers that describe and analyze new computational techniques for solving scientific or engineering problems. Also the improved analysis, including the effectiveness and applicability, of existing methods and algorithms is of importance. The computational efficiency (e.g. the convergence, stability, accuracy, ...) should be proved and illustrated by nontrivial numerical examples. Papers describing only variants of existing methods, without adding significant new computational properties are not of interest.
The audience consists of: applied mathematicians, numerical analysts, computational scientists and engineers.