The Hierarchical Subspace Iteration Method for Computing Vibration Modes of Elastic Objects
J.M.C. van Dijk (TU Delft - Electrical Engineering, Mathematics and Computer Science)
K.A. Hildebrandt – Mentor (TU Delft - Computer Graphics and Visualisation)
E. Eisemann – Graduation committee member (TU Delft - Computer Graphics and Visualisation)
Elvin Isufi – Graduation committee member (TU Delft - Multimedia Computing)
More Info
expand_more
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.
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.