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

A Sparse Factorization for Fast Computation of Localizing Modes

Abstract: Localizing modes provide an effective basis for developing efficient, error-controlled factorizations of the dense matrices encountered in integral equation formulations of wave phenomena at low to moderate frequencies. An essential component of these factorization algorithms is the numerical determination of the underlying localizing modes. This communication describes the details of an efficient procedure for computing the so-called non-overlapping, localizing modes. The principle component of the procedure … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0

Year Published

2010
2010
2019
2019

Publication Types

Select...
6

Relationship

3
3

Authors

Journals

citations
Cited by 10 publications
(9 citation statements)
references
References 25 publications
0
9
0
Order By: Relevance
“…As discussed elsewhere [12,13], this is accomplished by first building a data-sparse H2 representation of Z [16]. The methods used to efficiently manipulate the H2 representation to determine the submatrices Λ l,L , Λ l,R , P l,L , and P l,R ofX l andȲ l are detailed in [12,17]. When the error control procedure is used, the modification indicated by Eq.…”
Section: Numerical Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…As discussed elsewhere [12,13], this is accomplished by first building a data-sparse H2 representation of Z [16]. The methods used to efficiently manipulate the H2 representation to determine the submatrices Λ l,L , Λ l,R , P l,L , and P l,R ofX l andȲ l are detailed in [12,17]. When the error control procedure is used, the modification indicated by Eq.…”
Section: Numerical Resultsmentioning
confidence: 99%
“…The matrices Λ l and P l in (2) are square, permuted block-diagonal matrices (e.g., see Figure 1 are represented using an l-level H2 data structure [16]. The procedure used to efficiently manipulate the H2 data structures to compute the localizing functions in Λ (L) l is discussed in detail in [12,17]. All other matrices, including Λ l and P l above, and X l and Y l below, are either block diagonal or permuted block diagonal matrices.…”
Section: Triangular Factorizationmentioning
confidence: 99%
See 2 more Smart Citations
“…The principle component of that procedure is a QR-like factorization strategy for a particular sparse representation of a system matrix. This procedure is referred to as a 2R factorization [32]. Additional improvements that reduce the CPU costs associated with the NL-LOGOS factorization have also been described elsewhere [33], [34].…”
Section: Introductionmentioning
confidence: 99%