What is it about?
Eigendecomposition is a fundamental mathematical operation used in many scientific and engineering applications, and it is essential to develop optimised algorithms that allow us to solve new and increasingly complex problems. In this work we introduce a novel matrix factorisation used for efficient eigendecomposition of a certain matrices in the class of generalised arrowhead matrices and showcase its practical applications by solving a quantum tunnelling problem.
Featured Image
Photo by Dan Cristian Pădureț on Unsplash
Why is it important?
Full eigendecomposition of a matrix is an expensive operation that can often cause bottlenecks in modern scientific and engineering software. By developing optimised algorithms, we are able to reduce the time-to-solution, saving both money and resources. Moreover, we unlock the possibility of exploring larger and more complex systems that would otherwise have prohibitive costs.
Read the Original
This page is a summary of: Arrowhead Factorization of Real Symmetric Matrices and its Applications in Optimized Eigendecomposition, June 2024, ACM (Association for Computing Machinery),
DOI: 10.1145/3659914.3659918.
You can read the full text:
Contributors
The following have contributed to this page







