Discrete mathematical models in the analysis of splitting iterative methods for linear systems

被引:1
作者
Canto, Begona [1 ]
Coll, Carmen [1 ]
Sanchez, Elena [1 ]
机构
[1] Univ Politecn Valencia, Inst Matemat Multidisciplinar, Valencia 46022, Spain
关键词
iterative methods; descriptor systems; stability property; convergence; discrete models;
D O I
10.1016/j.camwa.2008.02.002
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Splitting methods are used to solve most of the linear systems, Ax = b, when the conventional method of Gauss is not efficient. These methods use the factorization of the square matrix A into two matrices M and N as A = M - N where M is nonsingular. Basic iterative methods Such as Jacobi or Gauss-Seidel define the iterative scheme for matrices that have no zeros along its main diagonal. This paper is concerned with the development of an iterative method to approximate Solutions when the coefficient matrix A has some zero diagonal entries. The algorithm developed in this paper involves the analysis of a discrete-time descriptor system given by the equation Me(k + 1) = Ne(k), e(k) being the error vector. (C) 2008 Published by Elsevier Ltd
引用
收藏
页码:727 / 732
页数:6
相关论文
共 5 条
[1]  
Ahuja RK, 1993, NETWORK FLOWS THEORY
[2]  
Burden RL., 2015, Numerical Analysis, V10th
[3]  
Campbell SL, 1980, SINGULAR SYSTEMS DIF
[4]  
Dai L., 1989, SINGULAR CONTROL SYS, DOI DOI 10.1007/BFB0002475
[5]  
Golub G. H., 1996, MATRIX COMPUTATIONS