Error estimate of a bi-fidelity method for kinetic equations with random parameters and multiple scales

Irene M. Gamba; Shi Jin; Liu Liu

Home/Archive/arXiv

arXiv · 1910.09080

Error estimate of a bi-fidelity method for kinetic equations with random parameters and multiple scales

Irene M. Gamba·Shi Jin·Liu Liu

View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we conduct uniform error estimates of the bi-fidelity method for multi-scale kinetic equations. We take the Boltzmann and the linear transport equations as important examples. The main analytic tool is the hypocoercivity analysis for kinetic equations, considering solutions in a perturbative setting close to the global equilibrium. This allows us to obtain the error estimates in both kinetic and hydrodynamic regimes.

Explore related subjects

math.NA cs.NA math-ph math.MP

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Irene M. Gamba, Shi Jin, Liu Liu. 2021-03-26. Error estimate of a bi-fidelity method for kinetic equations with random parameters and multiple scales. https://arxiv.org/abs/1910.09080

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

$hp$-a posteriori error estimates for hybrid high-order methods applied to biharmonic problems

We derive a residual-based $hp$-a posteriori error estimator for hybrid high-order (HHO) methods on simplicial meshes applied to the biharmonic problem posed on two- and three-dimensional polytopal Lipschitz domains. The a posteriori error estimator hinges on an error decomposition into conforming and nonconforming components. To bound the nonconforming error, we use a $C^1$-partition of unity constructed via Alfeld splittings, combined with local Helmholtz decompositions on vertex stars where the key contribution is to show that the stability constant only depends on the mesh shape-regularity. For the conforming error, we design two residual-based estimators, each associated with a specific interpolation operator. In the first setting, the upper bound on the conforming error involves only the stabilization term and the data oscillation, but hinges on an assumption that we verify numerically. In the second setting, the bound additionally incorporates bulk residuals, normal flux jumps, and tangential jumps. Numerical experiments confirm the theoretical findings on the error upper bound and also illustrate numerically that the proposed estimators lead to moderate effectivity indices.

math.NA↗

arXiv2026

Guaranteed inf-sup bounds and existence verification for semilinear elliptic problems via nonconforming finite elements

A Newton-Kantorovich-type argument enables the a posteriori existence verification of a locally unique regular root near a computed approximation. This framework allows for non-selfadjoint problems and extends the existing verification theory to nonconforming discretisations. A key ingredient is a guaranteed lower bound for the continuous inf-sup constant of the linearisation obtained with a novel approximation error bound for nonconforming schemes. All quantities are obtained from a postprocessing on the same discretisation within the adaptive loop. The theory is applied to a fourth-order formulation of the stationary 2D Navier-Stokes equations and illustrated by numerical experiments.

math.NA↗

arXiv2026

SAV Schemes with Decomposition-Induced Pullback Corrections for Gradient Flows

The scalar auxiliary variable (SAV) method constructs linear, unconditionally energy-stable time discretizations of gradient flows. Eliminating the auxiliary variable in a first-order SAV step shows that the state equation is a semi-implicit update augmented by a rank-one positive semidefinite correction from the previous nonlinear force. The multiple-SAV (MSAV) method produces this correction componentwise, with rank up to the number of energy components. This separates two mechanisms usually coupled in MSAV: the number of scalar variables tracking the nonlinear energy and the rank of the correction. We introduce a pullback-corrected SAV (PB-SAV) family that keeps a single scalar auxiliary variable but replaces the rank-one SAV correction by the pullback correction induced by an admissible component decomposition. The correction remains positive semidefinite, has rank at most the number of components, and may change from step to step without changing the scalar auxiliary variable. We prove modified-energy dissipation laws for fixed and step-dependent decompositions, establish first-order convergence after a fixed spatial discretization under standard smoothness and positivity assumptions, derive a refinement identity whose gain is an explicit weighted variance, and give a Sherman--Morrison--Woodbury implementation of the low-rank perturbation of the standard semi-implicit solve. We also show, in finite dimensions, that the pullback correction is the Gauss--Newton matrix of a least-squares representation of the nonlinear energy. Numerical experiments on finite-dimensional gradient flows, Allen--Cahn dynamics, a finite-rank nonlocal gradient flow, and a linear nonlocal Cahn--Hilliard model show regimes in which PB-SAV and SAV differ only in the first-order error constant and regimes in which PB-SAV reduces the trajectory error by a large factor.

math.NA↗