An approach to discrete operator learning based on sparse high-dimensional approximation
sparse approximationpartial differential equationsnonlinear approximationhigh-dimensional approximationoperator learningdimension-incremental algorithm
Numerical integration (65D30) Numerical quadrature and cubature formulas (65D32) Numerical methods for trigonometric approximation and interpolation (65T40) Best approximation, Chebyshev systems (41A50) Algorithms for approximation of functions (65D15) Fourier series and coefficients in several variables (42B05) Trigonometric solutions to PDEs (35C09) Polynomial solutions to PDEs (35C11) Numerical approximation of high-dimensional functions; sparse grids (65D40)
- scientific article; zbMATH DE number 5681750 (Why is no real title available?)
- scientific article; zbMATH DE number 2223421 (Why is no real title available?)
- scientific article; zbMATH DE number 5180707 (Why is no real title available?)
- A physics-informed variational DeepONet for predicting crack path in quasi-brittle materials
- A short note on solving partial differential equations using convolutional neural networks
- Adaptive stochastic Galerkin FEM
- An efficient spatial discretization of spans of multivariate Chebyshev polynomials
- B-DeepONet: an enhanced Bayesian deeponet for solving noisy parametric PDEs using accelerated replica exchange SGLD
- Can physics-informed neural networks beat the finite element method?
- Experiments: planning, analysis, and optimization
- Generalization bounds for sparse random feature expansions
- High-dimensional sparse FFT based on sampling along multiple rank-1 lattices
- MC-Nonlocal-PINNs: Handling Nonlocal Operators in PINNs Via Monte Carlo Sampling
- MIONet: Learning Multiple-Input Operators via Tensor Product
- Multilevel Picard approximations of high-dimensional semilinear partial differential equations with locally monotone coefficient functions
- Multiple rank-1 lattices as sampling schemes for multivariate trigonometric polynomials
- Neural and spectral operator surrogates: unified construction and expression rate bounds
- Nonlinear approximation in bounded orthonormal product bases
- On multilevel Picard numerical approximations for high-dimensional nonlinear parabolic partial differential equations and high-dimensional nonlinear backward stochastic differential equations
- Physics-informed neural networks: a deep learning framework for solving forward and inverse problems involving nonlinear partial differential equations
- Sparse spectral methods for solving high-dimensional and multiscale elliptic PDEs
- Spectral Methods in MATLAB
- Tent-transformed lattice rules for integration and approximation of multivariate non-periodic functions
- The uniform sparse FFT with application to PDEs with random coefficients
- Three ways to solve partial differential equations with neural networks — A review
This page was built for publication: An approach to discrete operator learning based on sparse high-dimensional approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7240682)