Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA computational study of preconditioning techniques for the stochastic diffusion equation with lognormal coefficient
306
0
0.0
(
0
)
Added by
Giacomo Capodaglio
Publication date
2019
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
We present a computational study of several preconditioning techniques for the GMRES algorithm applied to the stochastic diffusion equation with a lognormal coefficient discretized with the stochastic Galerkin method. The clear block structure of the system matrix arising from this type of discretization motivates the analysis of preconditioners designed according to a field-splitting strategy of the stochastic variables. This approach is inspired by a similar procedure used within the framework of physics based preconditioners for deterministic problems, and its application to stochastic PDEs represents the main novelty of this work. Our numerical investigation highlights the superior properties of the field-split type preconditioners over other existing strategies in terms of computational time and stochastic parameter dependence.
rate research
Read More
The paper focuses on developing and studying efficient block preconditioners based on classical algebraic multigrid for the large-scale sparse linear systems arising from the fully coupled and implicitly cell-centered finite volume discretization of multi-group radiation diffusion equations, whose coefficient matrices can be rearranged into the $(G+2)times(G+2)$ block form, where $G$ is the number of energy groups. The preconditioning techniques are based on the monolithic classical algebraic multigrid method, physical-variable based coarsening two-level algorithm and two types of block Schur complement preconditioners. The classical algebraic multigrid is applied to solve the subsystems that arise in the last three block preconditioners. The coupling strength and diagonal dominance are further explored to improve performance. We use representative one-group and twenty-group linear systems from capsule implosion simulations to test the robustness, efficiency, strong and weak parallel scaling properties of the proposed methods. Numerical results demonstrate that block preconditioners lead to mesh- and problem-independent convergence, and scale well both algorithmically and in parallel.
In this article, we develop and analyze a full discretization, based on the spatial spectral Galerkin method and the temporal drift implicit Euler scheme, for the stochastic Cahn--Hilliard equation driven by multiplicative space-time white noise. By introducing an appropriate decomposition of the numerical approximation, we first use the factorization method to deduce the a priori estimate and regularity estimate of the proposed full discretization. With the help of the variation approach, we then obtain the sharp spatial and temporal convergence rate in negative Sobolev space in mean square sense. Furthermore, the sharp mean square convergence rates in both time and space are derived via the Sobolev interpolation inequality and semigroup theory. To the best of our knowledge, this is the first result on the convergence rate of temporally and fully discrete numerical methods for the stochastic Cahn--Hilliard equation driven by multiplicative space-time white noise.
For the first time, we develop a convergent numerical method for the llinear integral equation derived by M.M. Lavrentev in 1964 with the goal to solve a coefficient inverse problem for a wave-like equation in 3D. The data are non overdetermined. Convergence analysis is presented along with the numerical results. An intriguing feature of the Lavrentev equation is that, without any linearization, it reduces a highly nonlinear coefficient inverse problem to a linear integral equation of the first kind. Nevertheless, numerical results for that equation, which use the data generated for that coefficient inverse problem, show a good reconstruction accuracy. This is similar with the classical Gelfand-Levitan equation derived in 1951, which is valid in the 1D case.
In this paper, we consider the strong convergence of the time-space fractional diffusion equation driven by fractional Gaussion noise with Hurst index $Hin(frac{1}{2},1)$. A sharp regularity estimate of the mild solution and the numerical scheme constructed by finite element method for integral fractional Laplacian and backward Euler convolution quadrature for Riemann-Liouville time fractional derivative are proposed. With the help of inverse Laplace transform and fractional Ritz projection, we obtain the accurate error estimates in time and space. Finally, our theoretical results are accompanied by numerical experiments.
An all-at-once linear system arising from the nonlinear tempered fractional diffusion equation with variable coefficients is studied. Firstly, the nonlinear and linearized implicit schemes are proposed to approximate such the nonlinear equation with continuous/discontinuous coefficients. The stabilities and convergences of the two schemes are proved under several suitable assumptions, and numerical examples show that the convergence orders of these two schemes are $1$ in both time and space. Secondly, a nonlinear all-at-once system is derived based on the nonlinear implicit scheme, which may suitable for parallel computations. Newtons method, whose initial value is obtained by interpolating the solution of the linearized implicit scheme on the coarse space, is chosen to solve such the nonlinear all-at-once system. To accelerate the speed of solving the Jacobian equations appeared in Newtons method, a robust preconditioner is developed and analyzed. Numerical examples are reported to demonstrate the effectiveness of our proposed preconditioner. Meanwhile, they also imply that such the initial guess for Newtons method is more suitable.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
