2023
DOI: 10.1109/jmmct.2023.3263152
|View full text |Cite
|
Sign up to set email alerts
|

An Iterative Random Sampling Algorithm for Rapid and Scalable Estimation of Matrix Spectra

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 41 publications
0
2
0
Order By: Relevance
“…Lastly, we consider a U-shaped scatterer as shown in Figure 11, which, when an octree is used for partitioning, will produce block-structured sub-matrices of the forms ( 16), (17), and (23). The outer side length of the U-profile is 1 m, and its thickness is 0.1 m. We consider discretizations with ranging from 3219 to 145 791 for testing.…”
Section: Numerical Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Lastly, we consider a U-shaped scatterer as shown in Figure 11, which, when an octree is used for partitioning, will produce block-structured sub-matrices of the forms ( 16), (17), and (23). The outer side length of the U-profile is 1 m, and its thickness is 0.1 m. We consider discretizations with ranging from 3219 to 145 791 for testing.…”
Section: Numerical Resultsmentioning
confidence: 99%
“…The standard choice, also in the case of the EFIE [10], to select the rows and columns used for the approximation is the so-called partial pivoting [9], [10], [17], [18], where given a row (or column) the next column (or row) is selected by searching for the maximal element in modulo. However, when partial pivoting is used, the ACA is not error-controllable, and numerous works deal with improving convergence without jeopardizing the complexity [19]- [22]; in addition to those works, rapid rank-estimations such as in [23] have been suggested to be used as "guard rails" to prevent premature convergence [24].…”
Section: Introductionmentioning
confidence: 99%