No open-access location is known for this record yet.
No open-access location is known for this record yet.
This work presents a stochastic collocation method for solving elliptic PDEs with random coefficients and forcing term which are assumed to depend on a finite number of random variables. The method consists of a hierarchic wavelet discretization in space and a sequence of hierarchic collocation operators in the probability domain to approximate the solution's statistics. The selection of collocation points is based on a Smolyak construction of zeros of orthogonal polynomials with respect to the probability density function of each random input variable. A sparse composition of levels of spatial refinements and stochastic collocation points is then proposed and analyzed, resulting in a substantial reduction of overall degrees of freedom. Like in the Monte Carlo approach, the algorithm results in solving a number of uncoupled, purely deterministic elliptic problems, which allows the integration of existing fast solvers for elliptic PDEs. Numerical examples on two-dimensional domains will then demonstrate the superiority of this sparse composite collocation finite element method compared to the “full composite” collocation finite element method and the Monte Carlo method.
Loading…
Stored only when both papers are in the corpus — 43 citations exist upstream.
Papers that cite the same references — the relational fallback while embeddings are still backfilling.
Imported from OpenAlex (CC0) — nothing here is generated.