首页 | 本学科首页   官方微博 | 高级检索  
     检索      

块Toeplitz三角阵求逆及块Toeplitz三角线性方程组求解的复杂性
引用本文:游兆永,路浩.块Toeplitz三角阵求逆及块Toeplitz三角线性方程组求解的复杂性[J].数学研究及应用,1989,9(1):101-106.
作者姓名:游兆永  路浩
作者单位:西安交通大学数学系;西安交通大学数学系
摘    要:In this paper, it is showed that the computational complexity of inversion of block triangular Toeplitz matrix U= (U0, U1,…, Un-1 ) is O (m2nlogn + m3), as well as solution of block triangla r Toeplitz linear systems, where U 's are m×m mat rices. By using this results, we reduce arithmetic operations of division of polynomials from O(nlog2n) to O(nlogn).

收稿时间:1986/12/16 0:00:00

Complexity of Inversion of Block Triangular Toeplitz Matrices and Solution of Block Triangular Toeplitz Linear Systems
You Zhaoyong and Lu Hao.Complexity of Inversion of Block Triangular Toeplitz Matrices and Solution of Block Triangular Toeplitz Linear Systems[J].Journal of Mathematical Research with Applications,1989,9(1):101-106.
Authors:You Zhaoyong and Lu Hao
Institution:Xi'an Jiaotong University;Xi'an Jiaotong University
Abstract:
Keywords:
本文献已被 CNKI 等数据库收录!
点击此处可从《数学研究及应用》浏览原始摘要信息
点击此处可从《数学研究及应用》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号