A fast Petrov–Galerkin method for solving the generalized airfoil equation

In this paper we develop a fast Petrov–Galerkin method for solving the generalized airfoil equation using the Chebyshev polynomials. The conventional method for solving this equation leads to a linear system with a dense coefficient matrix. When the order of the linear system is large, the computational complexity for solving the corresponding linear system is huge. For this we propose the matrix truncation strategy, which compresses the dense coefficient matrix into a sparse matrix. We prove that the truncated method preserves the optimal order of the approximate solution for the conventional method. Moreover, we solve the truncated equation using the multilevel augmentation method. The computational complexity for solving this truncated linear system is estimated to be linear up to a logarithmic factor.     

离散空间分数阶非线性薛定谔方程的MHSS型迭代方法

利用隐式守恒型差分格式来离散空间分数阶非线性薛定谔方程,可得到一个离散线性方程组.该离散线性方程组的系数矩阵为一个纯虚数复标量矩阵、一个对角矩阵与一个对称Toeplitz矩阵之和.基于此,本文提出了用一种\textit{修正的埃尔米特和反埃尔米特分裂}(MHSS)型迭代方法来求解此离散线性方程组.理论分析表明,MHSS型迭代方法是无条件收敛的.数值实验也说明了该方法是可行且有效的.     

解浅水方程离散化线性方程组的PEk方法

定义于球面的浅水方程能够很好地描述浅齐次的不可压缩非黏滞流体层的性状,它在全球大气模型、海洋数字模型和天气预报的数值计算中都有广泛的应用,浅水方程的一般形式如下：     

A class of two‐stage iterative methods for systems of weakly nonlinear equations

The discretizations of many differential equations by the finite difference or the finite element methods can often result in a class of system of weakly nonlinear equations. In this paper, by applying the two-tage iteration technique and in accordance with the special properties of this weakly nonlinear system, we first propose a general two-tage iterative method through the two-tage splitting of the system matrix. Then, by applying the accelerated overrelaxation (AOR) technique of the linear iterative methods, we present a two-tage AOR method, which particularly uses the AOR iteration as the inner iteration and is substantially a relaxed variant of the afore-presented method. For these two classes of methods, we establish their local convergence theories, and precisely estimate their asymptotic convergence factors under some suitable assumptions when the involved nonlinear mapping is only B-differentiable. When the system matrix is either a monotone matrix or an H-matrix, and the nonlinear mapping is a P-bounded mapping, we thoroughly set up the global convergence theories of these new methods. Moreover, under the assumptions that the system matrix is monotone and the nonlinear mapping is isotone, we discuss the monotone convergence properties of the new two-tage iteration methods, and investigate the influence of the matrix splittings as well as the relaxation parameters on the convergence behaviours of these methods. Numerical computations show that our new methods are feasible and efficient for solving the system of weakly nonlinear equations. This revised version was published online in June 2006 with corrections to the Cover Date.     

解一类对称不定线性方程组的奇异方向法

此处B为n×n对称正定矩阵,G是秩为m的n×m矩阵.这是在最优化问题和混合有限元法中大量出现的一类方程组,因此,它的求解问题引起人们的注意. 求解对称不定线性方程组问题已有较多讨论,但针对(2)中A的特殊性构造的算法尚     

一类H矩阵线性互补问题的预处理二步模基矩阵分裂迭代方法

本文我们利用预处理技术推广了求解线性互补问题的二步模基矩阵分裂迭代法,并针对H-矩阵类给出了新方法的收敛性分析,得到的理论结果推广了已有的一些方法.     

ON THE ACCURACY OF THE LEAST SQUARES AND THE TOTAL LEAST SQUARES METHODS

Consider solving an overdetermined system of linear algebraic equations by both the least squares method (LS) and the total least squares method (TLS). Extensive published computational evidence shows that when the original system is consistent. one often obtains more accurate solutions by using the TLS method rather than the LS method. These numerical observations contrast with existing analytic perturbation theories for the LS and TLS methods which show that the upper bounds for the LS solution are always smaller than the corresponding upper bounds for the TLS solutions. In this paper we derive a new upper bound for the TLS solution and indicate when the TLS method can be more accurate than the LS method.Many applied problems in signal processing lead to overdetermined systems of linear equations where the matrix and right hand side are determined by the experimental observations (usually in the form of a lime series). It often happens that as the number of columns of the matrix becomes larger, the ra     

一类矩阵的AOR迭代收敛性分析及其与SOR迭代的比较

1 引言 许多实际问题最后常归结为解一个或一些矩阵的线性代数方程组Ax=b （1.1）这里讨论A为（1,1）相容次序矩阵的情形。     

Parallel multisplitting two-stage iterative methods for large sparse systems of weakly nonlinear equations

The finite difference or the finite element discretizations of many differential or integral equations often result in a class of systems of weakly nonlinear equations. In this paper, by reasonably applying both the multisplitting and the two-stage iteration techniques, and in accordance with the special properties of this system of weakly nonlinear equations, we first propose a general multisplitting two-stage iteration method through the two-stage multiple splittings of the system matrix. Then, by applying the accelerated overrelaxation (AOR) technique of the linear iterative methods, we present a multisplitting two-stage AOR method, which particularly uses the AOR-like iteration as inner iteration and is substantially a relaxed variant of the afore-presented method. These two methods have a forceful parallel computing function and are much more suitable to the high-speed multiprocessor systems. For these two classes of methods, we establish their local convergence theories, and precisely estimate their asymptotic convergence factors under some suitable assumptions when the involved nonlinear mapping is only directionally differentiable. When the system matrix is either an H-matrix or a monotone matrix, and the nonlinear mapping is a P-bounded mapping, we thoroughly set up the global convergence theories of these new methods. Moreover, under the assumptions that the system matrix is monotone and the nonlinear mapping is isotone, we discuss the monotone convergence properties of the new multisplitting two-stage iteration methods, and investigate the influence of the multiple splittings as well as the relaxation parameters upon the convergence behaviours of these methods. Numerical computations show that our new methods are feasible and efficient for parallel solving of the system of weakly nonlinear equations. This revised version was published online in August 2006 with corrections to the Cover Date.     

On the parallel GSAOR method for block diagonally dominant matrices

In this paper we consider the parallel generalized SAOR iterative method based on the generalized AOR iterative method presented by James for solving large nonsingular system. We obtain some convergence theorems for the case when coefficient matrix is a block diagonally dominant matrix or a generalized block diagonal dominant matrix. A numerical example is given to illustrate to our results.     

矩阵形式二次修正Maxwell-Dirac系统的多尺度算法

带二次修正项的Dirac方程在拓扑绝缘体、石墨烯、超导等新材料电磁光特性分析中有着十分广泛的应用.本文工作的创新点有：一是首次提出了矩阵形式带有二次修正项的Dirac方程,它是比较一般的数学框架,涵盖了上述材料体系很多重要的物理模型,具体见附录A;二是针对上述材料体系的电磁响应问题,提出了有界区域Weyl规范下具有周期间断系数矩阵形式带二次修正项Maxwell-Dirac系统的多尺度渐近方法,结合Crank-Nicolson有限差分方法和自适应棱单元方法,发展了一类多尺度算法.数值试验结果验证了多尺度渐近方法的正确性和算法的有效性.     

Multisplitting preconditioners for a symmetric positive definite matrix

We study convergence of multisplitting method associated with a block diagonal conformable multisplitting for solving a linear system whose coefficient matrix is a symmetric positive definite matrix which is not an H-matrix. Next, we study the validity ofm-step multisplitting polynomial preconditioners which will be used in the preconditioned conjugate gradient method.     

Computational method based on Bernstein operational matrices for nonlinear Volterra-Fredholm-Hammerstein integral equations

In this paper, we present a method to solve nonlinear Volterra-Fredholm-Hammerstein integral equations in terms of Bernstein polynomials. Properties of these polynomials and operational matrix of integration together with the product operational matrix are first presented. These properties are then utilized to transform the integral equation to a matrix equation which corresponds to a system of nonlinear algebraic equations with unknown Bernstein coefficients. The method is computationally very simple and attractive and numerical examples illustrate the efficiency and accuracy of the method.     

The construction of an algebraically reduced system for the acceleration of preconditioned conjugate gradients

In this paper we show how an algebraically reduced system can be constructed, for which the preconditioned conjugate gradient method converges faster than for the original system. For this method it is necessary that the original matrix is symmetric positive-definite. Our approach is based on an efficient projection on a well-chosen subspace and we show an application in which a cyclically reduced system is one step further reduced by this novel technique.     

一种信息系统划分间的矩阵方法

本语文针对信息系统划分提出了一个新的属性归类的矩阵方法，使得繁琐的Ｕ／Ｃ阵分析统一在一种形式之一 属度概念构造了属性分类转换矩阵，通过转换矩阵直接得到各种划分结果并且给出了两种不同划分间的转换方法。     

Two-step modulus-based matrix splitting iteration method for linear complementarity problems

Bai has recently presented a modulus-based matrix splitting iteration method, which is a powerful alternative for solving the large sparse linear complementarity problems. In this paper, we further present a two-step modulus-based matrix splitting iteration method, which consists of a forward and a backward sweep. Its convergence theory is proved when the system matrix is an H ₊-matrix. Moreover, for the two-step modulus-based relaxation iteration methods, more exact convergence domains are obtained without restriction on the Jacobi matrix associated with the system matrix, which improve the existing convergence theory. Numerical results show that the two-step modulus-based relaxation iteration methods are superior to the modulus-based relaxation iteration methods for solving the large sparse linear complementarity problems.     

On approximated ILU and UGS preconditioning methods for linearized discretized steady incompressible Navier-Stokes equations

When the artificial compressibility method in conjunction with high-order upwind compact finite difference schemes is employed to discretize the steady-state incompressible Navier-Stokes equations, in each pseudo-time step we need to solve a structured system of linear equations approximately by, for example, a Krylov subspace method such as the preconditioned GMRES. In this paper, based on the special structure and concrete property of the linear system we construct a structured preconditioner for its coefficient matrix and estimate eigenvalue bounds of the correspondingly preconditioned matrix. Numerical examples are given to illustrate the effectiveness of the proposed preconditioning methods.     

基模生成集分析的矩阵算法及在人力资源管理中的应用

针对学习型组织理论的系统思考的基模分析技术,提出一个确定复杂系统的基模生成集和对新管理措施进行反馈绩效分析的矩阵算法.此算法是将系统动力学的流率基本入树模型转化为对角置零枝向量矩阵,将枝向量矩阵分解,再作矩阵乘法.然后,用一个管理案例说明了该算法的实际价值,即运用此方法,对中国企业现阶段普遍实行的绩效等级薪酬人力资源管理方法进行研究,揭示了在人力资源管理中引入绩效等级薪酬激励机制后产生的增长上限系统结构,证明了此管理对内部员工和吸引外系统员工流入具有很好的激励作用,同时证明此管理机制增加了组织成本,产生对组织绩效的制约作用,从而揭示出企业人力资源绩效管理中的增长上限系统结构.     

Modified Newton’s method for systems of nonlinear equations with singular Jacobian

It is well known that Newton’s method for a nonlinear system has quadratic convergence when the Jacobian is a nonsingular matrix in a neighborhood of the solution. Here we present a modification of this method for nonlinear systems whose Jacobian matrix is singular. We prove, under certain conditions, that this modified Newton’s method has quadratic convergence. Moreover, different numerical tests confirm the theoretical results and allow us to compare this variant with the classical Newton’s method.     

Direct solution method for the equilibrium problem for elastic stents

We are interested in numerical methods for approximating vector‐valued functions on a metric graph. As a model problem, we formulate and analyze a numerical method for the solution of the stationary problem for the one‐dimensional elastic stent model. The approximation is built using the mixed finite element method. The discretization matrix is a symmetric saddle‐point matrix, and we discuss sparse direct methods for the fast and robust solution of the associated equilibrium system. The convergence of the numerical method is proven and the error estimate is obtained. Numerical examples confirm the theoretical estimates.