ON GENERALIZATIONS OF THEORY OF CONSISTENT ORDERINGS FOR SUCCESSIVE OVER-RELAXATION METHODS

被引:24
作者
VERNER, JH
BERNAL, MJM
机构
[1] Department of Computer Science, University of Edinburgh, Edinburgh, 8
[2] Institute of Computer Science, University of London, London, W.C.1
关键词
D O I
10.1007/BF02162914
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
A definition of consistent ordering for a matrix is generalized to include the scope of more recent definitions. The facility with which this generalized definition can be applied is exhibited. © 1968 Springer-Verlag.
引用
收藏
页码:215 / &
相关论文
共 42 条
[1]  
ARMS RJ, 1956, SIAM J, V4, P220
[2]   ON CONVERGENCE CRITERIA FOR METHOD OF SUCCESSIVE OVER-RELAXATION [J].
BROYDEN, CG .
MATHEMATICS OF COMPUTATION, 1964, 18 (85) :136-&
[3]  
BROYDEN CG, 1964, NUMER MATH, V6, P269
[4]   DETERMINATION OF OPTIMUM ACCELERATING FACTOR FOR SUCCESSIVE OVER-RELAXATION [J].
CARRE, BA .
COMPUTER JOURNAL, 1961, 4 :73-&
[5]   PARTITIONING OF NETWORK EQUATIONS FOR BLOCK ITERATION [J].
CARRE, BA .
COMPUTER JOURNAL, 1966, 9 (01) :84-&
[6]   A METHOD OF NORMALIZED BLOCK ITERATION [J].
CUTHILL, EH ;
VARGA, RS .
JOURNAL OF THE ACM, 1959, 6 (02) :236-244
[7]  
DSYLVA E, 1963, COMPUT J, V6, P366
[8]  
EHRLICH LW, 1964, SIAM J APPL MATH, V12, P807
[10]   LINE OVER-RELAXATION FACTOR FOR SMALL MESH SIZE [J].
EVANS, DJ .
COMPUTER JOURNAL, 1962, 5 (01) :48-&