اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCondition number analysis and preconditioning of the finite cell method
66
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The (Isogeometric) Finite Cell Method - in which a domain is immersed in a structured background mesh - suffers from conditioning problems when cells with small volume fractions occur. In this contribution, we establish a rigorous scaling relation between the condition number of (I)FCM system matrices and the smallest cell volume fraction. Ill-conditioning stems either from basis functions being small on cells with small volume fractions, or from basis functions being nearly linearly dependent on such cells. Based on these two sources of ill-conditioning, an algebraic preconditioning technique is developed, which is referred to as Symmetric Incomplete Permuted Inverse Cholesky (SIPIC). A detailed numerical investigation of the effectivity of the SIPIC preconditioner in improving (I)FCM condition numbers and in improving the convergence speed and accuracy of iterative solvers is presented for the Poisson problem and for two- and three-dimensional problems in linear elasticity, in which Nitches method is applied in either the normal or tangential direction. The accuracy of the preconditioned iterative solver enables mesh convergence studies of the finite cell method.
قيم البحث
اقرأ أيضاً
The finite cell method (FCM) belongs to the class of immersed boundary methods, and combines the fictitious domain approach with high-order approximation, adaptive integration and weak imposition of unfitted Dirichlet boundary conditions. For the ana
lysis of complex geometries, it circumvents expensive and potentially error-prone meshing procedures, while maintaining high rates of convergence. The present contribution provides an overview of recent accomplishments in the FCM with applications in structural mechanics. First, we review the basic components of the technology using the p- and B-spli
We investigate the piecewise linear nonconforming Crouzeix-Raviar and the lowest order Raviart-Thomas finite-element methods for the Poisson problem on three-dimensional anisotropic meshes. We first give error estimates of the Crouzeix-Raviart and th
e Raviart-Thomas finite-element approximate problems. We next present the equivalence between the Raviart-Thomas finite-element method and the enriched Crouzeix-Raviart finite-element method. We emphasise that we do not impose either shape-regular or maximum-angle condition during mesh partitioning. Numerical results confirm the results that we obtained.
We present algebraic multilevel iteration (AMLI) methods for isogeometric discretization of scalar second order elliptic problems. The construction of coarse grid operators and hierarchical complementary operators are given. Moreover, for a uniform m
esh on a unit interval, the explicit representation of B-spline basis functions for a fixed mesh size $h$ is given for $p=2,3,4$ and for $C^{0}$- and $C^{p-1}$-continuity. The presented methods show $h$- and (almost) $p$-independent convergence rates. Supporting numerical results for convergence factor and iterations count for AMLI cycles ($V$-, linear $W$-, nonlinear $W$-) are provided. Numerical tests are performed, in two-dimensions on square domain and quarter annulus, and in three-dimensions on quarter thick ring.
We study the weak finite element method solving convection-diffusion equations. A weak finite element scheme is presented based on a spacial variational form. We established a weak embedding inequality that is very useful in the weak finite element a
nalysis. The optimal order error estimates are derived in the discrete $H^1$-norm, the $L_2$-norm and the $L_infty$-norm, respectively. In particular, the $H^1$-superconvergence of order $k+2$ is given under certain condition. Finally, numerical examples are provided to illustrate our theoretical analysis
This paper analyses the following question: let $mathbf{A}_j$, $j=1,2,$ be the Galerkin matrices corresponding to finite-element discretisations of the exterior Dirichlet problem for the heterogeneous Helmholtz equations $ ablacdot (A_j abla u_j) +
k^2 n_j u_j= -f$. How small must $|A_1 -A_2|_{L^q}$ and $|{n_1} - {n_2}|_{L^q}$ be (in terms of $k$-dependence) for GMRES applied to either $(mathbf{A}_1)^{-1}mathbf{A}_2$ or $mathbf{A}_2(mathbf{A}_1)^{-1}$ to converge in a $k$-independent number of iterations for arbitrarily large $k$? (In other words, for $mathbf{A}_1$ to be a good left- or right-preconditioner for $mathbf{A}_2$?). We prove results answering this question, give theoretical evidence for their sharpness, and give numerical experiments supporting the estimates. Our motivation for tackling this question comes from calculating quantities of interest for the Helmholtz equation with random coefficients $A$ and $n$. Such a calculation may require the solution of many deterministic Helmholtz problems, each with different $A$ and $n$, and the answer to the question above dictates to what extent a previously-calculated inverse of one of the Galerkin matrices can be used as a preconditioner for other Galerkin matrices.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
