2011
DOI: 10.1109/tap.2011.2165476
|View full text |Cite
|
Sign up to set email alerts
|

Multilevel Adaptive Cross Approximation (MLACA)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
25
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 74 publications
(25 citation statements)
references
References 18 publications
0
25
0
Order By: Relevance
“…Some approaches such as the Dual Modified Gram Schmidt block-QR-factorization [11] or the block IE-QR approach presented in [12] also offer the advantage of not having to assemble the full submatrix before performing the compression. The Adaptive Cross Approximation method [13] also presents the same advantage and has been extensively studied and applied in the last years, including error and convergence analysis [14,15], multilevel and hierarchical implementations [16,17] or combinations with other fast approaches such as MLFMA [18] or the Characteristic Basis Function Method [19].…”
Section: Improving the Efficiency Of The Moment Methodsmentioning
confidence: 99%
“…Some approaches such as the Dual Modified Gram Schmidt block-QR-factorization [11] or the block IE-QR approach presented in [12] also offer the advantage of not having to assemble the full submatrix before performing the compression. The Adaptive Cross Approximation method [13] also presents the same advantage and has been extensively studied and applied in the last years, including error and convergence analysis [14,15], multilevel and hierarchical implementations [16,17] or combinations with other fast approaches such as MLFMA [18] or the Characteristic Basis Function Method [19].…”
Section: Improving the Efficiency Of The Moment Methodsmentioning
confidence: 99%
“…HSS construction is implemented in a multilevel fashion as described in [34], and essentially, its multilevel compression can be considered comparable to the one used in the multilevel ACA (MLACA) algorithm [17]. Furthermore, so-called multilevel "butterfly" algorithms [37]- [38], as well as the fast solver presented in [39], have a similar basis to the multilevel compression coupled with low-rank matrix representation.…”
Section: Efficient Scalable Parallel Higher Order Directmentioning
confidence: 99%
“…Besides, this can be done in a recursive scheme (each subregion can be split into many subregions to exhibit smaller off-diagonal blocks to compress) with a Multi-Level ACA [13], or also with the formalism of H-matrix theory [16,17]. This is not applied here for the two impedance matricesZ 11 andZ 22 sincē Z 11 is quite small (for an object of small or moderate size) and applying MLACA or H-matrix theory can be more expensive than a direct inversion; and forZ 22 , the FBSA is already used which provides a low complexity: only O(P FB N 2 N s ) for the computation of the local interactions on S 2 (inversion ofZ 2 and computation of the matrix-vector productZ −1 2 u, where u is a vector).…”
Section: Epile+fbsa Combined With Acamentioning
confidence: 99%
“…Thus, in order to accelerate the matrix-vector products involved in the coupling steps, a recent algebraic method called Adaptive Cross Approximation (ACA) is applied to compress the coupling matrices. This method, developed in 2000 by Bebendorf [7,8], was then applied to electromagnetics [9][10][11][12][13] and can be seen as a truncated and partially pivoted Gaussian elimination [7].…”
Section: Introductionmentioning
confidence: 99%