2011
DOI: 10.1016/j.jcp.2011.03.023
|View full text |Cite
|
Sign up to set email alerts
|

The reduced basis method for the electric field integral equation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

2
71
0

Year Published

2012
2012
2021
2021

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 61 publications
(73 citation statements)
references
References 36 publications
2
71
0
Order By: Relevance
“…increasing M ) [6,12]; or completely recomputing the subspace using the original high-fidelity model [10,11]. Both approaches retain the "global" nature of the subspace while incurring costs that reduce the efficiency of the technology.…”
Section: Adaptive Rom Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…increasing M ) [6,12]; or completely recomputing the subspace using the original high-fidelity model [10,11]. Both approaches retain the "global" nature of the subspace while incurring costs that reduce the efficiency of the technology.…”
Section: Adaptive Rom Methodsmentioning
confidence: 99%
“…This data is then used to construct a lower dimensional basis using techniques such as the proper orthogonal decomposition (POD, also known as principle component analysis or the Karhunen-Loéve decomposition) [1,2,3] or the reduced basis method (RBM) [1,2,5,6]. In the POD approach, for instance, the N snapshots are reduced into a small subspace by computing the singular-value-decomposition (SVD) of…”
Section: An Overview Of Dynamic Romsmentioning
confidence: 99%
See 1 more Smart Citation
“…Both cases are clearly sub-optimal. Another hp approached is introduced for empirical interpolation methods, see [4,3] . The idea is that if the method does not converges in N bases, the parameter domain is decomposed into 2 p subdomains, and a new basis is build in these 2 p subdomains.…”
Section: Introductionmentioning
confidence: 99%
“…Like the hp algorithm for the empirical interpolation method [4,3] , our hp reduced basis method first defines a maximum number of reduced bases that is affordable during the online stage. If the offline greedy procedure for a given parameter domain converges with equal or less than the maximum bases, the offline algorithm terminates.…”
Section: Introductionmentioning
confidence: 99%