Computer Science ›› 2017, Vol. 44 ›› Issue (Z11): 148-153.doi: 10.11896/j.issn.1002-137X.2017.11A.031

Previous Articles     Next Articles

Matrix Triangular Decomposition Improvement of Pre Order Principal Sub Determinant

SU Er   

  • Online:2018-12-01 Published:2018-12-01

Abstract: Using Gauss elimination method with part main elements is generally not got all principal sub determinants of matrix.This article discussed around gradual reduction with each step-by-step subdivision,final triangular decomposition was performed on matrix A0 by row permutation after a number of row replacement,and each pre order principal sub determinant of A0 was found out orderly.Main purpose of the article is to achieve improvement for usually triangle reduction method by row permutation,with a recursive method for algebraic representation,to bind matrix product ope-ration,and it inductively proves that final reduction result is in accordance with the realization of the L-U triangular decomposition to matrix.And at the same time with the process of gradual reduction,we got all pre order principal sub determinants of original matrix A0.

Key words: Row permutation,Gradual reduction,Triangular decomposition,Pre order principal sub determinant,Matrix operation

[1]孙谳.数值线代数讲义[M].天津:南开大学出版社,1987:131136..
[2]威尔金森 J H.代数特征值问题[M].石钟慈,邓健新,译.北京:科学出版社,1987:247249..
[3]曹志浩,张玉德,李瑞遐.矩阵计算和方程求根[M].北京:人民教育出版社,1981:139146..
[4]格罗布 G H,万罗安 C F.矩阵计算[M].廉庆荣,邓健新,刘秀兰,译.大连:大连理工大学出版社,1988:5457,6467..
No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!