Summary. We describe new stochastic spectral formulations with very good prop-erties in terms of conditioning. These formulations are built by combining Monte Carlo approximations of the Feynman-Kac formula and standard deterministic ap-proximations on basis functions. We give error bounds on the solutions obtained using these formulations in the case of linear approximations. Some numerical tests are made on an anisotropic diffusion equation using a tensor product Tchebychef polynomial basis and one random point schemes quantified or not.
The Wang-Landau algorithm is an adaptive Markov chain Monte Carlo algorithm to calculate the spectra...
Abstract. In this work we first focus on the Stochastic Galerkin approximation of the solution u of ...
Tanré Abstract. We describe new variants of the Euler scheme and of the walk on spheres method for t...
We describe new stochastic spectral formulations with very good properties in terms of conditioning....
The stochastic finite element analysis of elliptic type partial differential equations are considere...
The stochastic finite element analysis of elliptic type partial differential equations are considere...
Much attention has recently been devoted to the development of Stochastic Galerkin (SG) and Stochast...
Much attention has recently been devoted to the development of Stochastic Galerkin (SG) and Stochast...
Much attention has recently been devoted to the development of Stochastic Galerkin (SG) and Stochast...
Much attention has recently been devoted to the development of Stochastic Galerkin (SG) and Stochast...
In this work we focus on the numerical approximation of the solution u of a linear elliptic PDE with...
In this work we focus on the numerical approximation of the solution u of a linear elliptic PDE with...
In this work we focus on the numerical approximation of the solution u of a linear elliptic PDE with...
In this work we focus on the numerical approximation of the solution u of a linear elliptic PDE with...
In this work we focus on the numerical approximation of the solution u of a linear elliptic PDE with...
The Wang-Landau algorithm is an adaptive Markov chain Monte Carlo algorithm to calculate the spectra...
Abstract. In this work we first focus on the Stochastic Galerkin approximation of the solution u of ...
Tanré Abstract. We describe new variants of the Euler scheme and of the walk on spheres method for t...
We describe new stochastic spectral formulations with very good properties in terms of conditioning....
The stochastic finite element analysis of elliptic type partial differential equations are considere...
The stochastic finite element analysis of elliptic type partial differential equations are considere...
Much attention has recently been devoted to the development of Stochastic Galerkin (SG) and Stochast...
Much attention has recently been devoted to the development of Stochastic Galerkin (SG) and Stochast...
Much attention has recently been devoted to the development of Stochastic Galerkin (SG) and Stochast...
Much attention has recently been devoted to the development of Stochastic Galerkin (SG) and Stochast...
In this work we focus on the numerical approximation of the solution u of a linear elliptic PDE with...
In this work we focus on the numerical approximation of the solution u of a linear elliptic PDE with...
In this work we focus on the numerical approximation of the solution u of a linear elliptic PDE with...
In this work we focus on the numerical approximation of the solution u of a linear elliptic PDE with...
In this work we focus on the numerical approximation of the solution u of a linear elliptic PDE with...
The Wang-Landau algorithm is an adaptive Markov chain Monte Carlo algorithm to calculate the spectra...
Abstract. In this work we first focus on the Stochastic Galerkin approximation of the solution u of ...
Tanré Abstract. We describe new variants of the Euler scheme and of the walk on spheres method for t...