Computer Science ›› 2021, Vol. 48 ›› Issue (6A): 649-657.doi: 10.11896/jsjkx.200800063

• Interdiscipline & Application • Previous Articles     Next Articles

Research on Method of Reducing A0 to Upper Hessenberg Type with Elementary Stability Matrix

SU Er   

  1. College of Media Engineering,Communication University of Zhejiang,Hangzhou 310018,China
  • Online:2021-06-10 Published:2021-06-17
  • About author:SU Er,born in 1969,postgraduate,lecturer.Her main research interests include matrix algebra and so on.

Abstract: This paper discusses how to reduce A0 to Hessenberg matrix by using Gauss elimination method of partial principal elements using elementary matrix technology.In order to make the numerical stability,the essential basic problem of how to exchange is emphasized.The first part briefly summarizes the matrix formula of reduction method.The second part further clarifies the basis of deducing the formula form of recursive reduction operation rule.The third part focuses on the details of recursive algorithm complete steps and logic implementation of the reduction method,and clearly states the fact that the final reduction result is consistent with the accurate calculation result of the matrix formula.The fourth part is a concrete example to verify the conclusion:the reduction method is based on sufficient calculation basis and is actually compact and feasible.

Key words: Element replacement, Elementary matrix, Exchange of ranks, Matrix block, Recursive reduction, Reduced matrix

CLC Number: 

  • O241.6
[1] GOLUB G H,VAN LOAN C F.MATRIX COMPUTATIONS[M].Dalian:Dalian University of Technology Press,1988:54-57.
[2] WILKINSON J H.The algebraic eigenvalue problem[M].Beijing:Science Press,1987:368-378,427.
[3] SU E.Matrix Triangular Decomposition Improvement of PreOrder Principal Sub Determinant[J].Computer Science,2017,11(44):148-154.
No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!