共查询到19条相似文献,搜索用时 343 毫秒
1.
研究了一种求解大型Lyapunov矩阵方程的并行预处理变形共轭梯度法.首先将处理小型矩阵方程的Smith预处理方法引入该问题的求解,将原矩阵方程转变为Stein方程,然后采用变形共轭梯度法并行求解预处理后的矩阵方程.其中遇到的难点是需要确定参数μ及求矩阵(A+μI)的逆.基于估计特征值的Gerschgorin圆定理给出了参数μ的估值,再采用变形共轭梯度法并行求得矩阵(A +μ l)的逆,从而形成预处理后的矩阵方程.通过数值试验,该算法与未预处理的变形共轭梯度法相比较,预处理算法明显优于未预处理的算法,而且其并行效率高达0.85. 相似文献
2.
3.
本文研究了Lyapunov矩阵方程.利用共轭梯度法,建立了求该矩阵方程双对称解的迭代算法.同时,也能给出指定矩阵的最佳逼近双对称矩阵. 相似文献
4.
5.
提出了一种改进的梯度迭代算法来求解Sylvester矩阵方程和Lyapunov矩阵方程.该梯度算法是通过构造一种特殊的矩阵分裂,综合利用Jaucobi迭代算法和梯度迭代算法的求解思路.与已知的梯度算法相比,提高了算法的迭代效率.同时研究了该算法在满足初始条件下的收敛性.数值算例验证了该算法的有效性. 相似文献
6.
本文考虑具有张量积结构线性系统的数值解法.该线性系统常常来源于高维立方体上线性偏微分方程的有限差分离散化.利用张量一矩阵乘法,给出了基于张量格式的求解这类线性系统的共轭梯度法.与求解标准线性系统的共轭梯度法比较,新的算法能够节约大量的计算量及存储空间. 相似文献
7.
左共轭梯度法是求解大型稀疏线性方程组的一种新兴的Krylov子空间方法.为克服该算法数值表现不稳定、迭代中断的缺点,本文对原方法进行等价变形,得到左共轭梯度方向的另一迭代格式,给出一个拟极小化左共轭梯度算法.数值结果证实了该变形算法与原算法的相关性. 相似文献
8.
王在华 《数学的实践与认识》2021,(7):119-126
研究一类线性矩阵方程最小二乘问题的迭代法求解,利用目标函数与矩阵迹之间的关系构造了矩阵形式的"梯度"下降法迭代格式,推广了向量形式的经典"梯度"下降法,并引入了两个矩阵之间的弱正交性来刻画迭代修正量的特点.作为本文算法的应用,给出了机器翻译优化问题的一种迭代求解格式. 相似文献
9.
10.
11.
Spectral element method is well known as high-order method, and has potential better parallel feature as compared with low order methods. In this paper, a parallel preconditioned conjugate gradient iterative method is proposed to solving the spectral element approximation of the Helmholtz equation. The parallel algorithm is shown to have good performance as compared to non parallel cases, especially when the stiffness matrix is not memorized. A series of numerical experiments in one dimensional case is carried out to demonstrate the efficiency of the proposed method. 相似文献
12.
《Applied Mathematics Letters》2001,14(5):625-630
Linear systems of the form Ax = b, where the matrix A is symmetric and positive definite, often arise from the discretization of elliptic partial differential equations. A very successful method for solving these linear systems is the preconditioned conjugate gradient method. In this paper, we study parallel preconditioners for the conjugate gradient method based on the block two-stage iterative methods. Sufficient conditions for the validity of these preconditioners are given. Computational results of these preconditioned conjugate gradient methods on two parallel computing systems are presented. 相似文献
13.
This article is concerned with solving the high order Stein tensor equation arising in control theory. The conjugate gradient squared (CGS) method and the biconjugate gradient stabilized (BiCGSTAB) method are attractive methods for solving linear systems. Compared with the large-scale matrix equation, the equivalent tensor equation needs less storage space and computational costs. Therefore, we present the tensor formats of CGS and BiCGSTAB methods for solving high order Stein tensor equations. Moreover, a nearest Kronecker product preconditioner is given and the preconditioned tensor format methods are studied. Finally, the feasibility and effectiveness of the new methods are verified by some numerical examples. 相似文献
14.
Z. Dostál A. Friedlander F.A.M. Gomes S.A. Santos 《Annals of Operations Research》2002,117(1-4):117-129
A non-overlapping domain decomposition algorithm of the Neumann–Neumann type for solving contact problems of elasticity is presented. Using the duality theory of convex programming, the discretized problem turns into a quadratic one with equality and bound constraints. The dual problem is modified by orthogonal projectors to the natural coarse space. The resulting problem is solved by an augmented Lagrangian algorithm. The projectors ensure an optimal convergence rate for the solution of the auxiliary linear problems by the preconditioned conjugate gradient method. Relevant aspects on the numerical linear algebra of these problems are presented, together with an efficient parallel implementation of the method. 相似文献
15.
Parallel preconditioned conjugate gradient algorithm on GPU 总被引:1,自引:0,他引:1
We propose a parallel implementation of the Preconditioned Conjugate Gradient algorithm on a GPU platform. The preconditioning matrix is an approximate inverse derived from the SSOR preconditioner. Used through sparse matrix–vector multiplication, the proposed preconditioner is well suited for the massively parallel GPU architecture. As compared to CPU implementation of the conjugate gradient algorithm, our GPU preconditioned conjugate gradient implementation is up to 10 times faster (8 times faster at worst). 相似文献
16.
We present a class of nested iteration schemes for solving large sparse systems of linear equations with a coefficient matrix with a dominant symmetric positive definite part. These new schemes are actually inner/outer iterations, which employ the classical conjugate gradient method as inner iteration to approximate each outer iterate, while each outer iteration is induced by a convergent and symmetric positive definite splitting of the coefficient matrix. Convergence properties of the new schemes are studied in depth, possible choices of the inner iteration steps are discussed in detail, and numerical examples from the finite-difference discretization of a second-order partial differential equation are used to further examine the effectiveness and robustness of the new schemes over GMRES and its preconditioned variant. Also, we show that the new schemes are, at least, comparable to the variable-step generalized conjugate gradient method and its preconditioned variant. 相似文献
17.
We discuss the application of an augmented conjugate gradient to the solution of a sequence of linear systems of the same
matrix appearing in an iterative process for the solution of scattering problems. The conjugate gradient method applied to
the first system generates a Krylov subspace, then for the following systems, a modified conjugate gradient is applied using
orthogonal projections on this subspace to compute an initial guess and modified descent directions leading to a better convergence.
The scattering problem is treated via an Exact Controllability formulation and a preconditioned conjugate gradient algorithm
is introduced. The set of linear systems to be solved are associated to this preconditioning. The efficiency of the method
is tested on different 3D acoustic problems.
This revised version was published online in August 2006 with corrections to the Cover Date. 相似文献
18.
针对系数矩阵为对称正定Toeplitz矩阵的线性互补问题,本文提出了一类预处理模系矩阵分裂迭代方法.先通过变量替换将线性互补问题转化为一类非线性方程组,然后选取Strang或T.Chan循环矩阵作为预优矩阵,利用共轭梯度法进行求解.我们分析了该方法的收敛性.数值实验表明,该方法是高效可行的. 相似文献