اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدComparisons of Some Iterative Algorithms for Biot Equations
97
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, we aim at solving the Biot model under stabilized finite element discretizations. To solve the resulting generalized saddle point linear systems, some iterative methods are proposed and compared. In the first method, we apply the GMRES algorithm as the outer iteration. In the second method, the Uzawa method with variable relaxation parameters is employed as the outer iteration method. In the third approach, Uzawa method is treated as a fixed-point iteration, the outer solver is the so-called Anderson acceleration. In all these methods, the inner solvers are preconditioners for the generalized saddle point problem. In the preconditioners, the Schur complement approximation is derived by using Fourier analysis approach. These preconditioners are implemented exactly or inexactly. Extensive experiments are given to justify the performance of the proposed preconditioners and to compare all the algorithms.
قيم البحث
اقرأ أيضاً
We review a family of algorithms for Lyapunov- and Riccati-type equations which are all related to each other by the idea of emph{doubling}: they construct the iterate $Q_k = X_{2^k}$ of another naturally-arising fixed-point iteration $(X_h)$ via a s
ort of repeated squaring. The equations we consider are Stein equations $X - A^*XA=Q$, Lyapunov equations $A^*X+XA+Q=0$, discrete-time algebraic Riccati equations $X=Q+A^*X(I+GX)^{-1}A$, continuous-time algebraic Riccati equations $Q+A^*X+XA-XGX=0$, palindromic quadratic matrix equations $A+QY+A^*Y^2=0$, and nonlinear matrix equations $X+A^*X^{-1}A=Q$. We draw comparisons among these algorithms, highlight the connections between them and to other algorithms such as subspace iteration, and discuss open issues in their theory.
In this work we analyze an optimized artificial fixed-stress iteration scheme for the numerical approximation of the Biot system modelling fluid flow in deformable porous media. The iteration is based on a prescribed constant artificial volumetric me
an total stress in the first half step. The optimization comes through the adaptation of a numerical stabilization or tuning parameter and aims at an acceleration of the iterations. The separated subproblems of fluid flow, written as a mixed first order in space system, and mechanical deformation are discretized by space-time finite element methods of arbitrary order. Continuous and discontinuous discretizations of the time variable are encountered. The convergence of the iteration schemes is proved for the continuous and fully discrete case. The choice of the optimization parameter is identified in the proofs of convergence of the iterations. The analyses are illustrated and confirmed by numerical experiments.
In this paper, we develop two parameter-robust numerical algorithms for Biot model and applied the algorithms in brain edema simulations. By introducing an intermediate variable, we derive a multiphysics reformulation of the Biot model. Based on the
reformulation, the Biot model is viewed as a generalized Stokes subproblem combining with a reaction-diffusion subproblem. Solving the two subproblems together or separately will lead to a coupled or a decoupled algorithm. We conduct extensive numerical experiments to show that the two algorithms are robust with respect to the physics parameters. The algorithms are applied to study the brain swelling caused by abnormal accumulation of cerebrospinal fluid in injured areas. The effects of key physics parameters on brain swelling are carefully investigated. It is observe that the permeability has the greatest effect on intracranial pressure (ICP) and tissue deformation; the Youngs modulus and the Poisson ratio will not affect the maximum ICP too much but will affect the tissue deformation and the developing speed of brain swelling.
Often in applications ranging from medical imaging and sensor networks to error correction and data science (and beyond), one needs to solve large-scale linear systems in which a fraction of the measurements have been corrupted. We consider solving s
uch large-scale systems of linear equations $mathbf{A}mathbf{x}=mathbf{b}$ that are inconsistent due to corruptions in the measurement vector $mathbf{b}$. We develop several variants of iterative methods that converge to the solution of the uncorrupted system of equations, even in the presence of large corruptions. These methods make use of a quantile of the absolute values of the residual vector in determining the iterate update. We present both theoretical and empirical results that demonstrate the promise of these iterative approaches.
We propose a set of iterative regularization algorithms for the TV-Stokes model to restore images from noisy images with Gaussian noise. These are some extensions of the iterative regularization algorithm proposed for the classical Rudin-Osher-Fatemi
(ROF) model for image reconstruction, a single step model involving a scalar field smoothing, to the TV-Stokes model for image reconstruction, a two steps model involving a vector field smoothing in the first and a scalar field smoothing in the second. The iterative regularization algorithms proposed here are Richardsons iteration like. We have experimental results that show improvement over the original method in the quality of the restored image. Convergence analysis and numerical experiments are presented.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
