Z-矩阵的预条件方法

通过对方程组Ax=b的系数矩阵施行初等行变换，该文提出了解线性方程组Ax=b的一种新的预条件Gauss Seidel迭代方法，理论上证明了新的预条件Gauss Seidel迭代方法较经典的Gauss Seidel迭代法收敛速度快. 该文提出的新预条件方法推广了文［1-2］中提出的预条件方法，具体的数值例子说明了新预条件方法的有效性.     

一类预条件AOR迭代法的比较定理(英文)

本文研究了当线性方程组的系数矩阵是严格对角占优L-矩阵时带有预条件子P1→kα的预条件AOR迭代方法.利用矩阵分裂的相关理论,获得了预条件AOR迭代法的收敛性结论以及参数α和k对收敛速度影响的比较定理.结果表明当α和k取值较大时这类预条件方法更加有效.文中的结论推广了Li等人关于预条件Gauss-Seidel迭代法的相关结论.最后,用数值例子进一步验证了这些结果.     

关于Toeplitz+Hankel线性方程组的迭代解法

本文研究Toeplitz+Hankel线性方程组的预处理迭代解法.我们提出了几个新的预条件子,并分析了预处理矩阵的谱性质,当生成函数在Wiener类中时,预处理矩阵的特征值聚集在1附近.数值实验表明该预处理子比文[5]中的预处理子更有效.     

连续Sylvester矩阵方程求解的分裂迭代算法

有效求解连续的Sylvester矩阵方程对于科学和工程计算有着重要的应用价值,因此该文提出了一种可行的分裂迭代算法.该算法的核心思想是外迭代将连续Sylvester矩阵方程的系数矩阵分裂为对称矩阵和反对称矩阵,内迭代求解复对称矩阵方程.相较于传统的分裂算法,该文所提出的分裂迭代算法有效地避免了最优迭代参数的选取,并利用了复对称方程组高效求解的特点,进而提高了算法的易实现性、易操作性.此外,从理论层面进一步证明了该分裂迭代算法的收敛性.最后,通过数值算例表明分裂迭代算法具有良好的收敛性和鲁棒性,同时也证实了分裂迭代算法的收敛性很大程度依赖于内迭代格式的选取.     

一类预条件AOR迭代法的收敛性分析

本文研究了线性方程组Ax=b的预条件迭代法.利用新的待定参数加速预条件子的方法,获得了一种带参数的新预条件迭代法,并对参数的选择给出必要条件,证明了对于非奇异不可约M-矩阵,新预条件方法收敛且可以加速AOR迭代法的收敛速度,数值例子表明新预条件方法是有效的,推广了已有文献中的有关结果.     

H-矩阵线性方程组的一类预条件并行多分裂SOR迭代法

基于并行多分裂算法的思想及SOR迭代格式, 本文提出一种求解H-矩阵线性方程组新的并行多分裂SOR迭代法, 新方法某种程度上避免了SOR迭代法中选取最优参数的困难. 同时, 选取Kohno等(1997)提出的预条件子$P=I+S_{\alpha}$对原始线性方程组进行预处理, 进而给出了一种实用的预条件并行多分裂SOR迭代法. 理论分析和数值实验均表明, 新算法是实用而有效的.     

求解2×2块对称不定线性方程组迭代法的收敛性分析(英文)

本文研究求解系数矩阵为2×2块对称不定矩阵时的线性方程组,提出了一种新的分裂迭代法,并通过研究迭代矩阵的谱半径,详细讨论了新方法的收敛性.最后,我们也讨论了预条件矩阵特征根的几条性质.     

求解增广线性系统的局部多分裂迭代法

为了在高性能计算机上求解增广线性系统,基于并行多分裂的两种技巧,本文提出一种局部多分裂迭代格式,给出当增广线性系统的矩阵为M-矩阵和H-矩阵时新方法的收敛性理论.并讨论预条件矩阵的特征值情形.     

修正无阻尼结构系统的一种有效迭代法

结构动力学模型修正就是使得分析结果与实验结果的差最小化的一种程序.该文给出了一种基于不完全测量模态数据同时修正质量矩阵与刚度矩阵的迭代方法.通过此方法,在不计舍入误差的情况下,通过选取特殊的初始矩阵对,经有限步迭代,可得到满足特征方程的最优近似质量矩阵与刚度矩阵,并且保持了初始模型的高阶未测量且未知的特征信息.两个数值例子验证了该文给出的迭代算法是有效的.     

速度追踪问题中鞍点系统的新分裂迭代

 有限元离散一类速度追踪问题后得到具有鞍点结构的线性系统,针对该鞍点系统,本文提出了一种新的分裂迭代技术.证明了新的分裂迭代方法的无条件收敛性,详细分析了新的分裂预条件子对应的预处理矩阵的谱性质.数值结果验证了对于大范围的网格参数和正则参数,新的分裂预条件子在求解有限元离散速度追踪问题得到的鞍点系统时的可行性和有效性.     

求解加权线性最小二乘问题的一类预处理GAOR方法

为了快速求解一类来自加权线性最小二乘问题的2×2块线性系统,本文提出一类新的预处理子用以加速GAOR方法,也就是新的预处理GAOR方法.得到了一些比较结果,这些结果表明当GAOR方法收敛时,新方法比原GAOR方法和之前的一些预处理GAOR方法有更好的收敛性.而且,数值算例也验证了新预处理子的有效性．     

求解带Toeplitz矩阵的线性互补问题的一类预处理模系矩阵分裂迭代法

针对系数矩阵为对称正定Toeplitz矩阵的线性互补问题,本文提出了一类预处理模系矩阵分裂迭代方法.先通过变量替换将线性互补问题转化为一类非线性方程组,然后选取Strang或T.Chan循环矩阵作为预优矩阵,利用共轭梯度法进行求解.我们分析了该方法的收敛性.数值实验表明,该方法是高效可行的.     

Some new error bounds for linear complementarity problems of H-matrices

Some new error bounds for linear complementarity problems of H-matrices are presented based on the preconditioned technique. Numerical examples show that these bounds are better than some existing ones.     

A modified positive-definite and skew-Hermitian splitting preconditioner for generalized saddle point problems from the Navier-Stokes equation

In this paper, we extend the relaxed positive-definite and skew-Hermitian splitting preconditioner (RPSS) for generalized saddle-point problems in [J.-L. Zhang, C.-Q. Gu and K. Zhang, Appl. Math. Comput. 249(2014)468-479] by introducing an additional parameter. The spectral properties of the presented new preconditioned matrix for generalized saddle-point problem are investigated, meanwhile, the infinite termination merit of the iterative step is also discussed if the Krylov subspace method preconditioned by the modified positive-definite and skew-Hermitian splitting preconditioner (MPSS) is applied. Some numerical experiments illustrate that the efficiency of the proposed new preconditioner.     

New preconditioned AOR iterative method for Z-matrices

In this paper, we present a new preconditioned AOR-type iterative method for solving the linear system Ax=b, where A is a Z-matrix, and prove its convergence. Then we give some comparison theorems to show that the rate of convergence of the preconditioned AOR-type iterative method is faster than the rate of convergence of the AOR-type iterative method. Finally, we give two numerical examples to illustrate our results.     

A new relaxed HSS preconditioner for saddle point problems

We present a preconditioner for saddle point problems. The proposed preconditioner is extracted from a stationary iterative method which is convergent under a mild condition. Some properties of the preconditioner as well as the eigenvalues distribution of the preconditioned matrix are presented. The preconditioned system is solved by a Krylov subspace method like restarted GMRES. Finally, some numerical experiments on test problems arisen from finite element discretization of the Stokes problem are given to show the effectiveness of the preconditioner.     

A survey of some estimates of eigenvalues and condition numbers for certain preconditioned matrices

Eigenvalue and condition number estimates for preconditioned iteration matrices provide the information required to estimate the rate of convergence of iterative methods, such as preconditioned conjugate gradient methods. In recent years various estimates have been derived for (perturbed) modified (block) incomplete factorizations. We survey and extend some of these and derive new estimates. In particular we derive upper and lower estimates of individual eigenvalues and of condition number. This includes a discussion that the condition number of preconditioned second order elliptic difference matrices is O(h⁻¹). Some of the methods are applied to compute certain parameters involved in the computation of the preconditioner.     

关于“求解加权线性最小二乘问题的一类预处理GAOR方法”一文的注记

在"求解加权线性最小二乘问题的一类预处理GAOR方法"一文中,作者提出了求解加权线性最小二乘问题等价$2\times 2$块线性系统的一类预处理GAOR方法,并给出了几个比较定理来说明新提出预处理GAOR方法的优越性.本文我们将指出该文中几个比较定理的不完善之处和证明的错误之处,并给出正确的证明.     

Treatment of the composite fabric’s shaping using a Lagrangian formulation

In this paper, we are interested in the simulation of prepreg composite deformation by deep-drawing and laying-up. It uses new bi-component finite elements made of woven material in which the nodal interior loads are deduced from fibre tensile strain energy and not polymerized resin membrane energy. Specific treatment is used to analyze the frictional-contact problem between the deformable prepreg composite and the steel rigid tools. The frictional-contact method is based on the Lagrangian formulation and the preconditioned conjugate gradient method. Some numerical tests are given to investigate the performance of the numerical strategies.     

Preconditioned Barzilai-Borwein method for the numerical solution of partial differential equations

The preconditioned Barzilai-Borwein method is derived and applied to the numerical solution of large, sparse, symmetric and positive definite linear systems that arise in the discretization of partial differential equations. A set of well-known preconditioning techniques are combined with this new method to take advantage of the special features of the Barzilai-Borwein method. Numerical results on some elliptic test problems are presented. These results indicate that the preconditioned Barzilai-Borwein method is competitive and sometimes preferable to the preconditioned conjugate gradient method.This author was partially supported by the Parallel and Distributed Computing Center at UCV.This author was partially supported by BID-CONICIT, project M-51940.