{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T16:40:44Z","timestamp":1787330444134,"version":"build-2736575974"},"reference-count":39,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"5","funder":[{"DOI":"10.13039\/100006227","name":"Lawrence Livermore National Laboratory","doi-asserted-by":"publisher","award":["B597952"],"award-info":[{"award-number":["B597952"]}],"id":[{"id":"10.13039\/100006227","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>In approximating a function by its truncated polynomial chaos expansion (PCE), the target function is projected onto a space spanned by a finite set of orthonormal basis polynomials. Nonintrusive or pseudospectral methods approximate this projection using point evaluations of the target function. One nonintrusive strategy uses the weighted least squares approximation. For this method, like many other nonintrusive methods, the quality of the results depends crucially on the points and weights. The aim of this paper is to find points and weights that lead to excellent accuracy and stability of the weighted least squares approximation. We start by studying the connection between some of the most efficient cubature rules and weighted least squares approximations, and we use this connection to formulate an optimization problem for finding the desired points and weights. We also give a practical algorithm for solving this optimization problem. We then use these points and weights in our numerical experiments to approximate the PCE coefficients for various target functions and polynomial approximation spaces. The results suggest that by using these points and weights, an optimal convergence rate can be achieved even when the number of points scales linearly with (and is only slightly lager than) the dimension of the polynomial space.<\/jats:p>","DOI":"10.1137\/15m1028303","type":"journal-article","created":{"date-parts":[[2017,9,14]],"date-time":"2017-09-14T12:14:37Z","timestamp":1505391277000},"page":"A1991-A2019","source":"Crossref","is-referenced-by-count":3,"title":["Least Squares Approximation of Polynomial Chaos Expansions With Optimized Grid Points"],"prefix":"10.1137","volume":"39","author":[{"given":"Saman","family":"Ghili","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gianluca","family":"Iaccarino","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2017,9,14]]},"reference":[{"key":"atypb1","volume-title":"Nonlinear programming: Analysis and methods","author":"Avriel M.","year":"2003"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1137\/050645142"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1137\/S0036142902418680"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018977404843"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1992.4.2.141"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1142\/S0218202512500236"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.3166\/remn.15.81-92"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jat.2006.03.008"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492904000182"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492900002804"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.2307\/1969178"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1137\/120890715"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cma.2012.03.019"},{"key":"atypb14","first-page":"21","volume-title":"J. Comput. Appl. Math., 112","author":"Cools R.","year":"1999"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1007\/s10543-010-0300-6"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(93)90027-9"},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1137\/140972536"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.2514\/6.2009-976"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.2514\/6.2008-1892"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198506720.001.0001"},{"key":"atypb21","volume-title":"Stochastic Finite Elements: A Spectral Approach","author":"Ghanem R. G.","year":"2003"},{"key":"atypb22","doi-asserted-by":"crossref","DOI":"10.56021\/9781421407944","volume-title":"Matrix Computations","volume":"3","author":"Golub G. H.","year":"2012"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.2514\/6.2006-891"},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-010-9397-7"},{"key":"atypb25","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2015.02.001"},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1137\/120897109"},{"key":"atypb28","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-013-9186-4"},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1016\/j.jat.2012.01.008"},{"key":"atypb30","volume-title":"Approximate Calculation of Multiple Integrals","author":"Stroud A. H.","year":"1971"},{"key":"atypb31","doi-asserted-by":"crossref","DOI":"10.1090\/coll\/023","volume-title":"Orthogonal polynomials","volume":"23","author":"Szego G.","year":"1939"},{"key":"atypb32","doi-asserted-by":"publisher","DOI":"10.1137\/130913511"},{"key":"atypb33","doi-asserted-by":"publisher","DOI":"10.1137\/060659831"},{"key":"atypb34","volume-title":"Approximation Theory and Approximation Practice","author":"Trefethen L. N.","year":"2013"},{"key":"atypb35","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719574"},{"key":"atypb36","doi-asserted-by":"publisher","DOI":"10.2307\/2371268"},{"key":"atypb37","volume-title":"Memorandum report, 42","author":"Woodbury M. A.","year":"1950"},{"key":"atypb38","doi-asserted-by":"publisher","DOI":"10.1137\/040615201"},{"key":"atypb39","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827501387826"}],"container-title":["SIAM Journal on Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/15M1028303","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T16:05:49Z","timestamp":1787328349000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/15M1028303"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1]]},"references-count":39,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["10.1137\/15M1028303"],"URL":"https:\/\/doi.org\/10.1137\/15m1028303","relation":{},"ISSN":["1064-8275","1095-7197"],"issn-type":[{"value":"1064-8275","type":"print"},{"value":"1095-7197","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1]]}}}