Name
Title | ||
|---|---|---|
A CHRISTOFFEL FUNCTION WEIGHTED LEAST SQUARES ALGORITHM FOR COLLOCATION APPROXIMATIONS |
Abstract | ||
|---|---|---|
We propose, theoretically investigate, and numerically validate an algorithm for the Monte Carlo solution of least-squares polynomial approximation problems in a collocation framework. Our investigation is motivated by applications in the collocation approximation of parametric functions, which frequently entails construction of surrogates via orthogonal polynomials. A standard Monte Carlo approach would draw samples according to the density defining the orthogonal polynomial family. Our proposed algorithm instead samples with respect to the ( weighted) pluripotential equilibrium measure of the domain, and subsequently solves a weighted least-squares problem, with weights given by evaluations of the Christoffel function. We present theoretical analysis to motivate the algorithm, and numerical results that show our method is superior to standard Monte Carlo methods in many situations of interest. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1090/mcom/3192 | MATHEMATICS OF COMPUTATION |
Field | DocType | Volume |
Parametric equation,Monte Carlo method,Mathematical optimization,Polynomial,Orthogonal polynomials,Mathematical analysis,Orthogonal collocation,Hybrid Monte Carlo,Algorithm,Quantum Monte Carlo,Mathematics,Collocation | Journal | 86 |
Issue | ISSN | Citations |
306 | 0025-5718 | 7 |
PageRank | References | Authors |
0.52 | 8 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Akil Narayan | 1 | 77 | 12.59 |
| John D. Jakeman | 2 | 52 | 7.65 |
| Tao ZHOU | 3 | 85 | 15.92 |