Efficient Rigorous Numerics for Higher-Dimensional PDEs via One-Dimensional Estimates

  title={Efficient Rigorous Numerics for Higher-Dimensional PDEs via One-Dimensional Estimates},
  author={M. Gameiro and J. Lessard},
  journal={SIAM J. Numer. Anal.},
We present an efficient rigorous computational method which is an extension of the work Analytic Estimates and Rigorous Continuation for Equilibria of Higher-Dimensional PDEs (M. Gameiro and J.-P. Lessard, J. Differential Equations, 249 (2010), pp. 2237--2268). The idea is to generate sharp one-dimensional estimates using interval arithmetic which are then used to produce high-dimensional estimates. These estimates are used to construct the radii polynomials which provide an efficient way of… Expand
Automatic differentiation for Fourier series and the radii polynomial approach
Abstract In this work we develop a computer-assisted technique for proving existence of periodic solutions of nonlinear differential equations with non-polynomial nonlinearities. We exploit ideasExpand
Rigorous numerics for analytic solutions of differential equations: the radii polynomial approach
This work derives the radii polynomials for some specific application problems, and gives a number of computer assisted proofs in the analytic framework on studying periodic solutions in Cartesian products of infinite sequence spaces. Expand
Introduction to Rigorous Numerics in Dynamics: general functional analytic setup and an example that forces chaos
In this paper some basic concepts of rigorous computing in a dynamical systems context are outlined. We often simulate dynamics on a computer, or calculate a numerical solution to a partialExpand
Fourier-Taylor Parameterization of Unstable Manifolds for Parabolic Partial Differential Equations: Formalization, Implementation, and Rigorous Validation
In this paper we study high order expansions of chart maps for local finite dimensional unstable manifolds of hyperbolic equilibrium solutions of scalar parabolic partial differential equations. OurExpand
Partial differential equations and dynamical systems applied to problems coming from physics and biology
This thesis falls within the broad framework of partial differential equations and dynamical systems, and focuses more specifically on two independent topics. The first one is the study of theExpand
A Framework for the Numerical Computation and A Posteriori Verification of Invariant Objects of Evolution Equations
A theoretical framework for computer-assisted proofs of the existence of invariant objects in semilinear PDEs, including equilibrium points, traveling waves, periodic orbits and invariant manifolds attached to fixed points or periodic orbits is developed. Expand
Computation of maximal local (un)stable manifold patches by the parameterization method
In this work we develop some automatic procedures for computing high order polynomial expansions of local (un)stable manifolds for equilibria of differential equations. Our method incorporatesExpand
Rigorous numerics for nonlinear operators with tridiagonal dominant linear part
We present a method designed for computing solutions of infinite dimensional non linear operators $f(x) = 0$ with a tridiagonal dominant linear part. We recast the operator equation into anExpand
Computation of Smooth Manifolds Via Rigorous Multi-parameter Continuation in Infinite Dimensions
A constructive rigorous numerical method to compute smooth manifolds implicitly defined by infinite-dimensional nonlinear operators using the radii polynomial approach to verify the hypotheses of the uniform contraction principle over a simplex. Expand
Computer Assisted Fourier Analysis in Sequence Spaces of Varying Regularity
This work treats a functional analytic framework for computer assisted Fourier analysis which can be used to obtain mathematically rigorous error bounds on numerical approximations of solutions ofExpand


Analytic estimates and rigorous continuation for equilibria of higher-dimensional PDEs
Abstract In this paper we extend the ideas of the so-called validated continuation technique to the context of rigorously proving the existence of equilibria for partial differential equationsExpand
Validated Continuation for Equilibria of PDEs
A new technique is introduced that combines the information obtained from the predictor-corrector steps with ideas from rigorous computations and verifies that the numerically produced equilibrium for the finite-dimensional system can be used to explicitly define a set which contains a unique equilibrium forThe infinite-dimensional partial differential equation. Expand
Rigorous computation of smooth branches of equilibria for the three dimensional Cahn–Hilliard equation
A new general method to compute rigorously global smooth branches of equilibria of higher-dimensional partial differential equations for large (continuous) parameter ranges and about local uniqueness of the solutions on the curve is proposed. Expand
Validated continuation over large parameter ranges for equilibria of PDEs
The numerical technique is extended to include a parameter that leads to better bounds on the errors associated with the Galerkin truncation, and this method is tested on the Swift-Hohenberg and Allen-Cahn equations on one-dimensional domains. Expand
Sparse grids
We present a survey of the fundamentals and the applications of sparse grids, with a focus on the solution of partial differential equations (PDEs). The sparse grid approach, introduced in ZengerExpand
Adaptive wavelet algorithms for elliptic PDE's on product domains
Applying piecewise smooth wavelets, this work verified the compressibility of dimension independent approximation rates for general, non-separable elliptic elliptic PDEs in tensor domains. Expand
We consider the numerical solution of diffusion problems in (0,T ) x Ω for and for T > 0 in dimension d d ≥ 1. We use a wavelet based sparse grid space discretization with mesh-width h and order p dExpand
A Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
This work demonstrates algebraic convergence with respect to the total number of collocation points and quantifies the effect of the dimension of the problem (number of input random variables) in the final estimates, indicating for which problems the sparse grid stochastic collocation method is more efficient than Monte Carlo. Expand
Rigorous Numerics for the Cahn-Hilliard Equation on the Unit Square
While the structure of the set of stationary solutions of the Cahn-Hilliard equation on one-dimensional domains is completely understood, only partial results are available for two-dimensional baseExpand
Optimized Tensor-Product Approximation Spaces
Abstract. This paper is concerned with the construction of optimized grids and approximation spaces for elliptic differential and integral equations. The main result is the analysis of theExpand