DocumentCode
1166538
Title
A universal matrix solver for integral-equation-based problems
Author
Canning, Francis X. ; Rogovin, Kevin
Author_Institution
Simply Sparse Technol., Morgantown, WV, USA
Volume
45
Issue
1
fYear
2003
fDate
2/1/2003 12:00:00 AM
Firstpage
19
Lastpage
26
Abstract
A new method has been developed for compressing the matrices that occur in most integral-equation-based computer programs. This method is easy to interface with existing computer programs, and allows them to run significantly faster and with significantly less memory. This method applies not only to electromagnetic and acoustic computation, but also to most programs involving a Green´s function or any integral equation with a kernel having some smoothness properties. Our numerical computations, running on a high-end personal computer, have achieved compression ratios of fifty times, and compressed inversion of the matrices fifty times faster than by previous methods. For larger problems, solved on high-performance computers, these ratios would improve to about one thousand to one for larger moment method problems.
Keywords
Green´s function methods; computational electromagnetics; integral equations; iterative methods; matrix decomposition; method of moments; sparse matrices; Green´s function; acoustic computation; compressed inversion; compression ratios; computational electromagnetics; electromagnetic computation; integral-equation-based computer programs; integral-equation-based problems; kernel; matrix decomposition; matrix inversion; smoothness properties; universal matrix solver; Computer interfaces; Drives; Information technology; Integral equations; Kernel; Matrix decomposition; Microcomputers; Moment methods; Physics computing; Sparse matrices;
fLanguage
English
Journal_Title
Antennas and Propagation Magazine, IEEE
Publisher
ieee
ISSN
1045-9243
Type
jour
DOI
10.1109/MAP.2003.1189648
Filename
1189648
Link To Document