Application of Preconditioned GMRES Algorithm for Analysis of Millimeter Wave Ferrite Sphere Circulators

The generalized minimal residual (GMRES) iterative method is applied to solve such sparse large non-symmetric system of linear equations resulting from the use of edge-based finite element method. In order to speed up the convergence of GMRES, the symmetric successive overrelaxation (SSOR) preconditioning scheme is applied for the analysis of millimeter wave ferrite circulator. Consequently, this preconditioned GMRES (PGMRES) approach can reach convergence ten times faster than GMRES. The reflection and insertion losses of millimeter wave waveguide circulator are compared with those obtained from literature.     

USSOR优于SOR,SSOR的收敛区域

对于SSOR与SOR的渐近收敛速度的比较,有下面的一些结果。 (a)当A为非奇异的M-矩阵,Woznicki[1]证明了,ρ(S_w~A)≤户((?)_w~A)<1,(?)ω∈(0,1)且(?)V=卢(B~A)∈(0,1)。 (b)当A为3—循环不可约的H—矩阵,Neumann[2]证明了,对每个(?):=卢(|B~A|)∈(0,r_3),r_3≈0.418192802是方程17r~3+r~3—r—1=0在区间(0,1)内的唯一正根,则存在ω(A)=2/(1+(?))的一个邻域Ω_(w(a)),满足     

On modified block SSOR iteration methods for linear systems from steady incompressible viscous flow problems

In order to solve the large sparse systems of linear equations arising from numerical solutions of two-dimensional steady incompressible viscous flow problems in primitive variable formulation, we present block SSOR and modified block SSOR iteration methods based on the special structures of the coefficient matrices. In each step of the block SSOR iteration, we employ the block LU factorization to solve the sub-systems of linear equations. We show that the block LU factorization is existent and stable when the coefficient matrices are block diagonally dominant of type-II by columns. Under suitable conditions, we establish convergence theorems for both block SSOR and modified block SSOR iteration methods. In addition, the block SSOR iteration and AF-ADI method are considered as preconditioners for the nonsymmetric systems of linear equations. Numerical experiments show that both block SSOR and modified block SSOR iterations are feasible iterative solvers and they are also effective for preconditioning Krylov subspace methods such as GMRES and BiCGSTAB when used to solve this class of systems of linear equations.     

Convergence of two-stage multisplitting method using AOR or SSOR multisplittings

In this paper, we study the convergence of two-stage multisplitting method using AOR or SSOR multisplittings as inner splittings and an outer splitting for solving a linear system whose coefficient matrix is an H-matrix. We also introduce an application of the two-stage multisplitting method.     

Convergence of SSOR methods for linear complementarity problems

In this paper, by applying the SSOR splitting, we propose two new iterative methods for solving the linear complementarity problem LCP (M,q). Convergence results for these two methods are presented when M is an H-matrix (and also an M-matrix). Finally, two numerical examples are given to show the efficiency of the presented methods.     

SSOR方法误差的上 、下界估计

本文研究求解线性方程组Ax=6的对称逐次超松弛(SSOR)法的误差界。对于一类按红/黑次序排列的对称正定的系数 阵A,我们给出的利用迭代向量之差来估计误差的上、下界,从而,不仅拓广了[2]的结果,而且完善了[1]中的结论。     

Right preconditioned MINRES for singular systems†

We consider solving large sparse symmetric singular linear systems. We first introduce an algorithm for right preconditioned minimum residual (MINRES) and prove that its iterates converge to the preconditioner weighted least squares solution without breakdown for an arbitrary right‐hand‐side vector and an arbitrary initial vector even if the linear system is singular and inconsistent. For the special case when the system is consistent, we prove that the iterates converge to a min‐norm solution with respect to the preconditioner if the initial vector is in the range space of the right preconditioned coefficient matrix. Furthermore, we propose a right preconditioned MINRES using symmetric successive over‐relaxation (SSOR) with Eisenstat's trick. Some numerical experiments on semidefinite systems in electromagnetic analysis and so forth indicate that the method is efficient and robust. Finally, we show that the residual norm can be further reduced by restarting the iterations.     

Application of Preconditioned GMRES Algorithm for Analysis of Millimeter Wave Ferrite Sphere Circulators

The generalized minimal residual (GMRES) iterative method is applied to solve such sparse large non-symmetric system of linear equations resulting from the use of edge-based finite element method. In order to speed up the convergence of GMRES, the symmetric successive overrelaxation (SSOR) preconditioning scheme is applied for the analysis of millimeter wave ferrite circulator. Consequently, this preconditioned GMRES (PGMRES) approach can reach convergence 19 times faster than GMRES. The isolation and insertion losses of millimeter wave waveguide circulator are compared with those obtained from literature.     

A class of modified block SSOR preconditioners for symmetric positive definite systems of linear equations

A class of modified block SSOR preconditioners is presented for solving symmetric positive definite systems of linear equations, which arise in the hierarchical basis finite element discretizations of the second order self‐adjoint elliptic boundary value problems. This class of methods is strongly related to two level methods, standard multigrid methods, and Jacobi‐like hierarchical basis methods. The optimal relaxation factors and optimal condition numbers are estimated in detail. Theoretical analyses show that these methods are very robust, and especially well suited to difficult problems with rough solutions, discretized using highly nonuniform, adaptively refined meshes. This revised version was published online in June 2006 with corrections to the Cover Date.     

An ILU preconditioner with coupled node fill-in for iterative solution of the mixed finite element formulation of the 2D and 3D Navier-Stokes equations

In the present paper, preconditioning of iterative equation solvers for the Navier-Stokes equations is investigated. The Navier-Stokes equations are solved for the mixed finite element formulation. The linear equation solvers used are the orthomin and the Bi-CGSTAB algorithms. The storage structure of the equation matrix is given special attention in order to avoid swapping and thereby increase the speed of the preconditioner. The preconditioners considered are Jacobian, SSOR and incomplete LU preconditioning of the matrix associated with the velocities. A new incomplete LU preconditioning with fill-in for the pressure matrix at locations in the matrix where the corner nodes are coupled is designed. For all preconditioners, inner iterations are investigated for possible improvement of the preconditioning. Numerical experiments are executed both in two and three dimensions.