Fast direct solution of method of moments linear system
A novel algorithm, the compressed block decomposition (CBD), is presented for highly accelerated direct (non iterative) method of moments (MoM) solution of electromagnetic scattering and radiation problems. The algorithm is based on a block-wise subdivision of the MoM impedance matrix. Impedance mat...
| Autores: | , , , , |
|---|---|
| Formato: | artículo |
| Fecha de publicación: | 2007 |
| País: | España |
| Recursos: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/1932 |
| Acesso em linha: | https://hdl.handle.net/2117/1932 |
| Access Level: | acceso abierto |
| Palavra-chave: | Electromagnetism Numerical analysis Block-wise compression Computational electromagnetics Fast direct solution method Impedance matrix Matrix decomposition method Method of moments linear system Method of moments impedance matrix Singular value decomposition Ones electromagnètiques -- Dispersió Anàlisi numèrica Àrees temàtiques de la UPC::Enginyeria de la telecomunicació::Radiocomunicació i exploració electromagnètica |
| Resumo: | A novel algorithm, the compressed block decomposition (CBD), is presented for highly accelerated direct (non iterative) method of moments (MoM) solution of electromagnetic scattering and radiation problems. The algorithm is based on a block-wise subdivision of the MoM impedance matrix. Impedance matrix subblocks corresponding to distant subregions of the problem geometry are not calculated directly, but approximated in a compressed form. Subsequently, the matrix is decomposed preserving the compression. Examples are presented of typical problems in the range of 5000 to 70 000 unknowns. The total execution time for the largest problem is about 1 h and 20 min for a single excitation vector. The main strength of the method is for problems with multiple excitation vectors (monostatic RCS computations) due to the negligible extra cost for each new excitation. For radiation and scattering problems in free space, the numerical complexity of the algorithm is shown to be N2 and the storage requirements scale with N3/2. |
|---|