Sequential function approximation with noisy data
From MaRDI portal
Publication:2425274
DOI10.1016/J.JCP.2018.05.042zbMATH Open1415.65035OpenAlexW2806624819MaRDI QIDQ2425274FDOQ2425274
Dongbin Xiu, Kailiang Wu, Yeonjong Shin
Publication date: 26 June 2019
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcp.2018.05.042
Probabilistic models, generic numerical methods in probability and statistics (65C20) Algorithms for approximation of functions (65D15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A randomized Kaczmarz algorithm with exponential convergence
- Randomized extended Kaczmarz for solving least squares
- Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma
- Randomized Kaczmarz solver for noisy linear systems
- Large-Scale Machine Learning with Stochastic Gradient Descent
- Almost sure convergence of the Kaczmarz algorithm with random measurements
- Convergence acceleration of Kaczmarz's method
- A Randomized Tensor Quadrature Method for High Dimensional Polynomial Approximation
- An accelerated randomized Kaczmarz algorithm
- A Randomized Algorithm for Multivariate Function Approximation
Cited In (5)
- Recovery guarantees for polynomial coefficients from weakly dependent data with outliers
- Stochastic gradient descent for semilinear elliptic equations with uncertainties
- Constructing Least-Squares Polynomial Approximations
- Sequential approximation of functions in Sobolev spaces using random samples
- Numerical aspects for approximating governing equations using data
Uses Software
This page was built for publication: Sequential function approximation with noisy data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2425274)
