{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T16:40:36Z","timestamp":1787330436245,"version":"build-2736575974"},"reference-count":16,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"5","funder":[{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["N660011524053"],"award-info":[{"award-number":["N660011524053"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA95501410022"],"award-info":[{"award-number":["FA95501410022"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS 1418771"],"award-info":[{"award-number":["DMS 1418771"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Sci. Comput."],"published-print":{"date-parts":[[2017,1]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1137\/16m1081695","type":"journal-article","created":{"date-parts":[[2017,9,6]],"date-time":"2017-09-06T13:56:18Z","timestamp":1504706178000},"page":"A1811-A1833","source":"Crossref","is-referenced-by-count":10,"title":["A Randomized Tensor Quadrature Method for High Dimensional Polynomial Approximation"],"prefix":"10.1137","volume":"39","author":[{"given":"Kailiang","family":"Wu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yeonjong","family":"Shin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dongbin","family":"Xiu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2017,9,6]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018977404843"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1007\/s10665-013-9656-3"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492904000182"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-012-9237-2"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1007\/s11075-011-9451-z"},{"key":"atypb6","first-page":"81","volume-title":"Proceedings. of the International Conference on Tools, Methods, and Languages for Scientific and Engineering Computation, North-Holland","author":"Genz A.","year":"1984"},{"key":"atypb7","first-page":"355","volume":"35","author":"Kaczmarz S.","year":"1937","journal-title":"Bull. Int. Acad. Polonaise Sci. Lett."},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1090\/mcom\/2971"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1007\/s10543-010-0265-5"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1137\/16M1075193"},{"key":"atypb11","first-page":"240","volume":"4","author":"Smolyak S.","year":"1963","journal-title":"Sov. Math. Dokl."},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9030-4"},{"key":"atypb13","volume-title":"American Mathematical Society","author":"G.","year":"1939"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1109\/BSEC.2013.6618494"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcp.2015.06.042"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1137\/120889897"}],"container-title":["SIAM Journal on Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/16M1081695","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T16:05:16Z","timestamp":1787328316000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/16M1081695"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["10.1137\/16M1081695"],"URL":"https:\/\/doi.org\/10.1137\/16m1081695","relation":{},"ISSN":["1064-8275","1095-7197"],"issn-type":[{"value":"1064-8275","type":"print"},{"value":"1095-7197","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1]]}}}