Galerkin Discretization is a numerical method in the field of integral equation formulations that employs a variational framework to project the continuous problem onto a finite-dimensional subspace spanned by basis functions, enforcing orthogonality of the residual with respect to the test functions identical to the trial functions.
6K
Publications
318.4K
Citations
8.2K
Authors
2.1K
Institutions
Publications per year
2017–2026
1.4K
Publications
6K
Finite Element Methods for Maxwell's Equations
Peter Monk · Oxford University Press eBooks · 2003 · 1.9K citations
1–5 of 6K
Authors
8.2K
- CS
54
h-index
- BC
48
h-index
- YC
34
h-index
- MD
32
h-index
- TB
31
h-index
1–5 of 8.2K
Institutions
2.1K
Brown University
Providence, United States
58 h-index
183 publications
19.1K citations
The University of Texas at Austin
Austin, United States
53 h-index
231 publications
18.7K citations
University of Minnesota
Minneapolis, United States
47 h-index
138 publications
26.9K citations
Shanghai University
Shanghai, China
39 h-index
143 publications
8.6K citations
Centre National de la Recherche Scientifique
Paris, France
39 h-index
186 publications
8.2K citations
Northwestern University
Evanston, United States
36 h-index
105 publications
37K citations
Stanford University
Stanford, United States
34 h-index
114 publications
15.7K citations
ETH Zurich
Zurich, Switzerland
34 h-index
95 publications
6K citations
1–8 of 2.1K
Venues
- SIAM Journal on Numerical Analysis
365 publications · 36K citations
91
h-index
- Journal of Computational Physics
418 publications · 31.1K citations
85
h-index
- Computer Methods in Applied Mechanics and Engineering
302 publications · 22.9K citations
73
h-index
- International Journal for Numerical Methods in Engineering
234 publications · 24.1K citations
69
h-index
- Mathematics of Computation
MCOM · 197 publications · 16.4K citations
64
h-index
1–5