Scheduled System Maintenance:
On April 27th, single article purchases and IEEE account management will be unavailable from 2:00 PM - 4:00 PM ET (18:00 - 20:00 UTC).
We apologize for the inconvenience.
By Topic

A universal matrix solver for integral-equation-based problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Canning, F.X. ; Simply Sparse Technol., Morgantown, WV, USA ; Rogovin, K.

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.

Published in:

Antennas and Propagation Magazine, IEEE  (Volume:45 ,  Issue: 1 )