Approximation of high-dimensional parametric PDEs
From MaRDI portal
PDEs with randomness, stochastic partial differential equations (35R60) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46) Stochastic partial differential equations (aspects of stochastic analysis) (60H15) Numerical solutions to stochastic differential and integral equations (65C30)
Abstract: Parametrized families of PDEs arise in various contexts such as inverse problems, control and optimization, risk assessment, and uncertainty quantification. In most of these applications, the number of parameters is large or perhaps even infinite. Thus, the development of numerical methods for these parametric problems is faced with the possible curse of dimensionality. This article is directed at (i) identifying and understanding which properties of parametric equations allow one to avoid this curse and (ii) developing and analyzing effective numerical methodd which fully exploit these properties and, in turn, are immune to the growth in dimensionality. The first part of this article studies the smoothness and approximability of the solution map, that is, the map where is the parameter value and is the corresponding solution to the PDE. It is shown that for many relevant parametric PDEs, the parametric smoothness of this map is typically holomorphic and also highly anisotropic in that the relevant parameters are of widely varying importance in describing the solution. These two properties are then exploited to establish convergence rates of -term approximations to the solution map for which each term is separable in the parametric and physical variables. These results reveal that, at least on a theoretical level, the solution map can be well approximated by discretizations of moderate complexity, thereby showing how the curse of dimensionality is broken. This theoretical analysis is carried out through concepts of approximation theory such as best -term approximation, sparsity, and -widths. These notions determine a priori the best possible performance of numerical methods and thus serve as a benchmark for concrete algorithms. The second part of this article turns to the development of numerical algorithms based on the theoretically established sparse separable approximations. The numerical methods studied fall into two general categories. The first uses polynomial expansions in terms of the parameters to approximate the solution map. The second one searches for suitable low dimensional spaces for simultaneously approximating all members of the parametric family. The numerical implementation of these approaches is carried out through adaptive and greedy algorithms. An a priori analysis of the performance of these algorithms establishes how well they meet the theoretical benchmarks.
Recommendations
- Breaking the curse of dimensionality in sparse polynomial approximation of parametric PDEs
- Tensor-structured Galerkin approximation of parametric and stochastic elliptic PDEs
- Sparse adaptive Taylor approximation algorithms for parametric and stochastic elliptic PDEs
- Analytic regularity and polynomial approximation of parametric and stochastic elliptic PDE's
- Sparse finite element approximation of high-dimensional transport-dominated diffusion problems
Cited in
(only showing first 100 items - show all)- Simulation-based classification; a model-order-reduction approach for structural health monitoring
- Reduced modeling of unknown trajectories
- Sensor placement in nuclear reactors based on the generalized empirical interpolation method
- Data assimilation and sampling in Banach spaces
- Numerical solution of the homogeneous Neumann boundary value problem on domains with a thin layer of random thickness
- Greedy optimal control for elliptic problems and its application to turnpike problems
- Higher-order principal component analysis for the approximation of tensors in tree-based low-rank formats
- Analyticity, regularity, and generalized polynomial chaos approximation of stochastic, parametric parabolic two-scale partial differential equations
- Fast reconstruction of 3D blood flows from Doppler ultrasound images and reduced models
- Convergence of adaptive stochastic collocation with finite elements
- Numerical solution of the parametric diffusion equation by deep neural networks
- Model reduction and neural networks for parametric PDEs
- Derivative-informed projected neural networks for high-dimensional parametric maps governed by PDEs
- Low-rank dynamic mode decomposition: an exact and tractable solution
- The uniform sparse FFT with application to PDEs with random coefficients
- The Vlasov-Fokker-Planck equation with high dimensional parametric forcing term
- A theoretical analysis of deep neural networks and parametric PDEs
- Model reduction for fractional elliptic problems using Kato's formula
- \(L^1\) transport energy
- A hyper-reduced MAC scheme for the parametric Stokes and Navier-Stokes equations
- Optimal sampling and Christoffel functions on general domains
- IGA-based multi-index stochastic collocation for random PDEs on arbitrary domains
- A multilevel sparse kernel-based stochastic collocation finite element method for elliptic problems with random coefficients
- Reduced basis approximations of the solutions to spectral fractional diffusion problems
- Regularity and sparse approximation of the recursive first moment equations for the lognormal Darcy problem
- A bi-fidelity method for the multiscale Boltzmann equation with random parameters
- A note on tools for prediction under uncertainty and identifiability of SIR-like dynamical systems for epidemiology
- Greedy algorithm for parameter dependent operator Lyapunov equations
- Variational Monte Carlo -- bridging concepts of machine learning and high-dimensional partial differential equations
- New conditions on stable recovery of weighted sparse signals via weighted l₁ minimization
- Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension
- Stable splittings of Hilbert spaces of functions of infinitely many variables
- Polynomial approximation of anisotropic analytic functions of several variables
- A convergent iterated quasi-interpolation for periodic domain and its applications to surface PDEs
- Budget-limited distribution learning in multifidelity problems
- Sparse polynomial approximations for affine parametric saddle point problems
- A metalearning approach for physics-informed neural networks (PINNs): application to parameterized PDEs
- On the cardinality of lower sets and universal discretization
- Parameter Estimation for High-Dimensional PDE Models Using a Reduced Approach
- Reduced basis approximation and a posteriori error estimates for parametrized elliptic eigenvalue problems
- Kolmogorov widths and low-rank approximations of parametric elliptic PDEs
- Reduced Basis Greedy Selection Using Random Training Sets
- The Random Feature Model for Input-Output Maps between Banach Spaces
- Optimal reduced model algorithms for data-based state estimation
- Greedy controllability of finite dimensional linear systems
- Lipschitz dependence of the coefficients on the resolvent and greedy approximation for scalar elliptic problems
- The cardiovascular system: mathematical modelling, numerical algorithms and clinical applications
- Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
- Shape holomorphy of the stationary Navier-Stokes equations
- Uncertainty quantification for low-frequency, time-harmonic Maxwell equations with stochastic conductivity models
- Multivariate approximation in downward closed polynomial spaces
- Deep learning in high dimension: neural network expression rates for generalized polynomial chaos expansions in UQ
- Acousto-electric tomography with total variation regularization
- Convergence of Sparse Collocation for Functions of Countably Many Gaussian Random Variables (with Application to Elliptic PDEs)
- A localization strategy for data assimilation; application to state estimation and parameter estimation
- On the decay rate of the singular values of bivariate functions
- Greedy Algorithms for Optimal Measurements Selection in State Estimation Using Reduced Models
- Breaking the curse of dimensionality in sparse polynomial approximation of parametric PDEs
- Linear collective collocation approximation for parametric and stochastic elliptic PDEs
- Multilevel approximation of parametric and stochastic PDES
- Multilevel Designed Quadrature for Partial Differential Equations with Random Inputs
- Adaptive low-rank approximations for operator equations: accuracy control and computational complexity
- The gap between theory and practice in function approximation with deep neural networks
- Nonlinear methods for model reduction
- Sequential sampling for optimal weighted least squares approximations in hierarchical spaces
- An adaptive stochastic Galerkin method based on multilevel expansions of random fields: convergence and optimality
- Application of quasi-Monte Carlo methods to elliptic PDEs with random diffusion coefficients: a survey of analysis and implementation
- Complexity Analysis of stochastic gradient methods for PDE-constrained optimal Control Problems with uncertain parameters
- Modeling the cardiac electromechanical function: A mathematical journey
- State estimation with model reduction and shape variability. Application to biomedical problems
- Nonlinear reduced DNN models for state estimation
- A Registration Method for Model Order Reduction: Data Compression and Geometry Reduction
- APPROXIMATING SMOOTH, MULTIVARIATE FUNCTIONS ON IRREGULAR DOMAINS
- Stochastic Methods for Solving High-Dimensional Partial Differential Equations
- Numerical methods for the deterministic second moment equation of parabolic stochastic PDEs
- Transformed snapshot interpolation with high resolution transforms
- Robust a posteriori error estimation for parameter-dependent linear elasticity equations
- A data-driven approach for multiscale elliptic PDEs with random coefficients based on intrinsic dimension reduction
- Error localization of best \(L_1\) polynomial approximants
- Sparse-grid polynomial interpolation approximation and integration for parametric and stochastic elliptic PDEs with lognormal inputs
- Error estimate of the non-intrusive reduced basis method with finite volume schemes
- Adaptive PBDW approach to state estimation: noisy observations; user-defined update spaces
- Adaptive approximation by optimal weighted least-squares methods
- Convergence of adaptive stochastic Galerkin FEM
- Reduced Basis Methods for Fractional Laplace Equations via Extension
- Error bounds in high-order Sobolev norms for POD expansions of parameterized transient temperatures
- Data Assimilation in Reduced Modeling
- Fully discrete approximation of parametric and stochastic elliptic PDEs
- Nonlinear reduced models for state and parameter estimation
- Nonlinear approximation spaces for inverse problems
- Near-optimal approximation methods for elliptic PDEs with lognormal coefficients
- Turnpike in optimal control of PDEs, ResNets, and beyond
- Density Estimation in RKHS with Application to Korobov Spaces in High Dimensions
- A Proof that Artificial Neural Networks Overcome the Curse of Dimensionality in the Numerical Approximation of Black–Scholes Partial Differential Equations
- Adaptive Nonintrusive Reconstruction of Solutions to High-Dimensional Parametric PDEs
- Low-rank tensor methods for partial differential equations
- Nonlinear approximation in bounded orthonormal product bases
- Deep ReLU neural network approximation in Bochner spaces and applications to parametric PDEs
- A literature survey of matrix methods for data science
- Impact of physical model error on state estimation for neutronics applications
This page was built for publication: Approximation of high-dimensional parametric PDEs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5254044)
