The Hierarchical Subspace Iteration Method for Computing Vibration Modes of Elastic Objects

Master thesis (2023)

Authors

J.M.C. van Dijk Electrical Engineering, Mathematics and Computer Science

Contributors

K.A. Hildebrandt Computer Graphics and Visualisation - EEMCS (mentor)
E. Eisemann Computer Graphics and Visualisation - EEMCS (graduation committee member)
E. Isufi (graduation committee member)
Faculty
Electrical Engineering, Mathematics and Computer Science, Electrical Engineering, Mathematics and Computer Science
Copyright: © 2023 Julian van Dijk
More Info
expand_more

Published Date

24-11-2023

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Abstract

The Hierarchical Subspace Iteration Method is a novel method used to compute eigenpairs of the Laplace-Beltrami problem. It reduces the number of iterations required for convergence by restricting the problem to a smaller space and prolonging the solution as a starting point. This method has shown great performance improvements for Laplace-Beltrami eigenproblems.
We propose an adaptation to the Hierarchical Subspace Iteration Method that allows for computing vibration modes of elastic objects. We evaluate potential optimizations that can be made, as well as the performance characteristics of the method. Our method was shown to be faster than SIM in most cases while even beating Matlab's Lanczos solver in some cases.

Files

Thesis_The_Hierarchical_Subspa... (pdf)
(pdf | 9.31 Mb)
- Embargo expired in 24-11-2023