National Changhua University of Education Institutional Repository : Item 987654321/10294
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 6491/11663
造访人次 : 23792643      在线人数 : 132
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 进阶搜寻

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.ncue.edu.tw/ir/handle/987654321/10294

题名: Fast Algorithms for Solving Toeplitz and Bordered Toeplitz Matrix Problems Arising in Electromagnetic Theory
作者: Ho, Min-Hua;Chen, Mingchih
贡献者: 電子工程學系
日期: 2005-06
上传时间: 2012-05-22T06:27:11Z
出版者: Maruzen Co., Ltd/Maruzen Kabushikikaisha
摘要: In many electromagnetic field problems, matrix equations were always deduced from using the method of moment. Among these matrix equations, some of them might require a large amount of computer memory storage which made them unrealistic to be solved on a personal computer. Virtually, these matrices might be too large to be solved efficiently. A fast algorithm based on a Toeplitz matrix solution was developed for solving a bordered Toeplitz matrix equation arising in electromagnetic problems applications. The developed matrix solution method can be applied to solve some electromagnetic problems having very large-scale matrices, which are deduced from the moment method procedure. In this paper, a study of a computationally efficient order-recursive algorithm for solving the linear electromagnetic problems [Z] I = V, where [Z] is a Toeplitz matrix, was presented. Upon the described Toeplitz matrix algorithm, this paper derives an efficient recursive algorithm for solving a bordered Toeplite matrix with the matrix's major portion in the form of a Toeplitz matrix. This algorithm has remarkable advantages in reducing both the number of arithmetic operations and memory storage.
關聯: IEICE Trans. on Electronics, E88-C(6): 1295-1303
显示于类别:[電子工程學系] 期刊論文

文件中的档案:

档案 大小格式浏览次数
2050300210004.pdf8KbAdobe PDF347检视/开启


在NCUEIR中所有的数据项都受到原著作权保护.

 


DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈