返回
A RANDOMIZED TENSOR QUADRATURE METHOD FOR HIGH DIMENSIONAL POLYNOMIAL APPROXIMATION
DOI:10.1137/16M1081695.png)
摘要
En 中文
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.
Keyword:
orthogonal polynomial
tensor Gauss quadrature
randomized Kaczmarz algorithm
approximation theory
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
引用论文
Generic Limits of Dryopetalon, Rollinsia, Sibara, and Thelypodiopsis (Brassicaceae), and a Synopsis of Dryopetalon十字花科植物Dryopetalon、Rollinsia、Sibara和Thelypodiopsis的属级界限,以及Dryopetalon的概要
Comparing Outcomes for Patients with Clinical T1b Renal Cell Carcinoma Treated With Either Percutaneous Microwave Ablation or Surgery
Urology
IF0
没有更多内容

