17,116 research outputs found
First order k-th moment finite element analysis of nonlinear operator equations with stochastic data
We develop and analyze a class of efficient Galerkin approximation methods for uncertainty quantification of nonlinear operator equations. The algorithms are based on sparse Galerkin discretizations of tensorized linearizations at nominal parameters. Specifically, we consider abstract, nonlinear, parametric operator equations J(\alpha ,u)=0 for random input \alpha (\omega ) with almost sure realizations in a neighborhood of a nominal input parameter \alpha _0. Under some structural assumptions on the parameter dependence, we prove existence and uniqueness of a random solution, u(\omega ) = S(\alpha (\omega )).
We derive a multilinear, tensorized operator equation for the deterministic computation of k-th order statistical moments of the random solution's fluctuations u(\omega ) - S(\alpha _0). We introduce and analyse sparse tensor Galerkin discretization schemes for the efficient, deterministic computation of the k-th statistical moment equation. We prove a shift theorem for the k-point correlation equation in anisotropic smoothness scales and deduce that sparse tensor Galerkin discretizations of this equation converge in accuracy vs. complexity which equals, up to logarithmic terms, that of the Galerkin discretization of a single instance of the mean field problem. We illustrate the abstract theory for nonstationary diffusion problems in random domains
Strong convergence of a fully discrete finite element approximation of the stochastic Cahn-Hilliard equation
We consider the stochastic Cahn-Hilliard equation driven by additive Gaussian
noise in a convex domain with polygonal boundary in dimension . We
discretize the equation using a standard finite element method in space and a
fully implicit backward Euler method in time. By proving optimal error
estimates on subsets of the probability space with arbitrarily large
probability and uniform-in-time moment bounds we show that the numerical
solution converges strongly to the solution as the discretization parameters
tend to zero.Comment: 25 page
Finite Element Methods with Artificial Diffusion for Hamilton-Jacobi-Bellman Equations
In this short note we investigate the numerical performance of the method of
artificial diffusion for second-order fully nonlinear Hamilton-Jacobi-Bellman
equations. The method was proposed in (M. Jensen and I. Smears,
arxiv:1111.5423); where a framework of finite element methods for
Hamilton-Jacobi-Bellman equations was studied theoretically. The numerical
examples in this note study how the artificial diffusion is activated in
regions of degeneracy, the effect of a locally selected diffusion parameter on
the observed numerical dissipation and the solution of second-order fully
nonlinear equations on irregular geometries.Comment: Enumath 2011, version 2 contains in addition convergence rate
Simulation of cell movement through evolving environment: a fictitious domain approach
A numerical method for simulating the movement of unicellular organisms which respond to chemical signals is presented. Cells are modelled as objects of finite size while the extracellular space is described by reaction-diffusion partial differential equations. This modular simulation allows the implementation of different models at the different scales encountered in cell biology and couples them in one single framework. The global computational cost is contained thanks to the use of the fictitious domain method for finite elements, allowing the efficient solve of partial differential equations in moving domains. Finally, a mixed formulation is adopted in order to better monitor the flux of chemicals, specifically at the interface between the cells and the extracellular domain
- …