Bai, Golub and Pan presented a preconditioned Hermitian and skew-Hermitian splitting(PHSS) method [Numerische Mathematik, 2004, 32: 1-32] for non-Hermitian positive semidefinite linear systems. We improve the method t...Bai, Golub and Pan presented a preconditioned Hermitian and skew-Hermitian splitting(PHSS) method [Numerische Mathematik, 2004, 32: 1-32] for non-Hermitian positive semidefinite linear systems. We improve the method to solve saddle point systems whose(1,1) block is a symmetric positive definite M-matrix with a new choice of the preconditioner and compare it with other preconditioners. The results show that the new preconditioner outperforms the previous ones.展开更多
Recently, some authors (Li, Yang and Wu, 2014) studied the parameterized preconditioned HSS (PPHSS) method for solving saddle point problems. In this short note, we further discuss the PPHSS method for solving singula...Recently, some authors (Li, Yang and Wu, 2014) studied the parameterized preconditioned HSS (PPHSS) method for solving saddle point problems. In this short note, we further discuss the PPHSS method for solving singular saddle point problems. We prove the semi-convergence of the PPHSS method under some conditions. Numerical experiments are given to illustrate the efficiency of the method with appropriate parameters.展开更多
Golub等研究了一种带辅助预条件参数矩阵的SOR-like方法来解鞍点问题(Golub G H,Wu X,Yuan J Y.SOR-like methods for augmented systems.BIT,2001,41(1):71—85).我们用一种新的辅助预条件取法来加速该方法去解(1,1)块是对称正定M矩阵...Golub等研究了一种带辅助预条件参数矩阵的SOR-like方法来解鞍点问题(Golub G H,Wu X,Yuan J Y.SOR-like methods for augmented systems.BIT,2001,41(1):71—85).我们用一种新的辅助预条件取法来加速该方法去解(1,1)块是对称正定M矩阵的鞍点系统,数值结果显示优于Golub等提出的预条件.展开更多
Iterative methods for solving discrete optimal control problems are constructed and investigated. These discrete problems arise when approximating by finite difference method or by finite element method the optimal co...Iterative methods for solving discrete optimal control problems are constructed and investigated. These discrete problems arise when approximating by finite difference method or by finite element method the optimal control problems which contain a linear elliptic boundary value problem as a state equation, control in the righthand side of the equation or in the boundary conditions, and point-wise constraints for both state and control functions. The convergence of the constructed iterative methods is proved, the implementation problems are discussed, and the numerical comparison of the methods is executed.展开更多
In this paper, a least-squares mixed finite element method for the solution of the primal saddle-point problem is developed. It is proved that the approximate problem is consistent ellipticity in the conforming finite...In this paper, a least-squares mixed finite element method for the solution of the primal saddle-point problem is developed. It is proved that the approximate problem is consistent ellipticity in the conforming finite element spaces with only the discrete BB-condition needed for a smaller auxiliary problem. The abstract error estimate is derived. [ABSTRACT FROM AUTHOR]展开更多
The preconditioner for parameterized inexact Uzawa methods have been used to solve some indefinite saddle point problems. Firstly, we modify the preconditioner by making it more generalized, then we use theoretical an...The preconditioner for parameterized inexact Uzawa methods have been used to solve some indefinite saddle point problems. Firstly, we modify the preconditioner by making it more generalized, then we use theoretical analyses to show that the iteration method converges under certain conditions. Moreover, we discuss the optimal parameter and matrices based on these conditions. Finally, we propose two improved methods. Numerical experiments are provided to show the effectiveness of the modified preconditioner. All methods have fantastic convergence rates by choosing the optimal parameter and matrices.展开更多
For large and sparse saddle point problems, Zhu studied a class of generalized local Hermitian and skew-Hermitian splitting iteration methods for non-Hermitian saddle point problem [M.-Z. Zhu, Appl. Math. Comput. 218 ...For large and sparse saddle point problems, Zhu studied a class of generalized local Hermitian and skew-Hermitian splitting iteration methods for non-Hermitian saddle point problem [M.-Z. Zhu, Appl. Math. Comput. 218 （2012） 8816-8824 ]. In this paper, we further investigate the generalized local Hermitian and skew-Hermitian splitting （GLHSS） iteration methods for solving non-Hermitian generalized saddle point problems. With different choices of the parameter matrices, we derive conditions for guaranteeing the con- vergence of these iterative methods. Numerical experiments are presented to illustrate the effectiveness of our GLHSS iteration methods as well as the preconditioners.展开更多
3×3块鞍点问题作为一类特殊的线性方程组,其迭代方法的研究极具挑战性。基于经典的广义逐次超松弛(Generalized Successive Over Relaxation,GSOR)方法,针对3×3块大型稀疏鞍点问题,提出了三参数的中心预处理GSOR方法并讨论了...3×3块鞍点问题作为一类特殊的线性方程组,其迭代方法的研究极具挑战性。基于经典的广义逐次超松弛(Generalized Successive Over Relaxation,GSOR)方法,针对3×3块大型稀疏鞍点问题,提出了三参数的中心预处理GSOR方法并讨论了其收敛性。同时,通过数值实验验证了新方法在计算花费方面优于中心预处理的Uzawa-Low方法。进一步地,还将新方法拓展到i×i块鞍点问题,提出了相应的GSOR类迭代框架,通过数值实验和数据分析,给出了选择较优i的初步建议。展开更多
A modified mixed/hybrid finite element method, which is no longer required to satisfy the Babuska-Brezzi condition, is referred to as a stabilized method Based on the duality of vanational principles in solid mechanic...A modified mixed/hybrid finite element method, which is no longer required to satisfy the Babuska-Brezzi condition, is referred to as a stabilized method Based on the duality of vanational principles in solid mechanics, a new type of stabilized method, called the combinatorially stabilized mixed/hybrid finite element method, is presented by weight-averaging both the primal and the dual "saddle-point" schemes. Through a general analysis of stability and convergence under an abstract framework, it is shown that for the methods only an inf-sup inequality much weaker than Babuska-Brezzi condition needs to be satisfied. As a concrete application, it is concluded that the combinatorially stabilized Raviart and Thomas mixed methods permit the C -elements to replace the H(div; Ω)-elements.展开更多
In this paper, a relaxed Hermitian and skew-Hermitian splitting （RHSS） preconditioner is proposed for saddle point problems from the element-free Galerkin （EFG） discretization method. The EFG method is one of the ...In this paper, a relaxed Hermitian and skew-Hermitian splitting （RHSS） preconditioner is proposed for saddle point problems from the element-free Galerkin （EFG） discretization method. The EFG method is one of the most widely used meshfree methods for solving partial differential equations. The RHSS preconditioner is constructed much closer to the coefficient matrix than the well-known HSS preconditioner, resulting in a RHSS fixed-point iteration. Convergence of the RHSS iteration is analyzed and an optimal parameter, which minimizes the spectral radius of the iteration matrix is described. Using the RHSS pre- conditioner to accelerate the convergence of some Krylov subspace methods （like GMRES） is also studied. Theoretical analyses show that the eigenvalues of the RHSS precondi- tioned matrix are real and located in a positive interval. Eigenvector distribution and an upper bound of the degree of the minimal polynomial of the preconditioned matrix are obtained. A practical parameter is suggested in implementing the RHSS preconditioner. Finally, some numerical experiments are illustrated to show the effectiveness of the new preconditioner.展开更多
We establish a class of improved relaxed positive-definite and skew-Hermitian splitting (IRPSS)preconditioners for saddle point problems.These preconditioners are easier to be implemented than the relaxed positive-def...We establish a class of improved relaxed positive-definite and skew-Hermitian splitting (IRPSS)preconditioners for saddle point problems.These preconditioners are easier to be implemented than the relaxed positive-definite and skew-Hermitian splitting (RPSS) preconditioner at each step for solving the saddle point problem.We study spectral properties and the minimal polynomial of the IRPSS preconditioned saddle point matrix.A theoretical optimal IRPSS preconditioner is also obtained,Numerical results show that our proposed IRPSS preconditioners are convergence rate of the GMRES method superior to the existing ones in accelerating the for solving saddle point problems.展开更多
Based on the special positive semidefinite splittings of the saddle point matrix, we propose a new Mternating positive semidefinite splitting （APSS） iteration method for the saddle point problem arising from the fin...Based on the special positive semidefinite splittings of the saddle point matrix, we propose a new Mternating positive semidefinite splitting （APSS） iteration method for the saddle point problem arising from the finite element discretization of the hybrid formulation of the time-harmonic eddy current problem. We prove that the new APSS iteration method is unconditionally convergent for both cases of the simple topology and the general topology. The new APSS matrix can be used as a preconditioner to accelerate the convergence rate of Krylov subspace methods. Numerical results show that the new APSS preconditioner is superior to the existing preconditioners.展开更多
We consider a linear-quadratical optimal control problem of a system governed by parabolic equation with distributed in right-hand side control and control and state constraints. We construct a mesh approximation of t...We consider a linear-quadratical optimal control problem of a system governed by parabolic equation with distributed in right-hand side control and control and state constraints. We construct a mesh approximation of this problem using different two-level approximations of the state equation, ADI and fractional steps approximations in time among others. Iterative solution methods are investigated for all constructed approximations of the optimal control problem. Their implementation can be carried out in parallel manner.展开更多
Recently,some authors(Shen and Shi,2016)studied the generalized shiftsplitting(GSS)iteration method for singular saddle point problem with nonsymmetric positive definite(1,1)-block and symmetric positive semidefinite(...Recently,some authors(Shen and Shi,2016)studied the generalized shiftsplitting(GSS)iteration method for singular saddle point problem with nonsymmetric positive definite(1,1)-block and symmetric positive semidefinite(2,2)-block.In this paper,we further apply the GSS iteration method to solve singular saddle point problem with nonsymmetric positive semidefinite(1,1)-block and symmetric positive semidefinite(2,2)-block,prove the semi-convergence of the GSS iteration method and analyze the spectral properties of the corresponding preconditioned matrix.Numerical experiment is given to indicate that the GSS iteration method with appropriate iteration parameters is effective and competitive for practical use.展开更多
基金Supported by the National Natural Science Foundation of China(11301330)Supported by the Shanghai College Teachers Visiting Abroad for Advanced Study Program(B.60-A101-12-010)Supported by the First-class Discipline of Universities in Shanghai
文摘Bai, Golub and Pan presented a preconditioned Hermitian and skew-Hermitian splitting(PHSS) method [Numerische Mathematik, 2004, 32: 1-32] for non-Hermitian positive semidefinite linear systems. We improve the method to solve saddle point systems whose(1,1) block is a symmetric positive definite M-matrix with a new choice of the preconditioner and compare it with other preconditioners. The results show that the new preconditioner outperforms the previous ones.
文摘Recently, some authors (Li, Yang and Wu, 2014) studied the parameterized preconditioned HSS (PPHSS) method for solving saddle point problems. In this short note, we further discuss the PPHSS method for solving singular saddle point problems. We prove the semi-convergence of the PPHSS method under some conditions. Numerical experiments are given to illustrate the efficiency of the method with appropriate parameters.
基金supported by the National Natural Science Foundation of China(11301330)the Shanghai College Teachers Visiting Abroad for Advanced Study Program(B.60-A101-12-010)a Grant of"The First-Class Discipline of Universities in Shanghai"
文摘Golub等研究了一种带辅助预条件参数矩阵的SOR-like方法来解鞍点问题(Golub G H,Wu X,Yuan J Y.SOR-like methods for augmented systems.BIT,2001,41(1):71—85).我们用一种新的辅助预条件取法来加速该方法去解(1,1)块是对称正定M矩阵的鞍点系统,数值结果显示优于Golub等提出的预条件.
文摘Iterative methods for solving discrete optimal control problems are constructed and investigated. These discrete problems arise when approximating by finite difference method or by finite element method the optimal control problems which contain a linear elliptic boundary value problem as a state equation, control in the righthand side of the equation or in the boundary conditions, and point-wise constraints for both state and control functions. The convergence of the constructed iterative methods is proved, the implementation problems are discussed, and the numerical comparison of the methods is executed.
文摘In this paper, a least-squares mixed finite element method for the solution of the primal saddle-point problem is developed. It is proved that the approximate problem is consistent ellipticity in the conforming finite element spaces with only the discrete BB-condition needed for a smaller auxiliary problem. The abstract error estimate is derived. [ABSTRACT FROM AUTHOR]
文摘The preconditioner for parameterized inexact Uzawa methods have been used to solve some indefinite saddle point problems. Firstly, we modify the preconditioner by making it more generalized, then we use theoretical analyses to show that the iteration method converges under certain conditions. Moreover, we discuss the optimal parameter and matrices based on these conditions. Finally, we propose two improved methods. Numerical experiments are provided to show the effectiveness of the modified preconditioner. All methods have fantastic convergence rates by choosing the optimal parameter and matrices.
基金We would like to express our sincere gratitude to the anonymous referees whose constructive comments have the presentation of this paper greatly improved. The work was supported by the National Natural Science Foundation （No.11171371 and No.11101195）.
文摘For large and sparse saddle point problems, Zhu studied a class of generalized local Hermitian and skew-Hermitian splitting iteration methods for non-Hermitian saddle point problem [M.-Z. Zhu, Appl. Math. Comput. 218 （2012） 8816-8824 ]. In this paper, we further investigate the generalized local Hermitian and skew-Hermitian splitting （GLHSS） iteration methods for solving non-Hermitian generalized saddle point problems. With different choices of the parameter matrices, we derive conditions for guaranteeing the con- vergence of these iterative methods. Numerical experiments are presented to illustrate the effectiveness of our GLHSS iteration methods as well as the preconditioners.
文摘3×3块鞍点问题作为一类特殊的线性方程组,其迭代方法的研究极具挑战性。基于经典的广义逐次超松弛(Generalized Successive Over Relaxation,GSOR)方法,针对3×3块大型稀疏鞍点问题,提出了三参数的中心预处理GSOR方法并讨论了其收敛性。同时,通过数值实验验证了新方法在计算花费方面优于中心预处理的Uzawa-Low方法。进一步地,还将新方法拓展到i×i块鞍点问题,提出了相应的GSOR类迭代框架,通过数值实验和数据分析,给出了选择较优i的初步建议。
文摘A modified mixed/hybrid finite element method, which is no longer required to satisfy the Babuska-Brezzi condition, is referred to as a stabilized method Based on the duality of vanational principles in solid mechanics, a new type of stabilized method, called the combinatorially stabilized mixed/hybrid finite element method, is presented by weight-averaging both the primal and the dual "saddle-point" schemes. Through a general analysis of stability and convergence under an abstract framework, it is shown that for the methods only an inf-sup inequality much weaker than Babuska-Brezzi condition needs to be satisfied. As a concrete application, it is concluded that the combinatorially stabilized Raviart and Thomas mixed methods permit the C -elements to replace the H(div; Ω)-elements.
基金Acknowledgments. The authors express their thanks to the referees for the comments and constructive suggestions, which were valuable in improving the quality of the manuscript. This work is supported by the National Natural Science Foundation of China（11172192） and the National Natural Science Pre-Research Foundation of Soochow University （SDY2011B01）.
文摘In this paper, a relaxed Hermitian and skew-Hermitian splitting （RHSS） preconditioner is proposed for saddle point problems from the element-free Galerkin （EFG） discretization method. The EFG method is one of the most widely used meshfree methods for solving partial differential equations. The RHSS preconditioner is constructed much closer to the coefficient matrix than the well-known HSS preconditioner, resulting in a RHSS fixed-point iteration. Convergence of the RHSS iteration is analyzed and an optimal parameter, which minimizes the spectral radius of the iteration matrix is described. Using the RHSS pre- conditioner to accelerate the convergence of some Krylov subspace methods （like GMRES） is also studied. Theoretical analyses show that the eigenvalues of the RHSS precondi- tioned matrix are real and located in a positive interval. Eigenvector distribution and an upper bound of the degree of the minimal polynomial of the preconditioned matrix are obtained. A practical parameter is suggested in implementing the RHSS preconditioner. Finally, some numerical experiments are illustrated to show the effectiveness of the new preconditioner.
基金the National Natural Science Foundation of China (Nos.11771225,11301521,11771467,11572210).
文摘We establish a class of improved relaxed positive-definite and skew-Hermitian splitting (IRPSS)preconditioners for saddle point problems.These preconditioners are easier to be implemented than the relaxed positive-definite and skew-Hermitian splitting (RPSS) preconditioner at each step for solving the saddle point problem.We study spectral properties and the minimal polynomial of the IRPSS preconditioned saddle point matrix.A theoretical optimal IRPSS preconditioner is also obtained,Numerical results show that our proposed IRPSS preconditioners are convergence rate of the GMRES method superior to the existing ones in accelerating the for solving saddle point problems.
基金This work was supported by the National Natural Science Foundation of China （Grant Nos. 11301521, 11771467, 11071041）, the Natural Science Foundation of Fujian Province （Nos. 2016J01005, 2015J01578）, and the National Post- doctoral Program for Innovative Talents （No. BX201700234）.
文摘Based on the special positive semidefinite splittings of the saddle point matrix, we propose a new Mternating positive semidefinite splitting （APSS） iteration method for the saddle point problem arising from the finite element discretization of the hybrid formulation of the time-harmonic eddy current problem. We prove that the new APSS iteration method is unconditionally convergent for both cases of the simple topology and the general topology. The new APSS matrix can be used as a preconditioner to accelerate the convergence rate of Krylov subspace methods. Numerical results show that the new APSS preconditioner is superior to the existing preconditioners.
文摘We consider a linear-quadratical optimal control problem of a system governed by parabolic equation with distributed in right-hand side control and control and state constraints. We construct a mesh approximation of this problem using different two-level approximations of the state equation, ADI and fractional steps approximations in time among others. Iterative solution methods are investigated for all constructed approximations of the optimal control problem. Their implementation can be carried out in parallel manner.
基金Supported by Guangxi Science and Technology Department Specific Research Project of Guangxi for Research Bases and Talents(Grant No.GHIKE-AD23023001)Natural Science Foundation of Guangxi Minzu University(Grant No.2021KJQD01)Xiangsi Lake Young Scholars Innovation Team of Guangxi University for Nationalities(Grant No.2021RSCXSHQN05)。
文摘Recently,some authors(Shen and Shi,2016)studied the generalized shiftsplitting(GSS)iteration method for singular saddle point problem with nonsymmetric positive definite(1,1)-block and symmetric positive semidefinite(2,2)-block.In this paper,we further apply the GSS iteration method to solve singular saddle point problem with nonsymmetric positive semidefinite(1,1)-block and symmetric positive semidefinite(2,2)-block,prove the semi-convergence of the GSS iteration method and analyze the spectral properties of the corresponding preconditioned matrix.Numerical experiment is given to indicate that the GSS iteration method with appropriate iteration parameters is effective and competitive for practical use.
