.png){kind=icon}
.png){kind=icon}
Return
A RANDOMIZED ALGORITHM FOR MULTIVARIATE FUNCTION APPROXIMATION
.png){kind=icon}
PRE
AI
DOI：10.1137/16M1075193.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The randomized Kaczmarz (RK) method is a randomized iterative algorithm for solving (overdetermined) linear systems of equations. In this paper, we extend the RK method to function approximation in a bounded domain. We demonstrate that by conducting the approximation randomly one sample at a time the method converges. Convergence analysis is conducted in terms of expectation, where we establish sharp upper and lower bounds for both the convergence rate of the algorithm and the error of the resulting approximation. The analysis also establishes the optimal sampling probability measure to achieve the optimal rate of convergence. Various numerical examples are provided to validate the theoretical results.
Keywords:
multivariate function approximation
Kaczmarz algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.6
Papers:
5.1K
Citations:
1.8W