共查询到20条相似文献,搜索用时 109 毫秒
1.
为了改进求解大型稀疏线性互补问题模系多重网格方法的收敛速度和计算时间,本文采用加速模系超松弛(AMSOR)迭代方法作为光滑算子.局部傅里叶分析和数值结果表明此光滑算子能有效地改进模系多重网格方法的收敛因子、迭代次数和计算时间. 相似文献
2.
3.
油气藏两相渗流问题的多重网格法 总被引:2,自引:0,他引:2
油气藏数值模拟要解一套高维、非线性、奇异、不定常方程组,工作量很大.本文讨论非线性椭圆-抛物方程的多重网格算法,给出了四重网格计算子程序,并把它用于底水气田计算,与SOR法比较,计算结果完全相同,计算效率显著提高。 相似文献
4.
角质层是皮肤屏障作用的最主要部分,它决定了外界物质对皮肤的渗透情况.在假设角质层细胞为一种三维的十四面体(物理学经典的tetrakaidecahedron体)的情况下,利用有限元法对角质层渗透性质进行了数值模拟研究.为此,首先完成了对角质层空间结构的网格拆分,拆分过程分两步进行:1.对角蛋白细胞的网格拆分;2.对角蛋白细胞周围的网状脂质体的网格拆分.在数值模拟过程中,则用有限元法得到方程离散的格式,用多重网格算法降低高频误差,提高计算精度.最后,给出了数值模拟结果的可视化效果图. 相似文献
5.
为了构造快速求解二次Lagrangian有限元方程的几何多重网格法,在选择二次Lagrangian有限元空间和一系列线性Lagrangian有限元空间分别作为最细网格层和其余粗网格层以及构造一种新限制算子的基础上,提出了一种新的几何多重网格法,并对它的计算量进行了估计.数值实验结果,与通常的几何多重网格法和AMG01法相比,表明了新算法计算量少且稳健性强. 相似文献
6.
《数学物理学报(A辑)》2018,(5)
该文针对几乎不可压缩弹性问题,设计了多重网格Uzawa型混合有限元方法,成功克服了"闭锁"现象.通过引入"压力"变量p将弹性问题转化为一个鞍点型系统,对该系统将Uzawa型迭代法和多重网格方法相结合,建立了多重网格和套迭代多重网格Uzawa型混合有限元方法,并给出了该算法的收敛性.数值算例验证了方法的有效性和稳定性. 相似文献
7.
本文讨论了mortar型旋转Q_1元的多重网格方法.证明了W循环的多重网格法是最优的,即收敛率与网格尺寸及层数无关.同时给出了一种可变的V循环多重网格算法,得到了一个条件数一致有界的预条件子.最后,数值试验验证了我们的理论结果. 相似文献
8.
9.
10.
采用PDE灵敏度滤波器可以消除连续体结构拓扑优化结果存在的棋盘格现象、数值不稳定等问题,且PDE灵敏度滤波器的实质是具有Neumann边界条件的Helmholtz偏微分方程.针对大规模PDE灵敏度滤波器的求解问题,有限元分析得到其代数方程,分别采用共轭梯度算法、多重网格算法和多重网格预处理共轭梯度算法对代数方程进行求解,并且研究精度、过滤半径以及网格数量对拓扑优化效率的影响.结果表明:与共轭梯度算法和多重网格算法相比,多重网格预处理共轭梯度算法迭代次数最少,运行时间最短,极大地提高了拓扑优化效率. 相似文献
11.
This paper covers the dynamics problems. The review and some aspects of main development stages of using Multigrid method for fluid multigrid technics are presented. Some approaches for solving Navier-Stokes equations and convection- diffusion problems are considered. 相似文献
12.
For a second-order elliptic boundary value problem, We develop an intergrid transfer operator in multigrid method for the P1-nonconforming finite element method. This intergrid transfer operator needs smaller computation than previous intergrid transfer operators. Multigrid method with this operator converges well. 相似文献
13.
Mehdi Dehghan Akbar Mohebbi 《Numerical Methods for Partial Differential Equations》2008,24(3):897-910
In this article, we apply compact finite difference approximations of orders two and four for discretizing spatial derivatives of wave equation and collocation method for the time component. The resulting method is unconditionally stable and solves the wave equation with high accuracy. The solution is approximated by a polynomial at each grid point that its coefficients are determined by solving a linear system of equations. We employ the multigrid method for solving the resulted linear system. Multigrid method is an iterative method which has grid independently convergence and solves the linear system of equations in small amount of computer time. Numerical results show that the compact finite difference approximation of fourth order, collocation and multigrid methods produce a very efficient method for solving the wave equation. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2008 相似文献
14.
Safaa J. Kasbah Issam W. Damaj Ramzi A. Haraty 《Journal of Computational and Applied Mathematics》2008
The problem of finding the solution of partial differential equations (PDEs) plays a central role in modeling real world problems. Over the past years, Multigrid solvers have showed their robustness over other techniques, due to its high convergence rate which is independent of the problem size. For this reason, many attempts for exploiting the inherent parallelism of Multigrid have been made to achieve the desired efficiency and scalability of the method. Yet, most efforts fail in this respect due to many factors (time, resources) governed by software implementations. In this paper, we present a hardware implementation of the V-cycle Multigrid method for finding the solution of a 2D-Poisson equation. We use Handel-C to implement our hardware design, which we map onto available field programmable gate arrays (FPGAs). We analyze the implementation performance using the FPGA vendor's tools. We demonstrate the robustness of Multigrid over other similar iterative solvers, such as Jacobi and successive over relaxation (SOR ), in both hardware and software. We compare our findings with a C++ version of each algorithm. The obtained results show better performance when compared to existing software versions. 相似文献
15.
16.
弦割法、Muller法与牛顿法一样,都是求解非线性方程的著名算法之一.然而在目前众多优秀的数值分析教材或论著中.关于弦割法和Muller法收敛阶的证明过程都是比较复杂的,无一例外的都是借助于差分方程的求解.本文对这两个算法的收敛阶给出了一种新的简单、直接的证明方法,达到了与牛顿法收敛阶证明方法的统一,同时还能够方便地求... 相似文献
17.
Multigrid methods are developed and analyzed for quadratic spline collocation equations arising from the discretization of
one-dimensional second-order differential equations. The rate of convergence of the two-grid method integrated with a damped
Richardson relaxation scheme as smoother is shown to be faster than 1/2, independently of the step-size. The additive multilevel
versions of the algorithms are also analyzed. The development of quadratic spline collocation multigrid methods is extended
to two-dimensional elliptic partial differential equations. Multigrid methods for quadratic spline collocation methods are
not straightforward: because the basis functions used with quadratic spline collocation are not nodal basis functions, the
design of efficient restriction and extension operators is nontrivial. Experimental results, with V-cycle and full multigrid,
indicate that suitably chosen multigrid iteration is a very efficient solver for the quadratic spline collocation equations.
Supported by Communications and Information Technology Ontario (CITO), Canada.
Supported by the Mathematical, Information, and Computational Sciences Division subprogram of the Office of Computational
and Technology Research, U.S. Department of Energy, under Contract W-31-109-Eng-38. 相似文献
18.
Akira IMAKURA 《数学研究及应用》2021,41(1):87-98
Multigrid methods are widely used and well studied for linear solvers and preconditioners of Krylov subspace methods. The multigrid method is one of the most powerful approaches for solving large scale linear systems;however, it may show low parallel efficiency on coarse grids. There are several kinds of research on this issue. In this paper, we intend to overcome this difficulty by proposing a novel multigrid algorithm that has multiple grids on each layer.Numerical results indicate that the proposed method shows a better convergence rate compared with the existing multigrid method. 相似文献
19.
The fast solutions of Crank-Nicolson scheme on quasi-uniform mesh for parabolic prob- lems are discussed. First, to decrease regularity requirements of solutions, some new error estimates are proved. Second, we analyze the two characteristics of parabolic discrete scheme, and find that the efficiency of Multigrid Method (MG) is greatly reduced. Nu- merical experiments compare the efficiency of Direct Conjugate Gradient Method (DCG) and Extrapolation Cascadic Multigrid Method (EXCMG). Last, we propose a Time- Extrapolation Algorithm (TEA), which takes a linear combination of previous several level solutions as good initial values to accelerate the rate of convergence. Some typical extrapolation formulas are compared numerically. And we find that under certain accuracy requirement, the CG iteration count for the 3-order and 7-level extrapolation formula is about 1/3 of that of DCG's. Since the TEA algorithm is independent of the space dimension, it is still valid for quasi-uniform meshes. As only the finest grid is needed, the proposed method is regarded very effective for nonlinear parabolic problems. 相似文献
20.
The ABE-I (Alternating Block Explicit-Implicit) method for diffusion problem is extended to solve the variable coefficient problem and the unconditional stability of the ABE-I method is proved by the energy method. 相似文献