Name
Abstract | ||
|---|---|---|
We present a numerical method for polynomial approximation of multivariate functions. The method utilizes Gauss quadrature in tensor product form, which is known to be inefficient in high dimensions. Here we demonstrate that by using a new randomized algorithm and taking advantage of the tensor structure of the grids, a highly efficient algorithm can be constructed. The new method does not require prior knowledge/storage of the entire data set at all the tensor grid points, whose total number of points is excessively large in high dimensions. Instead the method utilizes one data point at a time and iteratively conducts the approximation. This feature allows the use of the method irrespective of the size of the data set. We establish the rate of convergence of this iterative algorithm and show that its operational counts can be lower than the standard methods, when applicable, such as least squares. Numerical examples in up to hundreds of dimensions are presented to verify the theoretical analysis and demonstrate the effectiveness of the method. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1137/16M1081695 | SIAM JOURNAL ON SCIENTIFIC COMPUTING |
Keywords | Field | DocType |
orthogonal polynomial,tensor Gauss quadrature,randomized Kaczmarz algorithm,approximation theory | Gauss–Kronrod quadrature formula,Tensor product,Nyström method,Mathematical optimization,Tensor,Iterative method,Mathematical analysis,Approximation theory,Rate of convergence,Gaussian quadrature,Mathematics | Journal |
Volume | Issue | ISSN |
39 | 5 | 1064-8275 |
Citations | PageRank | References |
2 | 0.46 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kailiang Wu | 1 | 3 | 1.49 |
| Yeonjong Shin | 2 | 4 | 0.92 |
| Dongbin Xiu | 3 | 1068 | 115.57 |