Skip to main content
Log in

A fast discrete spectral method for stochastic partial differential equations

  • Published:
Advances in Computational Mathematics Aims and scope Submit manuscript

Abstract

The goal of this paper is to construct an efficient numerical algorithm for computing the coefficient matrix and the right hand side of the linear system resulting from the spectral Galerkin approximation of a stochastic elliptic partial differential equation. We establish that the proposed algorithm achieves an exponential convergence with requiring only O\((n\log _{2}^{d+1}n)\) number of arithmetic operations, where n is the highest degree of the one dimensional orthogonal polynomial used in the algorithm, d+1 is the number of terms in the finite Karhunen–Loéve (K-L) expansion. Numerical experiments confirm the theoretical estimates of the proposed algorithm and demonstrate its computational efficiency.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Babuška, I., Nobile, F., Tempone, R.: A stochastic collocation method for elliptic partial differential equations with random input data. SIAM J. Numer. Anal. 45, 1005–1034 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  2. Babuška, I., Nobile, F., Tempone, R.: A stochastic collocation method for elliptic partial differential equations with random input data. SIAM Rev. 52, 317–355 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  3. Babuška, I., Tempone, R., Zouraris, G.E.: Galerkin finite element approximations of stochastic elliptic partial differential equations. SIAM J. Numer. Anal. 42, 800–825 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  4. Barletta, E., Dragomir, S.: Vector valued holomorphic functions. Bull. Math. Soc. Sci. Math. Roumanie 52, 211–226 (2009)

    MATH  MathSciNet  Google Scholar 

  5. Barthelmann, V., Novak, E., Ritter, E.: High dimensional polynomial interpolation on sparse grids. Adv. Comput. Math. 2, 273–288 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  6. Bäck, J., Nobile, F., Tamellini, L., Tempone, R.: Stochastic spectral galerkin and collocation methods for pdes with random coefficients: A numerical comparison, in Lecture Notes in Computational Science and Engineering. Springer, New York (2011)

    MATH  Google Scholar 

  7. Barth, A., Schwab, C., Zollinger, N.: Multi-level Monte Carlo Finite Element method for elliptic PDEs with stochastic coefficients. Numer. Math. 119, 123–161 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  8. Bieri, M., Schwab, C.: Sparse high order FEM for elliptic SPDEs. Comput. Methods Appl. Mech. Engrg. 198, 1149–1170 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  9. Bostan, A., Salvy, B., Schost, É.: Fast conversion algorithms for orthogonal polynomials. Linear Algebra Appl. 432, 249–258 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  10. Brenner, S.C., Scott, L.R.: The mathematical theory of finite element methods, 3rd edn. Springer, New York (2008)

    Book  MATH  Google Scholar 

  11. Cao, Y., Jiang, Y., Xu, Y.: A fast algorithm for orthogonal polynomial expansions on sparse grids. J. Complex. 30, 673–682 (2014)

    Article  Google Scholar 

  12. Cao, Y., Yin, L.: Spectral Galerkin method for stochastic wave equations driven by space-time white noise. Commun. Pure Appl. Anal. 6, 607–617 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  13. Chernov, A.: Optimal convergence estimates for the trace of the polynomial L 2-projection operator on a simplex. Math. Comp. 81, 765–787 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  14. Chernov, A., Schwab, C.: First order k-th moment finite element analysis of nonlinear operator equations with stochastic data. Math. Comp. 82, 1859–1888 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  15. Ciarlet, P.G.: The finite element method for elliptic problems, in Studies in Mathematics and its Applications. North-Holland Publishing Co., Amsterdam (1978)

    Google Scholar 

  16. Cuypers, G., Ysebaert, G., Moonen, M., Pisoni, F.: Chebyshev interpolation for dmt modems. IEEE Int. Conf. 5, 2736–2740 (2004)

    Google Scholar 

  17. Garcke, J., Griebel, M.: Classification with anisotropic sparse grids using simplicial basis functions. Intell. Data Anal. 6, 483–502 (2002)

    MATH  Google Scholar 

  18. Gerstner, T., Griebel, M.: Dimension-adaptive tensor-product quadrature. Computing 71, 65–87 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  19. Gil, A., Segura, J., Temme, N.M.: Numerical methods for special functions. SIAM, Philadelphia, PA (2007)

    Book  MATH  Google Scholar 

  20. Gunzburger, M., Zhang, G., Webster, C.: An adaptive wavelet stochastic collocation method for irregular solutions of partial differential equations with random input data. Lect. Notes Comput. Sci. Eng. 97, 137–170 (2014)

    Article  MATH  Google Scholar 

  21. Hausenblas, E.: Finite element approximation of stochastic partial differential equations driven by Poisson random measures of jump type. SIAM J. Numer. Anal. 46, 437–471 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  22. Collier, N., Haji-Ali, A.L., Nobile, F., von Schwerin, E., Tempone, R.: A continuation multi level Monte Carlo algorithm. BIT Numer. Math. 55, 399–432 (2015)

    Article  MATH  Google Scholar 

  23. Jiang, Y., Xu, Y.: Fast discrete algorithms for sparse fourier exnpansions fo high dimensional functions. J. Complex. 26(1), 51–81 (2010)

    Article  Google Scholar 

  24. Jiang, Y., Xu, Y.: B-spline quasi-interpolation on sparse grids. J. Complex. 27, 466–488 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  25. Jiang, Y., Xu, Y.: Fast computation of the multidimensional discrete fourier transform and inverse fourier transform on sparse grids. Math. Comp. 83, 2347–2384 (2014)

    Article  MATH  MathSciNet  Google Scholar 

  26. Khoromskij, B.N., Schwab, C.: Tensor-structured Galerkin approximation of parametric and stochastic elliptic PDEs. SIAM J. Sci. Comput. 33, 364–385 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  27. Migliorati, G., Nobile, F., Schwerin, E., Tempone, R.: Analysis of the discrete L 2 projection on polynomial spaces with random evaluations. Found. Comput. Math. 14, 419–456 (2014)

    MATH  MathSciNet  Google Scholar 

  28. Nobile, F., Tempone, R., Webster, C.G.: An anisotropic sparse grid stochastic collocation method for partial differential equations with random input data. SIAM J. Numer. Anal. 46, 2411–2442 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  29. Nobile, F., Tempone, R., Webster, C.G.: A sparse grid stochastic collocation method for partial differential equations with random input data. SIAM J. Numer. Anal. 46, 2309–2345 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  30. Shen, J., Wang, L.: Sparse spectral approximations of high-dimensional problems based on hyperbolic cross. SIAM J. Numer. Anal. 48, 1087–1109 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  31. Shen, J., Yu, H.: Efficient spectral sparse grid methods and applications to high-dimensional elliptic problems. SIAM J. Sci. Comput. 32, 3228–3250 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  32. Strang, G., Fix, G.J.: An analysis of the finite element method, prentice-hall series in automatic computation, 2nd edn. Wellesley-Cambridge Press (2008)

  33. Tang, T., Zhou, T.: On discrete least-squares projection in unbounded domain with random evaluations and its application to parametric uncertainty quantification. SIAM J. Sci. Comput. 36, 2272–2295 (2014)

    Article  MATH  MathSciNet  Google Scholar 

  34. Teckentrup, A., Jantsch, P., Webster, C., Gunzburger, M.: A multilevel stochastic collocation method for partial differential equations with random input data, arXiv preprint arXiv:128.84.21.199 (2014)

  35. Todor, R.A., Schwab, C.: Convergence rates for sparse chaos approximations of elliptic problems with stochastic coefficients. IMA J. Numer. Anal. 27, 232–261 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  36. Wan, X., Xiu, D., Karniadakis, G.E.: Stochastic solutions for the two-dimensional advection-diffusion equation. SIAM J. Sci. Comput. 26, 578–590 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  37. Xiu, D., Karniadakis, G.E.: The Wiener-Askey polynomial chaos for stochastic differential equations. SIAM J. Sci. Comput. 24, 619–644 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  38. Xiu, D., Karniadakis, G.E.: Modeling uncertainty in flow simulations via generalized polynomial chaos. J. Comput. Phys. 187, 137–167 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  39. Xiu, D., Shen, J.: Efficient stochastic Galerkin methods for random diffusion equations. J. Comput. Phys. 228, 266–281 (2009)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yuesheng Xu.

Additional information

Communicated by: Aihui Zhou

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Cao, Y., Jiang, Y. & Xu, Y. A fast discrete spectral method for stochastic partial differential equations. Adv Comput Math 43, 973–998 (2017). https://doi.org/10.1007/s10444-017-9513-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10444-017-9513-4

Keywords

Mathematics Subject Classification (2010)

Navigation