Sparse pseudospectral approximation method

نویسندگان

  • Paul G. Constantine
  • Michael Eldred
  • Eric Phipps
  • Michael S. Eldred
  • Eric T. Phipps
چکیده

Multivariate global polynomial approximations – such as polynomial chaos or stochastic collocation methods – are now in widespread use for sensitivity analysis and uncertainty quantification. The pseudospectral variety of these methods uses a numerical integration rule to approximate the Fourier-type coefficients of a truncated expansion in orthogonal polynomials. For problems in more than two or three dimensions, a sparse grid numerical integration rule offers accuracy with a smaller node set compared to tensor product approximation. However, when using a sparse rule to approximately integrate these coefficients, one often finds unacceptable errors in the coefficients associated with higher degree polynomials. By reexamining Smolyak’s algorithm and exploiting the connections between interpolation and projection in tensor product spaces, we construct a sparse pseudospectral approximation method that accurately reproduces the coefficients for basis functions that naturally correspond to the sparse grid integration rule. The compelling numerical results show that this is the proper way to use sparse grid integration rules for pseudospectral approximation. 2012 Elsevier B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sparsifying Preconditioner for Pseudospectral Approximations of Indefinite Systems on Periodic Structures

This paper introduces the sparsifying preconditioner for the pseudospectral approximation of highly indefinite systems on periodic structures, which include the frequency-domain response problems of the Helmholtz equation and the Schrödinger equation as examples. This approach transforms the dense system of the pseudospectral discretization approximately into a sparse system via an equivalent i...

متن کامل

Adaptive Smolyak Pseudospectral Approximations

Polynomial approximations of computationally intensive models are central to uncertainty quantification. This paper describes an adaptive method for nonintrusive pseudospectral approximation, based on Smolyak’s algorithm with generalized sparse grids. We rigorously analyze and extend the nonadaptive method proposed in [P. G. Constantine, M. S. Eldred, and E. T. Phipps, Comput. Methods Appl. Mec...

متن کامل

An improved pseudospectral approximation of generalized Burger-Huxley and Fitzhugh-Nagumo equations

In this research paper, an improved Chebyshev-Gauss-Lobatto pseudospectral approximation of nonlinear Burger-Huxley and Fitzhugh- Nagumo equations have been presented. The method employs chebyshev Gauss-Labatto points in time and space to obtain spectral accuracy. The mapping has introduced and transformed the initial-boundary value non-homogeneous problem to homogeneous problem. The main probl...

متن کامل

A Pseudospectral Approach for Kirchhoff Plate Bending Problems with Uncertainties

This paper proposes a pseudospectral approach for the Kirchhoff plate bending problem with uncertainties. The Karhunen-Loève expansion is used to transform the original problem to a stochastic fourth-order PDE depending only on a finite number of random variables. For the latter problem, its exact solution is approximated by a gPC expansion, with the coefficients obtained by the sparse grid met...

متن کامل

Pseudospectral Knotting Methods for Solving Optimal Control Problems

A class of computational methods for solving a wide variety of optimal control problems is presented; these problems include nonsmooth, nonlinear, switched optimal control problems, as well as standard multiphase problems. Methods are based on pseudospectral approximations of the differential constraints that are assumed to be given in the form of controlled differential inclusions including th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012