A Class of IDP-SOR Method of Saddle Point Problem
Zhang Li-jun
Abstract
Zhang Li-jun
Abstract
A new iterative solution is proposed to solve the problem of large-scale saddle point problem.Based on a splitting for the matrix of coefficients which A∈Rn×n is symmetric positive definite in coefficient matrix,using the incomplete decomposition method which split A to LLT+R,after choosing a pretreated matrix and undermined parameters,the converence of the iteration is proved and sufficient and necessary conditions of the new iteration method proposed becomes convergent in form of theorem.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A new iterative solution is proposed to solve the problem of large-scale saddle point problem.Based on a splitting for the matrix of coefficients which A∈Rn×n is symmetric positive definite in coefficient matrix,using the incomplete decomposition method which split A to LLT+R,after choosing a pretreated matrix and undermined parameters,the converence of the iteration is proved and sufficient and necessary conditions of the new iteration method proposed becomes convergent in form of theorem.
Key concepts: Saddle point, Mathematics, Positive-definite matrix, Matrix (chemical analysis), Coefficient matrix, Class (philosophy), Applied mathematics, Iterative method