English
Related papers

Related papers: A formal proof of the Lax equivalence theorem for …

200 papers

We show that if a numerical method is posed as a sequence of operators acting on data and depending on a parameter, typically a measure of the size of discretization, then consistency, convergence and stability can be related by a…

Numerical Analysis · Mathematics 2007-09-27 John Jossey , Anil N. Hirani

The authors show that the round-off error can break the consistency which is the premise of using the difference equation to replace the original differential equations. We therefore proposed a theoretical approach to investigate this…

Numerical Analysis · Mathematics 2010-06-23 Wang Pengfei , Li Jianping

To obtain the highest confidence on the correction of numerical simulation programs implementing the finite element method, one has to formalize the mathematical notions and results that allow to establish the soundness of the method. The…

Logic in Computer Science · Computer Science 2016-10-05 François Clément , Vincent Martin

We study a general convergence theory for the numerical solutions of compressible viscous and electrically conducting fluids with a focus on numerical schemes that preserve the divergence free property of magnetic field exactly. Our…

Numerical Analysis · Mathematics 2021-07-06 Yang Li , Bangwei She

Typically when a semi-discrete approximation to a partial differential equation (PDE) is constructed a discretization of the spatial operator with a truncation error $\tau$ is derived. This discrete operator should be semi-bounded for the…

Numerical Analysis · Mathematics 2017-11-22 Adi Ditkowski

The Lax equivalence theorem guarantees convergence of stable and consistent discretizations for linear hyperbolic partial differential equations (PDEs). For nonlinear problems, however, stability and consistency alone do not generally…

Numerical Analysis · Mathematics 2026-03-20 Zelalem Arega Worku , David C. Del Rey Fernández , David W. Zingg

We study the convergence of the new family of mimetic finite difference schemes for linear diffusion problems recently proposed in [38]. In contrast to the conventional approach, the diffusion coefficient enters both the primary mimetic…

Numerical Analysis · Mathematics 2016-12-07 G. Manzini , K. Lipnikov , J. D. Moulton , M. Shashkov

Solutions to differential equations, which are used to model physical systems, are computed numerically by solving a set of discretized equations. This set of discretized equations is reduced to a large linear system, whose solution is…

Numerical Analysis · Mathematics 2024-03-18 Mohit Tekriwal , Joshua Miller , Jean-Baptiste Jeannin

Lattice Boltzmann schemes rely on the enlargement of the size of the target problem in order to solve PDEs in a highly parallelizable and efficient kinetic-like fashion, split into a collision and a stream phase. This structure, despite the…

Numerical Analysis · Mathematics 2025-10-02 Thomas Bellotti , Benjamin Graille , Marc Massot

A quasi-second order scheme is developed to obtain approximate solutions of the shallow water equationswith bathymetry. The scheme is based on a staggered finite volume scheme for the space discretization:the scalar unknowns are located in…

Numerical Analysis · Mathematics 2021-11-19 R Herbin , J. -C Latché , Y Nasseri , N Therme

A fully discrete Lagrangian scheme for solving a family of fourth order equations numerically is presented. The discretization is based on the equation's underlying gradient flow structure w.r.t. the $L^2$-Wasserstein distance, and adapts…

Numerical Analysis · Mathematics 2015-01-23 Horst Osberger

Lattice Boltzmann schemes are efficient numerical methods to solve a broad range of problems under the form of conservation laws. However, they suffer from a chronic lack of clear theoretical foundations. In particular, the consistency…

Numerical Analysis · Mathematics 2023-05-17 Thomas Bellotti

Given an orthogonal lattice with mesh length h on a bounded convex domain, we propose to approximate the Aleksandrov solution of the Monge-Ampere equation by regularizing the data and discretizing the equation in a subdomain using the…

Numerical Analysis · Mathematics 2015-07-31 Gerard Awanou

In this work, we prove the convergence of residual distribution schemes to dissipative weak solutions of the Euler equations. We need to guarantee that the residual distribution schemes are fulfilling the underlying structure preserving…

Numerical Analysis · Mathematics 2022-12-06 Rémi Abgrall , Mária Lukácova-Medvid'ová , Philipp Öffner

We present a quantum algorithm for systems of (possibly inhomogeneous) linear ordinary differential equations with constant coefficients. The algorithm produces a quantum state that is proportional to the solution at a desired final time.…

Quantum Physics · Physics 2017-11-07 Dominic W. Berry , Andrew M. Childs , Aaron Ostrander , Guoming Wang

We study the water hammer problem in the case of a sudden closing of a valve upstream, and we consider a Lax-Wendroff finite difference scheme in order to obtain a numerical solution of this problem. In order to establish the approximation…

Numerical Analysis · Mathematics 2023-03-31 Hugo Carrillo-Lincopi , Alden Waters , Teke Xu

In this paper, we present convergence theorems for numerical solutions of the incompressible Euler equations. The first result is the Lax-Wendroff-type theorem, while the second can be formulated in the framework of the Lax equivalence…

Numerical Analysis · Mathematics 2026-04-02 Mária Lukáčová-Medviďová , Bangwei She

Popular finite difference numerical schemes for the resolution of the one-dimensional acoustic wave equation are well-known to be convergent. We present a comprehensive formalization of the simplest one and formally prove its convergence in…

Logic in Computer Science · Computer Science 2011-11-15 Sylvie Boldo , François Clément , Jean-Christophe Filliâtre , Micaela Mayero , Guillaume Melquiond , Pierre Weis

Popular finite difference numerical schemes for the resolution of the one-dimensional acoustic wave equation are well-known to be convergent. We present a comprehensive formalization of the simplest one and formally prove its convergence in…

Logic in Computer Science · Computer Science 2011-11-10 Sylvie Boldo , François Clément , Jean-Christophe Filliâtre , Micaela Mayero , Guillaume Melquiond , Pierre Weis

We study approximation of non-autonomous linear differential equations with variable delay over infinite intervals. We use piecewise constant argument to obtain a corresponding discrete difference equation. The study of numerical…

Classical Analysis and ODEs · Mathematics 2016-07-26 Daniel Sepúlveda
‹ Prev 1 2 3 10 Next ›