1996
DOI: 10.1109/8.511816
|View full text |Cite
|
Sign up to set email alerts
|

A multilevel matrix decomposition algorithm for analyzing scattering from large structures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

4
278
0

Year Published

1999
1999
2020
2020

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 320 publications
(282 citation statements)
references
References 18 publications
4
278
0
Order By: Relevance
“…When the criterion is met, the serial numbers of the sampled columns and rows are saved. With them, according to the matrix decomposition algorithm (MDA) [10], M can be decomposed into…”
Section: Principle Of Facamentioning
confidence: 99%
“…When the criterion is met, the serial numbers of the sampled columns and rows are saved. With them, according to the matrix decomposition algorithm (MDA) [10], M can be decomposed into…”
Section: Principle Of Facamentioning
confidence: 99%
“…Altogether, the generation and compression of the impedance matrix is presently typically the bottleneck of the tool in terms of computational time. At UPC-UAB, an efficient implementation of the Matrix Decomposition Algorithm (MDA) [5,7] has been developed that highly accelerates the compression procedure, avoiding entirely the need to construct the full original matrix blocks. The next integration step within the ACE framework will be to release a version of MDA to the partners that can be integrated with their MoM code.…”
Section: Cbdmentioning
confidence: 99%
“…It is directly applicable to almost any MoM formulation and substantially reduces the storage and computational cost with respect to straightforward LU decomposition. The method is based on a blockwise compression of the impedance matrix (see Section II), by the same technique as used in the matrix decomposition algorithm (MDA) [4]- [6]. The compressed matrix is then decomposed using an adapted version of the block LU algorithm previously published in [9] and [10], which allows to retain the original compression rate (see Section III-A).…”
Section: Introductionmentioning
confidence: 99%
“…Its main drawback, the costly construction, storage, and solution of a dense linear system, has led to the development of several fast algorithms such as AIM [2], MLFMA [3], and Multilevel MDA [4]- [6]. Most of these algorithms are based on some approximative compressed representation of the linear system matrix, or impedance matrix, that needs much less storage and highly accelerates the matrix-vector multiplications.…”
Section: Introductionmentioning
confidence: 99%