Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Galerkin finite element approximations of stochastic elliptic partial differential equations
KTH, Superseded Departments, Numerical Analysis and Computer Science, NADA.
2004 (English)In: SIAM Journal on Numerical Analysis, ISSN 0036-1429, E-ISSN 1095-7170, Vol. 42, no 2, 800-825 p.Article in journal (Refereed) Published
Abstract [en]

We describe and analyze two numerical methods for a linear elliptic problem with stochastic coefficients and homogeneous Dirichlet boundary conditions. Here the aim of the computations is to approximate statistical moments of the solution, and, in particular, we give a priori error estimates for the computation of the expected value of the solution. The first method generates independent identically distributed approximations of the solution by sampling the coefficients of the equation and using a standard Galerkin finite element variational formulation. The Monte Carlo method then uses these approximations to compute corresponding sample averages. The second method is based on a finite dimensional approximation of the stochastic coefficients, turning the original stochastic problem into a deterministic parametric elliptic problem. A Galerkin finite element method, of either the h- or p-version, then approximates the corresponding deterministic solution, yielding approximations of the desired statistics. We present a priori error estimates and include a comparison of the computational work required by each numerical approximation to achieve a given accuracy. This comparison suggests intuitive conditions for an optimal selection of the numerical approximation.

Place, publisher, year, edition, pages
2004. Vol. 42, no 2, 800-825 p.
Keyword [en]
stochastic elliptic equation, perturbation estimates, Karhunen-Loeve expansion, finite elements, Monte Carlo method, k x h-version, p x h-version, expected value, error estimates, boundary-value-problems, quadrature-formulas, uncertainties, domain
National Category
Computational Mathematics
Identifiers
URN: urn:nbn:se:kth:diva-23590ISI: 000222773600015OAI: oai:DiVA.org:kth-23590DiVA: diva2:342289
Note
QC 20100525Available from: 2010-08-10 Created: 2010-08-10 Last updated: 2017-12-12Bibliographically approved
In thesis
1. Numerical Complexity Analysis of Weak Approximation of Stochastic Differential Equations
Open this publication in new window or tab >>Numerical Complexity Analysis of Weak Approximation of Stochastic Differential Equations
2002 (English)Doctoral thesis, comprehensive summary (Other scientific)
Abstract [en]

The thesis consists of four papers on numerical complexityanalysis of weak approximation of ordinary and partialstochastic differential equations, including illustrativenumerical examples. Here by numerical complexity we mean thecomputational work needed by a numerical method to solve aproblem with a given accuracy. This notion offers a way tounderstand the efficiency of different numerical methods.

The first paper develops new expansions of the weakcomputational error for Itˆo stochastic differentialequations using Malliavin calculus. These expansions have acomputable leading order term in a posteriori form, and arebased on stochastic flows and discrete dual backward problems.Beside this, these expansions lead to efficient and accuratecomputation of error estimates and give the basis for adaptivealgorithms with either deterministic or stochastic time steps.The second paper proves convergence rates of adaptivealgorithms for Itˆo stochastic differential equations. Twoalgorithms based either on stochastic or deterministic timesteps are studied. The analysis of their numerical complexitycombines the error expansions from the first paper and anextension of the convergence results for adaptive algorithmsapproximating deterministic ordinary differential equations.Both adaptive algorithms are proven to stop with an optimalnumber of time steps up to a problem independent factor definedin the algorithm. The third paper extends the techniques to theframework of Itˆo stochastic differential equations ininfinite dimensional spaces, arising in the Heath Jarrow Mortonterm structure model for financial applications in bondmarkets. Error expansions are derived to identify differenterror contributions arising from time and maturitydiscretization, as well as the classical statistical error dueto finite sampling.

The last paper studies the approximation of linear ellipticstochastic partial differential equations, describing andanalyzing two numerical methods. The first method generates iidMonte Carlo approximations of the solution by sampling thecoefficients of the equation and using a standard Galerkinfinite elements variational formulation. The second method isbased on a finite dimensional Karhunen- Lo`eve approximation ofthe stochastic coefficients, turning the original stochasticproblem into a high dimensional deterministic parametricelliptic problem. Then, adeterministic Galerkin finite elementmethod, of either h or p version, approximates the stochasticpartial differential equation. The paper concludes by comparingthe numerical complexity of the Monte Carlo method with theparametric finite element method, suggesting intuitiveconditions for an optimal selection of these methods. 2000Mathematics Subject Classification. Primary 65C05, 60H10,60H35, 65C30, 65C20; Secondary 91B28, 91B70.

Place, publisher, year, edition, pages
Stockholm: KTH, 2002. x, 28 p.
Series
Trita-NA, ISSN 0348-2952 ; 0220
Keyword
Adaptive methods, a posteriori error estimates, stochastic differential equations, weak approximation, Monte Carlo methods, Malliavin Calculus, HJM model, option price, bond market, stochastic elliptic equation, Karhunen-Loeve expansion, numerical co
National Category
Computational Mathematics
Identifiers
urn:nbn:se:kth:diva-3413 (URN)KTH/NA/R--20/20--SE (ISRN)91-7283-350-5 (ISBN)
Public defence
2002-10-11, 00:00
Note
QC 20100825Available from: 2002-09-26 Created: 2002-09-26 Last updated: 2010-08-25Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Tempone Olariaga, RaulZouraris, Georgios
By organisation
Numerical Analysis and Computer Science, NADA
In the same journal
SIAM Journal on Numerical Analysis
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 2119 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf