Details
| Originalsprache | Englisch |
|---|---|
| Qualifikation | Doctor rerum naturalium |
| Gradverleihende Hochschule | |
| Betreut von |
|
| Datum der Verleihung des Grades | 6 Okt. 2023 |
| Erscheinungsort | Hannover |
| Publikationsstatus | Veröffentlicht - 2023 |
Abstract
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
Hannover, 2023. 134 S.
Publikation: Qualifikations-/Studienabschlussarbeit › Dissertation
}
TY - BOOK
T1 - Applications of Special Functions in High Order Finite Element Methods
AU - Haubold, Tim Sebastian
PY - 2023
Y1 - 2023
N2 - In this thesis, we optimize different parts of high order finite element methods by application of special functions and symbolic computation. In high order finite element methods, orthogonal polynomials like the Jacobi polynomials are deeply rooted. A broad classical theory of these polynomials is known. Moreover, with modern computer algebra software we can extend this knowledge even further. Here, we apply this knowledge and software for different special functions to derive new recursive relations of local matrix entries. This massively optimizes the assembly time of local high order finite element matrices. Furthermore, the introduced algorithm is in optimal complexity. Moreover, we derive new high order dual functions, which result in fast interpolation operators. Lastly, efficient recursive algorithms for hanging node constraint matrices provided by this new dual functions are given.
AB - In this thesis, we optimize different parts of high order finite element methods by application of special functions and symbolic computation. In high order finite element methods, orthogonal polynomials like the Jacobi polynomials are deeply rooted. A broad classical theory of these polynomials is known. Moreover, with modern computer algebra software we can extend this knowledge even further. Here, we apply this knowledge and software for different special functions to derive new recursive relations of local matrix entries. This massively optimizes the assembly time of local high order finite element matrices. Furthermore, the introduced algorithm is in optimal complexity. Moreover, we derive new high order dual functions, which result in fast interpolation operators. Lastly, efficient recursive algorithms for hanging node constraint matrices provided by this new dual functions are given.
U2 - 10.15488/15079
DO - 10.15488/15079
M3 - Doctoral thesis
CY - Hannover
ER -