Analysis of a CDA-accelerated splitting iteration for incompressible flow problems

Abstract We propose, analyze, and test an efficient splitting iteration for solving the incompressible, steady Navier–Stokes equations in the setting where partial solution data is known. The (possibly noisy) solution data is incorporated into a Picard-type solver via continuous data assimilation (CDA). Efficiency is gained through an algebraic splitting of Yosida-type that produces easier linear solves, and accuracy/consistency is shown to be maintained through the use of an incremental pressure and grad-div stabilization. We prove that CDA scales the Lipschitz constant of the associated fixed point operator by H 1/2 , where H is the characteristic spacing of the known solution data. This implies that CDA accelerates an already converging solver (and the more data, the more acceleration) and enables convergence of solvers in parameter regimes where the usual solver would fail (and the more data, the larger the parameter regime where convergence is achieved). Numerical tests illustrate the theory on several benchmark test problems.

Authors

Institutions

Publication Details

Journal
Journal of Numerical Mathematics
Published
2026-07-22
DOI
https://doi.org/10.1515/jnma-2025-0129
Primary Topic
Advanced Numerical Methods in Computational Mathematics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Analysis of a CDA-accelerated splitting iteration for incompressible flow problems

Leo G. Rebholz, Duygu Vargun, Victoria L. Fisher
Journal of Numerical Mathematics
Advanced Numerical Methods in Computational Mathematics
article

Analysis of a CDA-accelerated splitting iteration for incompressible flow problems

Leo G. Rebholz, Duygu Vargun, Victoria L. Fisher
article en

Abstract

Abstract We propose, analyze, and test an efficient splitting iteration for solving the incompressible, steady Navier–Stokes equations in the setting where partial solution data is known. The (possibly noisy) solution data is incorporated into a Picard-type solver via continuous data assimilation (CDA). Efficiency is gained through an algebraic splitting of Yosida-type that produces easier linear solves, and accuracy/consistency is shown to be maintained through the use of an incremental pressure and grad-div stabilization. We prove that CDA scales the Lipschitz constant of the associated fixed point operator by H 1/2 , where H is the characteristic spacing of the known solution data. This implies that CDA accelerates an already converging solver (and the more data, the more acceleration) and enables convergence of solvers in parameter regimes where the usual solver would fail (and the more data, the larger the parameter regime where convergence is achieved). Numerical tests illustrate the theory on several benchmark test problems.

Journal of Numerical Mathematics
Oak Ridge National Laboratory (US), Clemson University (US)
Openalex Percentile: Top 10%
Advanced Numerical Methods in Computational Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.