The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Stable Generalized Finite Element Method (SGFEM)
Open accessAbstract
The Generalized Finite Element Method (GFEM) is a Partition of Unity Method (PUM), where the trial space of standard Finite Element Method (FEM) is augmented with non-polynomial shape functions with compact support. These shape functions, which are also known as the enrichments, mimic the local behavior of the unknown solution of the underlying variational problem. GFEM has been successfully used to solve a variety of problems with complicated features and microstructure. However, the stiffness matrix of GFEM is badly conditioned (much worse compared to the standard FEM) and there could be a severe loss of accuracy in the computed solution of the associated linear system. In this paper, we address this issue and propose a modification of the GFEM, referred to as the Stable GFEM (SGFEM). We show that SGFEM retains the excellent convergence properties of GFEM, does not require a ramp-function in the presence of blending elements, and the conditioning of the associated stiffness matrix is not worse than that of the standard FEM. Moreover, SGFEM is very robust with respect to the parameters of the enrichments. We show these features of SGFEM on several examples.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Faires, J. D. (1978) · Cited by 6,711
A finite element method for crack growth without remeshing
Mo�s, N., Dolbow, J., & Belytschko, T. (1999) · International Journal for Numerical Methods in Engineering · doi:10.1002/(sici)1097-0207(19990910)46:1<131::aid-nme726>3.0.co;2-j · Cited by 6,446
The Algebraic Eigenvalue Problem
I., E., & Wilkinson, J. H. (1966) · Mathematics of Computation · doi:10.2307/2003558 · Cited by 5,140
Elastic crack growth in finite elements with minimal remeshing
Belytschko, T., & Black, T. (1999) · International Journal for Numerical Methods in Engineering · doi:10.1002/(sici)1097-0207(19990620)45:5<601::aid-nme598>3.0.co;2-s · Cited by 4,880
Accuracy and Stability of Numerical Algorithms: Second Edition
Higham, N. J. (2002) · doi:10.1137/1.9780898718027 · Cited by 3,803
An Analysis of the Finite Element Method
I., E., Strang, G., & Fix, G. J. (1974) · Mathematics of Computation · doi:10.2307/2005716 · Cited by 3,484
An analysis of the finite element method
(1980) · Advances in Water Resources · doi:10.1016/0309-1708(80)90069-x · Cited by 3,466
The partition of unity finite element method: Basic theory and applications
Melenk, J. M., & Babuška, I. (1996) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/s0045-7825(96)01087-0 · Cited by 3,455
Self-citationA Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
Amestoy, P. R., Duff, I. S., L'Excellent, J.-Y., & Koster, J. (2001) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479899358194 · Cited by 2,287
Accuracy and stability of numerical algorithms
(1996) · Choice Reviews Online · doi:10.5860/choice.34-0981 · Cited by 2,072
Verification and Validation in Scientific Computing
Oberkampf, W. L., & Roy, C. J. (2010) · doi:10.1017/cbo9780511760396 · Cited by 1,556
Numerical Analysis--Mathematics of Scientific Computing.
I., E., Kincaid, D., & Cheney, W. (1992) · Mathematics of Computation · doi:10.2307/2152998 · Cited by 987
Special Finite Element Methods for a Class of Second Order Elliptic Problems with Rough Coefficients
Babuška, I., Caloz, G., & Osborn, J. E. (1994) · SIAM Journal on Numerical Analysis · doi:10.1137/0731051 · Cited by 661
Self-citationSuperLU_DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems
Li, X. S., & Demmel, J. W. (2003) · ACM Transactions on Mathematical Software · doi:10.1145/779359.779361 · Cited by 628
Verification and validation in computational engineering and science: basic concepts
Babuska, I., & Oden, J. T. (2004) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2004.03.002 · Cited by 376
Validation in Simulation: Various Positions in the Philosophy of Science
Kleindorfer, G. B., O'Neill, L., & Ganeshan, R. (1998) · Management Science · doi:10.1287/mnsc.44.8.1087 · Cited by 210
O’Hara, P. J., Duarte, C. A., & Eason, T. G. (2009) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2008.12.024 · Cited by 103
Metadata
- Authors
- Babuška, I., & Banerjee, U.
- Venue
- Computer Methods in Applied Mechanics and Engineering
- Publisher
- Elsevier BV
- Published
- 2012-01
- Volume
- 201-204
- Pages
- 91-111
- ISSN
- 0045-7825 (ISSN-L)
- OpenAlex
- W2019377902
- Cited by
- 323
- References
- 18
- FWCI
- 19.80
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.