Hostname: page-component-77f85d65b8-hzqq2 Total loading time: 0 Render date: 2026-04-19T08:32:42.908Z Has data issue: false hasContentIssue false
  • English
  • Français

Stochastic Collocation on Unstructured Multivariate Meshes

Part of: Probabilistic methods, simulation and stochastic differential equations

Published online by Cambridge University Press:  03 July 2015

Akil Narayan  and
Tao Zhou
Akil Narayan
Affiliation:
Scientific Computing and Imaging Institute, University of Utah, Salt Lake City, UT 84112, USA
Tao Zhou*
Affiliation:
LSEC, Institute of Computational Mathematics and Scientific/Engineering Computing, AMSS, the Chinese Academy of Sciences, Beijing, China
*
*Corresponding author. Email addresses: akil@sci.utah.edu (A. Narayan), tzhou@lsec.cc.ac.cn (T. Zhou)
Get access

Abstract

Collocation has become a standard tool for approximation of parameterized systems in the uncertainty quantification (UQ) community. Techniques for least-squares regularization, compressive sampling recovery, and interpolatory reconstruction are becoming standard tools used in a variety of applications. Selection of a collocation mesh is frequently a challenge, but methods that construct geometrically unstructured collocation meshes have shown great potential due to attractive theoretical properties and direct, simple generation and implementation. We investigate properties of these meshes, presenting stability and accuracy results that can be used as guides for generating stochastic collocation grids in multiple dimensions.

Keywords

Stochastic collocationunstructured methesleast-squarescompressive samplingleast interpolation

MSC classification

Secondary: 65C20: Models, numerical methods

Information

Type
Review Article
Information
Communications in Computational Physics , Volume 18 , Issue 1 , July 2015 , pp. 1 - 36
Copyright
Copyright © Global-Science Press 2015 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

[1]Babuska, I., Nobile, F., and Tempone, R.. A stochastic collocation method for elliptic partial differential equations with random input data. SIAM Review, 52(2):317–355, January 2010.Google Scholar
[2]Barthelmann, V., Novak, E., and Ritter, K.. High dimensional polynomial interpolation on sparse grids. Advances in Computational Mathematics, 12(4):273–288, March 2000.Google Scholar
[3]Bellman, R. E.. Adaptive control processes: a guided tour. Princeton University Press, 1961.Google Scholar
[4]Bendito, E., Carmona, A., Encinas, A.M., and Gesto, J.M.. Estimation of Fekete points. Journal of Computational Physics, 225(2):2354–2376, August 2007.Google Scholar
[5]Berman, R., Boucksom, S., and Nyström, D.. Fekete points and convergence towards equilibrium measures on complex manifolds. Acta Mathematica, 207(1):1–27, 2011.Google Scholar
[6]Bieri, M. and Schwab, C.. Sparse high order FEM for elliptic sPDEs. Computer Methods in Applied Mechanics and Engineering, 198(13-14):1149–1170, March 2009.Google Scholar
[7]Binev, P., Cohen, A., Dahmen, W., and DeVore, R.. Universal algorithms for learning theory. ii. piecewise polynomial functions. Constr. Approx., 2(26):127–152, 2007.Google Scholar
[8]Binev, P., Cohen, A., Dahmen, W., Devore, R. A., and N, V.. Temlyakov. Universal algorithms for learning theory part I: Piecewise constant functions. Journal of Machine Learning Research, 6:1297–1321, 2005.Google Scholar
[9]Blatman, G. and Sudret, B.. Adaptive sparse polynomial chaos expansion based on least angle regression. Journal of Computational Physics, 230(6):2345–2367, March 2011.CrossRefGoogle Scholar
[10]Bloom, T., Bos, L., Christensen, C., and Levenberg, N.. Polynomial interpolation of holomorphic functions in and n. Rocky Mountain Journal of Mathematics, 22(2):441–470, June 1992.Google Scholar
[11]Bloom, T. and Levenberg, N.. Weighted pluripotential theory in $c^n$. American Journal of Mathematics, 125(1):57–103, February 2003.Google Scholar
[12]Bos, L.. Near optimal location of points for Lagrange interpolation in several variables. PhD thesis, University of Toronto, 1981.Google Scholar
[13]Bos, L., Caliari, M., Marchi, S. De, Vianello, M., and Xu, Y.. Bivariate lagrange interpolation at the padua points: The generating curve approach. Journal of Approximation Theory, 143(1):15–25, November 2006.Google Scholar
[14]Bos, L., Marchi, S. De, Sommariva, A., and Vianello, M.. Computing multivariate fekete and leja points by numerical linear algebra. SIAM Journal on Numerical Analysis, 48(5):1984, 2010.Google Scholar
[15]Bos, L. P. and Levenberg, N.. On the calculation of approximate fekete points: the univariate case. Electronic Transactions on Numerical Analysis, 30:377–397, 2008.Google Scholar
[16]Bourgain, J., Dilworth, S., Ford, K., Konyagin, S., and Kutzarova, D.. Explicit constructions of RIP matrices and related problems. Duke Mathematical Journal, 159(1):145–185, July 2011.Google Scholar
[17]Breidt, J., Butler, T., and Estep, D.. A measure-theoretic computational method for inverse sensitivity problems i: Method and analysis. SIAM Journal on Numerical Analysis, 49(5):1836–1859, 2011.Google Scholar
[18]Brutman, L.. On the lebesgue function for polynomial interpolation. SIAM Journal on Numerical Analysis, 15(4):694, 1978.Google Scholar
[19]Bungartz, H.-J. and Griebel, M.. Sparse grids. Acta Numerica, 13(-1):147–269, 2004.Google Scholar
[20]Burkardt, J. and Eldred, M.. Comparison of non-intrusive polynomial chaos and stochastic collocation methods for uncertainty quantification. In 47th AIAA Aerospace Sciences Meeting including The New Horizons Forum and Aerospace Exposition. American Institute of Aeronautics and Astronautics, 2009.Google Scholar
[21]Burkardt, J., Gunzburger, M., and Lee, H.-C.. POD and CVT-based reduced-ordermoeling of navier-stokes flows. Computer Methods in Applied Mechanics and Engineering, 196(1-3):337–355, December 2006.Google Scholar
[22]Caliari, M., Marchi, S. De, and Vianello, M.. Bivariate polynomial interpolation on the square at new nodal sets. Applied Mathematics and Computation, 165(2):261–274, June 2005.Google Scholar
[23]Candès, E., Romberg, J., and Tao, T.. Stable signal recovery from incomplete and inaccurate measurements. Comm. Pure Appl. Math., 8(59):1207–1223, 2006.Google Scholar
[24]Candès, E. and Tao, T.. Stable signal recovery from incomplete and inaccurate measurements. IEEE Trans. Inform. Theory, 12(51):4203–4215, 2005.Google Scholar
[25]Candes, E.J. and Tao, T.. Decoding by linear programming. IEEE Transactions on Information Theory, 51(12):4203–4215, December 2005.Google Scholar
[26]Candes, E.J. and Tao, T.. Near-optimal signal recovery from random projections: Universal encoding strategies? IEEE Transactions on Information Theory, 52(12):5406–5425, December 2006.Google Scholar
[27]Chkifa, A., Cohen, A., Migliorati, G., Nobile, F., and Tempone, R.. Discrete least squares polynomial approximation with random evaluations-application to parametric and stochastic elliptic pdes. EPFL, MATHICSE Technical Report, 35/2013.Google Scholar
[28]Choi, S.-K., Grandhi, R. V., Canfield, R. A., and Pettit, C.L.. Polynomial chaos expansion with Latin hypercube sampling for estimating response variability. AIAA Journal, 42(6):1191–1198, 2004.Google Scholar
[29]Cohen, A., Dahmen, W., and DeVore, R.A.. Compressed sensing and best k-term approximation. J. Amer. Math. Soc., 22(1):211–231, 2009.Google Scholar
[30]Cohen, A., Davenport, M. A., and Leviatan, D.. On the stability and accuracy of least squares approximations. Foundations of Computational Mathematics, 13(5):819–834, 2013.Google Scholar
[31]Cohen, A., DeVore, R., and Schwab, C.. Convergence rates of best n-term galerkin approximations for a class of elliptic spdes. Found. Comp. Math., 6(10):615–646, 2010.Google Scholar
[32]Curtis, P.. n-parameter families and best approximation. Pacific Journal of Mathematics, 9(4):1013–1027, December 1959.Google Scholar
[33]Boor, C. de. Gauss elimination by segments and multivariate polynomial interpolation. In Proceedings of the conference on Approximation and computation: a fetschrift in honor of Walter Gautschi: a fetschrift in honor of Walter Gautschi, pages 11–22, West Lafayette, Indiana, United States, 1994. Birkhauser Boston Inc.Google Scholar
[34]Boor, C. de and Ron, A.. Computational aspects of polynomial interpolation in several variables. Mathematics of Computation, 58(198):705–727, April 1992.Google Scholar
[35]Boor, C. de and Ron, A.. The least solution for the polynomial interpolation problem. Mathematische Zeitschrift, 210(1):347–378, December 1992.Google Scholar
[36]Deane, A. E., Kevrekidis, I. G., Karniadakis, G. E., and Orszag, S. A.. Low-dimensional mdoels for complex geometry flows: Application to grooved channels and circular cylinders. Physics of Fluids A: Fluid Dynamics (1989-1993), 3(10):2337–2354, October 1991.Google Scholar
[37]Debusschere, B. J., Najm, H. N., Matta, A., Knio, O. M., Ghanem, R. G., and Le Maitre, O. P.. Protein labeling reactions in electrochemical microchannel flow: Numerical simulation and uncertainty propagation. Physics of Fluids, 15:2238, 2003.Google Scholar
[38]DeVore, R. A.. Deterministic constructions of compressed sensing matrices. Journal of Complexity, 23(4-6):918–925, August 2007.Google Scholar
[39]Donoho, D.L.. Compressed sensing. IEEE Trans. Inform. Theory, 4(52):1289–1306, 2006.Google Scholar
[40]Doostan, A. and Owhadi, H.. A non-adapted sparse approximation of pdes with stochastic inputs. J. Comput. Phys., 8(230):3015–3034, 2011.Google Scholar
[41]Ernst, O.G., Mugler, A., Starkloff, H.-J., and Ullmann, E.. On the convergence of generalized polynomial chaos expansions. ESAIM: Mathematical Modelling and Numerical Analysis, 46(02):317–339, 2012.Google Scholar
[42]Gao, Z. and Zhou, T.. Choice of nodal sets for least square polynomial chaos method with application to uncertainty quantification. Communications in Computational Physics, 16:365–381, 2014.Google Scholar
[43]Gerstner, T. and Griebel, M.. Numerical integration using sparse grids. Numerical Algorithms, 18(3):209–232, January 1998.Google Scholar
[44]Ghanem, R. G. and Spanos, P. D.Stochastic finite elements: a spectral approach. Springer-Verlag New York, Inc., 1991.Google Scholar
[45]GÃijnttner, R.. Evaluation of lebesgue constants. SIAM Journal on Numerical Analysis, 17(4):512–520, August 1980.Google Scholar
[46]Gyørfi, L., Kohler, M., Krzyz˙ak, A., and Walk, H.. A Distribution-Free Theory of Nonparametric Regression. Springer Series in Statistics, Springer-Verlag, Berlin, 2002.Google Scholar
[47]Hosder, S., Walters, R. W., and Balch, M.. Point-collocation nonintrusive polynomial chaos method for stochastic computational fluid dynamics. AIAA Journal, 48(12):2721–2730, December 2010.Google Scholar
[48]Iwen, M. A.. Simple deterministically constructible rip matrices with sublinear fourier sampling requirements. 43rd Annual Conference on Information Sciences and Systems (CISS), Baltimore, MD, 2009.Google Scholar
[49]Iwen, M. A.. Combinatorial sublinear-time fourier algorithms. Foundations of Computational Mathematics, 3(10):303–338, 2010.Google Scholar
[50]Kennedy, M. C. and O’Hagan, A.. Bayesian calibration of computer models. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 63(3):425–464, January 2001.Google Scholar
[51]Klimeck, M.. Pluripotential Theory. Oxford University Press, Oxford, 1991.Google Scholar
[52]Levenberg, N.. Weighted pluripotential theory results of berman-boucksom. arXiv:1010.4035, October 2010.Google Scholar
[53]Levenberg, N.. Ten lectures on weighted pluripotential theory. Dolomites Research Notes on Approximation, 5:1–59, 2012.Google Scholar
[54]Lubinsky, D.. A survey of weighted polynomial approximation with exponential weights. Surveys in Approximation Theory, 3:1–105, 2007.Google Scholar
[55]Eldred, M.. Recent advances in non-intrusive polynomial chaos and stochastic collocation methods for uncertainty analysis and design. In 50th AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics, and Materials Conference, Structures, Structural Dynamics, and Materials and Co-located Conferences. American Institute of Aeronautics and Astronautics, May 2009.Google Scholar
[56]Mairhuber, J.C.. On haar’s theorem concerning chebychev approximation problems having unique solutions. Proceedings of the American Mathematical Society, 7(4):609, August 1956.Google Scholar
[57]Marzouk, Y. and Xiu, D.. A stochastic collocation approach to bayesian inference in inverse problems. Communications in Computational Physics, 6(4):826–847, October 2009.Google Scholar
[58]Mathelin, L. and Gallivan, K. A.. A compressed sensing approach for partial differential equations with random input data. J. Comput. Phys., 12(4):919–954, 2012.Google Scholar
[59]Matjila, D. M.. Bounds for lebesgue functions for freud weights. Journal of Approximation Theory, 79(3):385–406, December 1994.Google Scholar
[60]Matjila, D. M.. Bounds for the weighted lebesgue functions for freud weights on a larger interval. Journal of Computational and Applied Mathematics, 65(1-3):293–298, December 1995.CrossRefGoogle Scholar
[61]Migliorati, G., Nobile, F., Schwerin, E., and Tempone, R.. Analysis of the discrete l 2 projection on polynomial spaces with random evaluations. Foundations of Computational Mathematics, doi:10.1007/s10208-013-9186-4, 2014.Google Scholar
[62]Najm, H.. Uncertainty quantification and polynomial chaos techniques in computational fluid dynamics. Annual review of fluid mechanics, 41(1):35–52, 2009.Google Scholar
[63]Narayan, A., Jackman, J., and Zhou, T.. A Christoffel function wighted least squares algrithm for collocation approximations. ArXiv: 1412.4305, 2014.Google Scholar
[64]Narayan, A. and Jakeman, J.. Adaptive leja sparse grid constructions for stochastic collocation and high-dimensional approximation. SIAM Journal on Scientific Computing, 36(6):A2952–A2983, 2014.Google Scholar
[65]Narayan, A. and Xiu, D.. Stochastic collocation methods on unstructured grids in high dimensions via interpolation. SIAM Journal on Scientific Computing, 34(3):A1729–A1752, June 2012.Google Scholar
[66]Nobile, F., Tempone, R., and Webster, C. G.. An anisotropic sparse grid stochastic collocation method for partial differential equations with random input data. SIAM Journal on Numerical Analysis, 46(5):2411–2442, January 2008.Google Scholar
[67]Patera, A. T. and Rozza, G.. Reduced Basis Approximation and A Posteriori Error Estimation for Parametrized Partial Differential Equations. MIT, version 1.0 edition, 2007.Google Scholar
[68]Penga, J., Hampton, J., and Doostan, A.. A weighted ℓ1-minimization approach for sparse polynomial chaos expansions. Journal of Computational Physics, 267(0):92–111, 2014.Google Scholar
[69]PoÃñtte, G., DesprÃl’s, B., and Lucor, D.. Uncertainty quantification for systems of conservation laws. Journal of Computational Physics, 228(7):2443–2467, April 2009.Google Scholar
[70]Prudhomme, C., Rovas, D. V., Veroy, K., Machiels, L., Maday, Y., Patera, A. T., and Turinici, G.. Reliable real-time solution of parametrized partial differential equations: Reduced-basis output bound methods. Journal of Fluids Engineering, 124(1):70, 2002.Google Scholar
[71]Pulch, R. and Xiu, D.. Generalised polynomial chaos for a class of linear conservation laws. Journal of Scientific Computing, 51(2):293–312, May 2012.Google Scholar
[72]Rauhut, H.. Compressive sensing and structured random matrices. Theoretical Foundations and Numerical Methods for Sparse Recovery, Fornasier, M. (Ed.) Berlin, New York (DE GRUYTER), pages 1–92, 2010.Google Scholar
[73]Rauhut, H. and Ward, R.. Sparse Legendre expansions via ℓ1-minimization. Journal of Approximation Theory, 164(5):517–533, May 2012.Google Scholar
[74]Hosder, S., Walters, R., and Balch, M.. Efficient sampling for non-intrusive polynomial chaos applications with multiple uncertain input variables. In 48th AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics, and Materials Conference, Structures, Structural Dynamics, and Materials and Co-located Conferences. American Institute of Aeronautics and Astronautics, April 2007.Google Scholar
[75]Saff, E. and Totik, V.. Logarithmic Potentials with External Fields. Springer, Berlin, 1997.CrossRefGoogle Scholar
[76]Sommariva, A. and Vianello, M.. Computing approximate fekete points by QR factorizations of vandermonde matrices. Computers&Mathematics with Applications, 57(8):1324–1336, April 2009.Google Scholar
[77]Szabados, J.. Weighted lagrange and hermite-fejér interpolation on the real line. Journal of Inequalities and Applications, 1997(2):481267, 1997.Google Scholar
[78]Szegö, G.. Orthogonal Polynomials. American Mathematical Society, Providence, RI, 1975.Google Scholar
[79]Tang, T. and Zhou, T.. On discrete least square projection in unbounded domain with random evaluations and its application to parametric uncertainty quantification. SIAM Journal on Scientific Computing, 36(5):A2272–A2295, 2014.Google Scholar
[80]Tang, T. and Zhou, T.. Recent developments in high order numerical methods for uncertainty quantification (in Chinese). Sciences in China: Mathematics, 45(6), 2015.Google Scholar
[81]Tartakovsky, D. M. and Xiu, D.. Stochastic analysis of transport in tubes with rough walls. Journal of Computational Physics, 217(1):248–259, September 2006.Google Scholar
[82]Taylor, M. A., Wingate, B. A., and Vincent, R. E.. An algorithm for computing fekete points in the triangle. SIAM Journal on Numerical Analysis, 38(5):1707–1720, 2000.Google Scholar
[83]Todor, R.A. and Schwab, C.. Convergence rates for sparse chaos approximations of elliptic problems with stochastic coefficients. IMA J. Numer. Anal., 2(27):232–261, 2007.Google Scholar
[84]Trefethen, L. N. and A, J.. Weideman, C.. Two results on polynomial interpolation in equally spaced points. Journal of Approximation Theory, 65(3):247–260, June 1991.Google Scholar
[85]Berg, E. van den and Friedlander, M.. Spgl1: A solver for large-scale sparse reconstruction. http://www.cs.ubc.ca/labs/scl/spgl1, 2007.Google Scholar
[86]Warburton, T.. An explicit construction of interpolation nodes on the simplex. Journal of Engineering Mathematics, 56(3):247–262, November 2006.Google Scholar
[87]Weil, A.. On some exponential sums. Proceedings of the National Academy of Sciences of the United States of America, 34(5):204–207, May 1948. PMID: 16578290 PMCID: PMC1079093.Google Scholar
[88]Xiu, D.. Efficient collocational approach for parametric uncertainty analysis. Commun. Comput. Phys, pages 293–309, 2007.Google Scholar
[89]Xiu, D.. Fast numerical methods for stochastic computations: A review. Communications in Computational Physics, 5(2-4):242–272, 2009.Google Scholar
[90]Xiu, D.. Numerical Methods for Stochastic Computations: A Spectral Method Approach. Princeton University Press, July 2010.Google Scholar
[91]Xiu, D. and Hesthaven, Jan S.. High-order collocation methods for differential equations with random inputs. SIAM Journal on Scientific Computing, 27(3):1118–1139, January 2005.Google Scholar
[92]Xiu, D. and Karniadakis, G. E.. The wiener-askey polynomial chaos for stochastic differential equations. SIAM Journal on Scientific Computing, 24(2):619–644, January 2002.Google Scholar
[93]Xiu, D. and Karniadakis, G. E.. Modeling uncertainty in flow simulations via generalized polynomial chaos. Journal of Computational Physics, 187(1):137–167, May 2003.Google Scholar
[94]Xu, Z.. Deterministic sampling of sparse trigonometric polynomials. Journal of Complexity, 27(2):133–140, April 2011.Google Scholar
[95]Xu, Z. and Zhou, T.. On sparse interpolation and the design of deterministic interpolation points. SIAM Journal on Scientific Computing, 36(4):A1752–A1769, 2014.Google Scholar
[96]Yan, L., Guo, L., and Xiu, D.. Stochastic collocation algorithms using ℓ1-minimization. International Journal for Uncertainty Quantification, 2(3):279–293, 2012.Google Scholar
[97]Yang, J. and Zhang, Y.. Alternating direction algorithms for ℓ1-problems in compressive sensing. SIAM Journal on Scientific Computing, 33(1):250–278, January 2011.Google Scholar
[98]Yang, X. and Karniadakis, G. E.. Reweighted ℓ1 minimization method for stochastic elliptic differential equations. Journal of Computational Physics, 248:87–108, September 2013.Google Scholar
[99]Yin, W., Osher, S., Goldfarb, D., and Darbon, J.. Bregman iterative algorithms for ℓ1-minimization with applications to compressed sensing. SIAM J. Imaging Sciences, 1(1):143–168, 2008.Google Scholar
[100]Zhou, T., Narayan, A., and Xiu, D.. Weighted discrete least-squares polynomial approximation using randomized quadratures. submitted, 2014.Google Scholar
[101]Zhou, T., Narayan, A., and Xu, Z.. Multivariate discrete least-squares approximations with a new type of collocation grid. SIAM Journal on Scientific Computing, 36(5):A2401–A2422, January 2014.Google Scholar