اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA scalable and robust preconditioner for high-order FEM based on the fast diagonalization method
85
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Pavarino proved that the additive Schwarz method with vertex patches and a low-order coarse space gives a $p$-robust solver for symmetric and coercive problems. However, for very high polynomial degree it is not feasible to assemble or factorize the matrices for each patch. In this work we introduce a direct solver for separable patch problems that scales to very high polynomial degree on tensor product cells. The solver constructs a tensor product basis that diagonalizes the blocks in the stiffness matrix for the internal degrees of freedom of each individual cell. As a result, the non-zero structure of the cell matrices is that of the graph connecting internal degrees of freedom to their projection onto the facets. In the new basis, the patch problem is as sparse as a low-order finite difference discretization, while having a sparser Cholesky factorization. We can thus afford to assemble and factorize the matrices for the vertex-patch problems, even for very high polynomial degree. In the non-separable case, the method can be applied as a preconditioner by approximating the problem with a separable surrogate.
قيم البحث
اقرأ أيضاً
This study suggests a fast computational method for crack propagation, which is based on the extended finite element method (X-FEM). It is well known that the X-FEM might be the most popular numerical method for crack propagation. However, with the i
ncrease of complexity of the given problem, the size of FE model and the number of iterative steps are increased correspondingly. To improve the efficiency of X-FEM, an efficient computational method termed decomposed updating reanalysis (DUR) method is suggested. For most of X-FEM simulation procedures, the change of each iterative step is small and it will only lead a local change of stiffness matrix. Therefore, the DUR method is proposed to predict the modified response by only calculating the changed part of equilibrium equations. Compared with other fast computational methods, the distinctive characteristic of the proposed method is to update the modified stiffness matrix with a local updating strategy, which only the changed part of stiffness matrix needs to be updated. To verify the performance of the DUR method, several typical numerical examples have been analyzed and the results demonstrate that this method is a highly efficient method with high accuracy.
We design a Hybrid High-Order (HHO) scheme for the Poisson problem that is fully robust on polytopal meshes in the presence of small edges/faces. We state general assumptions on the stabilisation terms involved in the scheme, under which optimal erro
r estimates (in discrete and continuous energy norms, as well as $L^2$-norm) are established with multiplicative constants that do not depend on the maximum number of faces in each element, or the relative size between an element and its faces. We illustrate the error estimates through numerical simulations in 2D and 3D on meshes designed by agglomeration techniques (such meshes naturally have elements with a very large numbers of faces, and very small faces).
We propose and analyze a robust BPX preconditioner for the integral fractional Laplacian on bounded Lipschitz domains. For either quasi-uniform grids or graded bisection grids, we show that the condition numbers of the resulting systems remain unifor
mly bounded with respect to both the number of levels and the fractional power. The results apply also to the spectral and censored fractional Laplacians.
In this paper, we develop a robust fast method for mobile-immobile variable-order (VO) time-fractional diffusion equations (tFDEs), superiorly handling the cases of small or vanishing lower bound of the VO function. The valid fast approximation of th
e VO Caputo fractional derivative is obtained using integration by parts and the exponential-sum-approximation method. Compared with the general direct method, the proposed algorithm ($RF$-$L1$ formula) reduces the acting memory from $mathcal{O}(n)$ to $mathcal{O}(log^2 n)$ and computational cost from $mathcal{O}(n^2)$ to $mathcal{O}(n log^2 n)$, respectively, where $n$ is the number of time levels. Then $RF$-$L1$ formula is applied to construct the fast finite difference scheme for the VO tFDEs, which sharp decreases the memory requirement and computational complexity. The error estimate for the proposed scheme is studied only under some assumptions of the VO function, coefficients, and the source term, but without any regularity assumption of the true solutions. Numerical experiments are presented to verify the effectiveness of the proposed method.
In this paper, we propose to combine the fifth order Hermite weighted essentially non-oscillatory (HWENO) scheme and fast sweeping method (FSM) for the solution of the steady-state $S_{N}$ transport equation in the finite volume framework. It is well
-known that the $S_{N}$ transport equation asymptotically converges to a macroscopic diffusion equation in the limit of optically thick systems with small absorption and sources. Numerical methods which can preserve the asymptotic limit are referred to as asymptotic preserving methods. In the one-dimensional case, we provide the analysis to demonstrate the asymptotic preserving property of the high order finite volume HWENO method, by showing that its cell-edge and cell-average fluxes possess the thick diffusion limit. Numerical results in both one- and two- dimensions are presented to validate its asymptotic preserving property. A hybrid strategy to compute the nonlinear weights in the HWENO reconstruction is introduced to save computational cost. Extensive one- and two-dimensional numerical experiments are performed to verify the accuracy, asymptotic preserving property and positivity of the proposed HWENO FSM.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
