Fast solution of three-dimensional elliptic equations with randomly generated jumping coefficients by using tensor-structured preconditioners

NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS(2023)

Cited 1|Views3
No score
Abstract
In this paper, we propose and analyze the numerical algorithms for fast solution of periodic elliptic problems in random media in Double-struck capital Rd$$ {\mathbb{R}}<^>d $$, d=2,3$$ d=2,3 $$. Both the two-dimensional (2D) and three-dimensional (3D) elliptic problems are considered for the jumping equation coefficients built as a checkerboard type configuration of bumps randomly distributed on a large LxL$$ L\times L $$, or LxLxL$$ L\times L\times L $$ lattice, respectively. The finite element method discretization procedure on a 3D nxnxn$$ n\times n\times n $$ uniform tensor grid is described in detail, and the Kronecker tensor product approach is proposed for fast generation of the stiffness matrix. We introduce tensor techniques for the construction of the low Kronecker rank spectrally equivalent preconditioner in a periodic setting to be used in the framework of the preconditioned conjugate gradient iteration. The discrete 3D periodic Laplacian pseudo-inverse is first diagonalized in the Fourier basis, and then the diagonal matrix is reshaped into a fully populated third-order tensor of size nxnxn$$ n\times n\times n $$. The latter is approximated by a low-rank canonical tensor by using the multigrid Tucker-to-canonical tensor transform. As an example, we apply the presented solver in numerical analysis of stochastic homogenization method where the 3D elliptic equation should be solved many hundred times, and where for every random sampling of the equation coefficient one has to construct the new stiffness matrix and the right-hand side. The computational characteristics of the presented solver in terms of a lattice parameter L$$ L $$ and the grid-size, nd$$ {n}<^>d $$, in both 2D and 3D cases are illustrated in numerical tests. Our solver can be used in various applications where the elliptic problem should be solved for a number of different coefficients for example, in many-particle dynamics, protein docking problems or stochastic modeling.
More
Translated text
Key words
elliptic problem solver in 3D,Kronecker product,low-rank tensor product approximation,PCG iteration,PDE with random coefficients,preconditioners
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined