OPINS: An Orthogonally Projected Implicit Null-Space Method for Singular and Nonsingular Saddle-Point Systems∗
نویسندگان
چکیده
Saddle-point systems appear in many scientific and engineering applications. The systems can be sparse, symmetric or nonsymmetric, and possibly singular. In many of these applications, the number of constraints is relatively small compared to the number of unknowns. The traditional null-space method is inefficient for these systems, because it is expensive to find the null space explicitly. Some alternatives, notably constraintpreconditioned or projected Krylov methods, are relatively efficient, but they can suffer from numerical instability and even nonconvergence. In addition, most existing methods require the system to be nonsingular or be reducible to a nonsingular system. In this paper, we propose a new method, called OPINS, for singular and nonsingular saddle-point systems. OPINS is equivalent to the null-space method with an orthogonal projector, without forming the orthogonal basis of the null space explicitly. OPINS can not only solve for the unique solution for nonsingular saddlepoint problems, but also find the minimum-norm solution in terms of the solution variables for singular systems. The method is efficient and easy to implement using existing Krylov solvers for singular systems. At the same time, it is more stable than the other alternatives, such as projected Krylov methods. We present some preconditioners to accelerate the convergence of OPINS for nonsingular systems, and compare OPINS against some present state-of-the-art methods for various types of singular and nonsingular systems. 1This work was supported by DoD-ARO under contract #W911NF0910306. The third author is also supported by a subcontract to Stony Brook University from Argonne National Laboratory under Contract DE-AC02-06CH11357 for the SciDAC program funded by the Office of Science, Advanced Scientific Computing Research of the U.S. Department of Energy. 2Dept. of Applied Math. & Stat., Stony Brook University, Stony Brook, NY 11794, USA. 3Corresponding author. Email: [email protected]. 1 ar X iv :1 51 1. 06 84 5v 1 [ m at h. N A ] 2 1 N ov 2 01 5 ORTHOGONALLY PROJECTED IMPLICIT NULL-SPACE METHOD 2
منابع مشابه
On Solving Non-symmetric Saddle-point Systems Arising from Fictitious Domain Approaches∗
where the diagonal block A is an (n × n) matrix, the off-diagonal blocks B1 and B2 are (m× n) matrices with full row-rank and vectors f , g are of order n, m, respectively. Our contribution is inspired by a class of saddle-point systems arising from fictitious domain formulations of PDEs [3, 4]. Therefore we will be interested especially in systems (1) with n large, A singular and B1, B2 sparse...
متن کاملPerformance Comparison of Relaxation Methods with Singular and Nonsingular Preconditioners for Singular Saddle Point Problems
In this paper, we first review the PU and Uzawa-SAOR relaxation methods with singular or nonsingular preconditioning matrices for solving singular saddle point problems, and then we provide numerical experiments to compare performance results of the relaxation iterative methods using nonsingular preconditioners with those using singular preconditioners. Mathematics Subject Classification: 65F10...
متن کاملThe semi-convergence of GSI method for singular saddle point problems
Recently, Miao and Wang considered the GSI method for solving nonsingular saddle point problems and studied the convergence of the GSI method. In this paper, we prove the semi-convergence of the GSI method when it is applied to solve the singular saddle point problems.
متن کاملSemi-convergence of the Generalized Local Hss Method for Singular Saddle Point Problems
Recently, Zhu [Appl. Math. Comput., 218 (2012), 8816–8824] considered the generalized local HSS (GLHSS) method for solving nonsingular saddle point problems and studied its convergence. In this paper, we prove the semi-convergence of the GLHSS method when it is applied to solve the singular saddle point problems.
متن کاملOn Nonsingular Saddle-Point Systems with a Maximally Rank Deficient Leading Block
We consider nonsingular saddle-point matrices whose leading block is maximally rank deficient, and show that the inverse in this case has unique mathematical properties. We then develop a class of indefinite block preconditioners that rely on approximating the null space of the leading block. The preconditioned matrix is a product of two indefinite matrices, but under certain conditions the con...
متن کامل