Numerical solutions of symmetric saddle point problem by direct methods
نویسندگان
چکیده
منابع مشابه
Numerical solutions of symmetric saddle point problem by direct methods
Two new methods for solving the symmetric saddle point problem are proposed. The first one is a generalization of Golub’s method for the augmented system formulation (ASF) and uses the Householder QR decomposition. The second method is supported by the singular value decomposition (SVD). Numerical comparison of some direct methods are given.
متن کاملGeneralized iterative methods for solving double saddle point problem
In this paper, we develop some stationary iterative schemes in block forms for solving double saddle point problem. To this end, we first generalize the Jacobi iterative method and study its convergence under certain condition. Moreover, using a relaxation parameter, the weighted version of the Jacobi method together with its convergence analysis are considered. Furthermore, we extend a method...
متن کاملA Generalization of Local Symmetric and Skew-symmetric Splitting Iteration Methods for Generalized Saddle Point Problems
In this paper, we further investigate the local Hermitian and skew-Hermitian splitting (LHSS) iteration method and the modified LHSS (MLHSS) iteration method for solving generalized nonsymmetric saddle point problems with nonzero (2,2) blocks. When A is non-symmetric positive definite, the convergence conditions are obtained, which generalize some results of Jiang and Cao [M.-Q. Jiang and Y. Ca...
متن کاملNumerical solution of saddle point problems
Large linear systems of saddle point type arise in a wide variety of applications throughout computational science and engineering. Due to their indefiniteness and often poor spectral properties, such linear systems represent a significant challenge for solver developers. In recent years there has been a surge of interest in saddle point problems, and numerous solution techniques have been prop...
متن کاملValidated Solutions of Saddle Point Linear Systems
We propose a fast verification method for saddle point linear systems where the (1,1) block is singular. The proposed verification method is based on an algebraic analysis of a block diagonal preconditioner and rounding mode controlled computations. Numerical comparison of several verification methods with various block diagonal preconditioners is given.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Demonstratio Mathematica
سال: 2013
ISSN: 2391-4661
DOI: 10.1515/dema-2013-0463