A RANDOMIZED ALGORITHM FOR MULTIVARIATE FUNCTION APPROXIMATION

Cited 13 time in webofscience Cited 0 time in scopus
  • Hit : 42
  • Download : 0
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.
Publisher
SIAM PUBLICATIONS
Issue Date
2017
Language
English
Article Type
Article
Citation

SIAM JOURNAL ON SCIENTIFIC COMPUTING, v.39, no.3, pp.A983 - A1002

ISSN
1064-8275
DOI
10.1137/16M1075193
URI
http://hdl.handle.net/10203/297253
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 13 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0