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

POD-based model order reduction with an adaptive snapshot selection for a discontinuous Galerkin approximation of the time-domain Maxwell's equations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
12
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6

Relationship

2
4

Authors

Journals

citations
Cited by 22 publications
(12 citation statements)
references
References 48 publications
(92 reference statements)
0
12
0
Order By: Relevance
“…where M is the symmetric positive definite matrix, K and S i are the symmetric matrices, and S e and S h are the skew-symmetric matrices. For detailed descriptions of these matrices see [16].…”
Section: Mathematical Modelingmentioning
confidence: 99%
See 2 more Smart Citations
“…where M is the symmetric positive definite matrix, K and S i are the symmetric matrices, and S e and S h are the skew-symmetric matrices. For detailed descriptions of these matrices see [16].…”
Section: Mathematical Modelingmentioning
confidence: 99%
“…During the offline stage, the time-and parameter-independent RB functions are extracted from the collection of full-order solutions (snapshots) generated by the DGTD method at some different parameter locations. There are popular methods comprising the error estimator/indicatorbased greedy algorithm [9,10,11] and the singular value decomposition (SVD)-based proper orthogonal decomposition (POD) method [4,12,13,14,15,16] to generate the RB functions. In particular, the greedy approach is not feasible without a natural criteria for the generation of RB functions [17,18].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Whether the reduced-order Galerkin methods in [11,26,27], the reduced-order FE methods in [15,17], the reduced-order FVE methods in [18,19], the reduced-order CS methods in [20,21], the reduced-order NBE methods in [22,23] and the reduced basis methods in [24,25] are constructed by the continuous POD basic functions. The constructing process of the continuous POD basic functions requires the knowledge of the optimization methods and functional analysis.…”
Section: Introductionmentioning
confidence: 99%
“…The above reduced-order methods are established by replacing the basic functions in the classical numerical methods (Galerkin, CS, FE, FVE, NBE) with the few continuous POD basic functions, resulting in that these reduced-order methods would emerge with large errors. Moreover, the reduced-order Galerkin methods in [11,26,27] and the reduced-order CS method in [20,21] can only solve the problems defined on rectangular domains.…”
Section: Introductionmentioning
confidence: 99%