Use of higher‐order shape functions in the scaled boundary finite element method
111 citations recorded by the source corpus.
Subfields: Computational Mechanics, Electrical and Electronic Engineering, Mechanics of Materials
View Paper: https://www.semanticscholar.org/paper/08a92983f62ed7235103bc155ac48f99eb8b9c7b
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Mechanics
In Electrical and Electronic Engineering
In Mechanics of Materials
Citations in the corpus
- A unified 3D‐based technique for plate bending analysis using scaled boundary finite element method (2012, background): “High-order spectral elements [65, 66] are employed to discretise the in-plane dimensions of the plate.”
- Scaled boundary polygons with application to fracture analysis of functionally graded materials (2014, methodology): “Alternatively, Gauss-Lobatto-Legendre shape functions can also be used [27, 49].”
- A scaled boundary polygon formulation for elasto-plastic analyses (2014, methodology): “Only the boundary of the polygon is discretized with one-dimensional elements using Gauss-Lobatto-Lagrange shape functions [66, 65].”
- High‐order plate bending analysis based on the scaled boundary finite element method (2013, unknown): “High-order spectral element High-order spectral elements [70, 71] are employed to discretise the in-plane dimensions of the plate.”
- Polygon scaled boundary finite elements for crack propagation modelling (2012, methodology): “In this study, two-noded linear elements (Figure 2(c)) are used, although higher order elements can be used to improve the solution’s accuracy as in FEM [32].”
- A spectral element approach for the stability of delay systems (2011, background): “In agreement with Reference [55], a more effective representation of Lagrange polynomials is provided by the barycentric formula according to i ( )= i − i∑n+1 k=1 k − k , (18) where k are the barycentric weights given by k = 1∏ k = j ( j − k) , j =1, . . . ,n+1.”