Multiscale elliptic PDE upscaling and function approximation via subsampled data
From MaRDI portal
exponential decayfunction approximationlocalizationmultiscale PDEsnumerical upscalingsubsampled data
Theoretical approximation in context of PDEs (35A35) Boundary value problems for second-order elliptic equations (35J25) Numerical interpolation (65D05) Numerical computation using splines (65D07) Error bounds for boundary value problems involving PDEs (65N15) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)
Abstract: There is an intimate connection between numerical upscaling of multiscale PDEs and scattered data approximation of heterogeneous functions: the coarse variables selected for deriving an upscaled equation (in the former) correspond to the sampled information used for approximation (in the latter). As such, both problems can be thought of as recovering a target function based on some coarse data that are either artificially chosen by an upscaling algorithm, or determined by some physical measurement process. The purpose of this paper is then to study that, under such a setup and for a specific elliptic problem, how the lengthscale of the coarse data, which we refer to as the subsampled lengthscale, influences the accuracy of recovery, given limited computational budgets. Our analysis and experiments identify that, reducing the subsampling lengthscale may improve the accuracy, implying a guiding criterion for coarse-graining or data acquisition in this computationally constrained scenario, especially leading to direct insights for the implementation of the Gamblets method in the numerical homogenization literature. Moreover, reducing the lengthscale to zero may lead to a blow-up of approximation error if the target function does not have enough regularity, suggesting the need for a stronger prior assumption on the target function to be approximated. We introduce a singular weight function to deal with it, both theoretically and numerically. This work sheds light on the interplay of the lengthscale of coarse data, the computational costs, the regularity of the target function, and the accuracy of approximations and numerical simulations.
Recommendations
- Subgrid Upscaling and Mixed Multiscale Finite Elements
- An analysis of a class of variational multiscale methods based on subspace decomposition
- A data-driven approach for multiscale elliptic PDEs with random coefficients based on intrinsic dimension reduction
- A machine learning approach for efficient uncertainty quantification using multiscale methods
- Numerical Homogenization of Elliptic Multiscale Problems by Subspace Decomposition
Cites work
- A high-order approach to elliptic multiscale problems with general unstructured coefficients
- An analysis of a class of variational multiscale methods based on subspace decomposition
- Analysis of p-Laplacian regularization in semisupervised learning
- Bayesian numerical homogenization
- Consistency of Lipschitz learning with infinite unlabeled data and finite labeled data
- Constraint energy minimizing generalized multiscale finite element method
- Edge multiscale methods for elliptic problems with heterogeneous coefficients
- Efficient implementation of the localized orthogonal decomposition method
- Elliptic Partial Differential Equations of Second Order
- Error analysis of a variational multiscale stabilization for convection-dominated diffusion equations in two dimensions
- Exponential convergence for multiscale linear elliptic PDEs via adaptive edge basis functions
- Function approximation via the subsampled Poincaré inequality
- scientific article; zbMATH DE number 5681750 (Why is no real title available?)
- Localization of elliptic multiscale problems
- Localized bases for finite-dimensional homogenization approximations with nonseparated scales and high contrast
- Metric-based upscaling
- Multigrid with Rough Coefficients and Multiresolution Operator Decomposition from Hierarchical Information Games
- On the convergence rates of GMsFEMs for heterogeneous elliptic problems without oversampling techniques
- Operator-adapted wavelets, fast solvers, and numerical homogenization. From a game theoretic approach to numerical approximation and algorithm design
- Optimal Local Approximation Spaces for Generalized Finite Element Methods with Application to Multiscale Problems
- Optimal local multi-scale basis functions for linear elliptic equations with rough coefficients
- Oversampling for the multiscale finite element method
- Polyharmonic homogenization, rough polyharmonic splines and sparse super-localization
- Properly-weighted graph Laplacian for semi-supervised learning
- Scattered Data Approximation
- Sparse operator compression of higher-order elliptic operators with rough coefficients
- Special Finite Element Methods for a Class of Second Order Elliptic Problems with Rough Coefficients
- Weighted nonlocal Laplacian on interpolation from sparse data
Cited in
(4)- Error Estimate of Multiscale Finite Element Method for Periodic Media Revisited
- Exponentially Convergent Multiscale Methods for 2D High Frequency Heterogeneous Helmholtz Equations
- Exponentially convergent multiscale finite element method
- Sparse Cholesky factorization for solving nonlinear PDEs via Gaussian processes
This page was built for publication: Multiscale elliptic PDE upscaling and function approximation via subsampled data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5064414)
