High-dimensional adaptive sparse polynomial interpolation and applications to parametric PDEs
From MaRDI portal
Publication:404259
DOI10.1007/S10208-013-9154-ZzbMATH Open1298.65022OpenAlexW2005606401MaRDI QIDQ404259FDOQ404259
Authors: Abdellah Chkifa, Albert Cohen, Christoph Schwab 
Publication date: 4 September 2014
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10208-013-9154-z
Recommendations
- Sparse adaptive Taylor approximation algorithms for parametric and stochastic elliptic PDEs
- Breaking the curse of dimensionality in sparse polynomial approximation of parametric PDEs
- Parametric PDEs: sparse or low-rank approximations?
- An adaptive high-order piecewise polynomial based sparse grid collocation method with applications
- On the stability of polynomial interpolation using hierarchical sampling
high-dimensional problemsLebesgue constantLeja sequenceadaptive interpolation algorithmparametric partial differential equationssparse interpolation operatorsparse polynomial interpolationtensorisation
Multidimensional problems (41A63) Numerical interpolation (65D05) Boundary value problems for second-order elliptic equations (35J25) Interpolation in approximation theory (41A05) Approximation by polynomials (41A10) Spectral, collocation and related methods for boundary value problems involving PDEs (65N35)
Cites Work
- A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data
- Analytic regularity and polynomial approximation of parametric and stochastic elliptic PDE's
- Computational Aspects of Polynomial Interpolation in Several Variables
- Dimension-adaptive tensor-product quadrature
- A Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
- An Anisotropic Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
- Galerkin Finite Element Approximations of Stochastic Elliptic Partial Differential Equations
- On the Lebesgue constant of Leja sequences for the complex unit disk and of their real projection
- High dimensional polynomial interpolation on sparse grids
- \textit{A priori} convergence of the greedy algorithm for the parametrized reduced basis method
- Lagrange interpolation at real projections of Leja sequences for the unit disk
- Analysis of discrete \(L^2\) projection on polynomial spaces with random evaluations
- Title not available (Why is that?)
- Convergence rates of best \(N\)-term Galerkin approximations for a class of elliptic SPDEs
- Finite elements for elliptic problems with stochastic coefficients
- Title not available (Why is that?)
- Sparse adaptive Taylor approximation algorithms for parametric and stochastic elliptic PDEs
- An adaptive stochastic Galerkin method for random elliptic operators
- Sparse tensor discretization of elliptic SPDEs
- On the optimal polynomial approximation of stochastic PDEs by Galerkin and collocation methods
- Analytic regularity and nonlinear approximation of a class of parametric semilinear elliptic PDEs
- On the Lebesgue constant of Leja sequences for the unit disk and its applications to multivariate interpolation
- Reduced basis method for linear elasticity problems with many parameters
- The Growth of Polynomials Bounded at Equally Spaced Points
- Solvability problems of bivariate interpolation I
- Sparse tensor approximation of parametric eigenvalue problems
- Title not available (Why is that?)
- High-order Galerkin approximations for parametric second-order elliptic partial differential equations
Cited In (only showing first 100 items - show all)
- An adaptive sparse grid rational Arnoldi method for uncertainty quantification of dynamical systems in the frequency domain
- Recovery guarantees for polynomial coefficients from weakly dependent data with outliers
- Randomized least-squares with minimal oversampling and interpolation in general spaces
- Parallel domain decomposition strategies for stochastic elliptic equations. Part B: Accelerated Monte Carlo sampling with local PC expansions
- Collocation approximation by deep neural ReLU networks for parametric and stochastic PDEs with lognormal inputs
- Weighted approximate Fekete points: sampling for least-squares polynomial approximation
- On the convergence of adaptive stochastic collocation for elliptic partial differential equations with affine diffusion
- Optimal design for kernel interpolation: applications to uncertainty quantification
- Error estimates of a bi-fidelity method for a multi-phase Navier-Stokes-Vlasov-Fokker-Planck system with random inputs
- A combination technique for optimal control problems constrained by random PDEs
- Algorithm 1040: the Sparse Grids Matlab Kit -- a Matlab implementation of sparse grids for high-dimensional function approximation and uncertainty quantification
- Towards optimal sampling for learning sparse approximation in high dimensions
- Neural and spectral operator surrogates: unified construction and expression rate bounds
- Global Polynomial Level Sets for Numerical Differential Geometry of Smooth Closed Surfaces
- Multilevel domain uncertainty quantification in computational electromagnetics
- Adaptive experimental design for multi‐fidelity surrogate modeling of multi‐disciplinary systems
- Approximating the stationary Bellman equation by hierarchical tensor products
- Uncertainty quantification for low-frequency, time-harmonic Maxwell equations with stochastic conductivity models
- An hp‐adaptive multi‐element stochastic collocation method for surrogate modeling with information re‐use
- Kernel methods are competitive for operator learning
- Sparse approximation of triangular transports. I: The finite-dimensional case
- Error analysis of kernel/GP methods for nonlinear and parametric PDEs
- Uncertainty quantification analysis of bifurcations of the Allen-Cahn equation with random coefficients
- Exploiting locality in sparse polynomial approximation of parametric elliptic PDEs and application to parameterized domains
- A kernel framework for learning differential equations and their solution operators
- Non-intrusive double-greedy parametric model reduction by interpolation of frequency-domain rational surrogates
- Characterising model dynamics using sparse grid interpolation: parameter estimation of cholera
- Newton interpolation using \(\Re \)-Leja sequences
- Multivariate polynomial interpolation on lower sets
- Dynamically orthogonal tensor methods for high-dimensional nonlinear PDEs
- Analytic regularity and collocation approximation for elliptic PDEs with random domain deformations
- The numerical approximation of nonlinear functionals and functional differential equations
- Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
- Efficient numerical approximation of a non-regular Fokker-Planck equation associated with first-passage time distributions
- Sparse grids and applications -- Stuttgart 2014. Collected contributions of the 3rd workshop, SGA 2014, Stuttgart, Germany, September 1--5, 2014
- Sparse-grid polynomial interpolation approximation and integration for parametric and stochastic elliptic PDEs with lognormal inputs
- Convergence of quasi-optimal sparse-grid approximation of Hilbert-space-valued functions: Application to random elliptic PDEs
- Stochastic preconditioning of domain decomposition methods for elliptic equations with random coefficients
- Large deformation shape uncertainty quantification in acoustic scattering
- Multivariate approximation in downward closed polynomial spaces
- Sparse polynomial approximations for affine parametric saddle point problems
- Electromagnetic wave scattering by random surfaces: shape holomorphy
- A hybrid collocation-perturbation approach for PDEs with random domains
- On tensor product approximation of analytic functions
- Sparse adaptive tensor Galerkin approximations of stochastic PDE-constrained control problems
- Uncertainty quantification analysis in discrete fracture network flow simulations
- \(\varepsilon\)-dimension in infinite dimensional hyperbolic cross approximation and application to parametric elliptic PDEs
- A dynamically adaptive sparse grids method for quasi-optimal interpolation of multidimensional functions
- Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations
- A convergent adaptive stochastic Galerkin finite element method with quasi-optimal spatial meshes
- New Bounds on the Lebesgue Constants of Leja Sequences on the Unit Disc and on $$\mathfrak {R}$$-Leja Sequences
- A fully adaptive multilevel stochastic collocation strategy for solving elliptic PDEs with random data
- On the influence of robustness measures on shape optimization with stochastic uncertainties
- Hyperbolic cross approximation in infinite dimensions
- Hessian-based adaptive sparse quadrature for infinite-dimensional Bayesian inverse problems
- Error Estimation and Adaptivity for Stochastic Collocation Finite Elements Part I: Single-Level Approximation
- Linear collective collocation approximation for parametric and stochastic elliptic PDEs
- Shape holomorphy of the stationary Navier-Stokes equations
- Nodal bases for the serendipity family of finite elements
- A multilevel stochastic collocation method for partial differential equations with random input data
- Adaptive Polynomial Interpolation on Evenly Spaced Meshes
- A method for dimensionally adaptive sparse trigonometric interpolation of periodic functions
- Multilevel approximation of parametric and stochastic PDES
- Convergence of Sparse Collocation for Functions of Countably Many Gaussian Random Variables (with Application to Elliptic PDEs)
- On the cardinality of lower sets and universal discretization
- Model reduction using sparse polynomial interpolation for the incompressible Navier-Stokes equations
- Novel results for the anisotropic sparse grid quadrature
- Constructing least-squares polynomial approximations
- Sparse quadrature for high-dimensional integration with Gaussian measure
- Stochastic modeling and regularity of the nonlinear elliptic curl-curl equation
- On the stability of polynomial interpolation using hierarchical sampling
- Adaptive Leja sparse grid constructions for stochastic collocation and high-dimensional approximation
- Domain uncertainty quantification in computational electromagnetics
- Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension
- Correcting for unknown errors in sparse high-dimensional function approximation
- Convergence of adaptive stochastic collocation with finite elements
- Multivariate Markov-type and Nikolskii-type inequalities for polynomials associated with downward closed multi-index sets
- A scalable estimator of sets of integral operators
- High-Order Polynomial Recovery in Finite Element Advection Schemes
- Stability analysis of hierarchical tensor methods for time-dependent PDEs
- An improved discrete least-squares/reduced-basis method for parameterized elliptic PDEs
- An adaptive high-order piecewise polynomial based sparse grid collocation method with applications
- Uncertainty quantification of geochemical and mechanical compaction in layered sedimentary basins
- Interpolation of sparse high-dimensional data
- Rank-adaptive tensor methods for high-dimensional nonlinear PDEs
- Comparison of Clenshaw-Curtis and Leja quasi-optimal sparse grids for the approximation of random PDEs
- The Vlasov-Fokker-Planck equation with high dimensional parametric forcing term
- Stochastic Methods for Solving High-Dimensional Partial Differential Equations
- A comparative study between kriging and adaptive sparse tensor-product methods for multi-dimensional approximation problems in aerodynamics design
- Discrete least squares polynomial approximation with random evaluations - application to parametric and stochastic elliptic PDEs
- Hierarchical tensor approximation of output quantities of parameter-dependent PDEs
- A multi level Monte Carlo method with control variate for elliptic PDEs with log-normal coefficients
- A posteriori error estimation for the stochastic collocation finite element method
- Approximate methods for stochastic eigenvalue problems
- Suboptimal feedback control of PDEs by solving HJB equations on adaptive sparse grids
- A multi-index quasi-Monte Carlo algorithm for lognormal diffusion problems
- A posteriori error estimation for the stochastic collocation finite element approximation of the heat equation with random coefficients
- Compressive Hermite interpolation: sparse, high-dimensional approximation from gradient-augmented measurements
- Dynamic tensor approximation of high-dimensional nonlinear PDEs
- Polynomial approximation of high-dimensional Hamilton-Jacobi-Bellman equations and applications to feedback control of semilinear parabolic PDEs
This page was built for publication: High-dimensional adaptive sparse polynomial interpolation and applications to parametric PDEs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q404259)
