Skip to Main content Skip to Navigation
New interface
Conference papers

A Reduction Algorithm for Matrices Depending on a Parameter

Abstract : In this article, we study square matrices perturbed by a parameter $\epsilon$. An efficient algorithm computing the $\epsilon$-expansion of the eigenvalues in formal Laurent-Puiseux series is provided, for which the computation of the characteristic polynomial is not required. We show how to reduce the initial matrix so that the Lidskii-Edelman-Ma perturbation theory can be applied. We also explain why this approach may simplify the perturbed eigenvector problem. The implementation of the algorithm in the computer algebra system Maple has been used in a quantum mechanics context to diagonalize some perturbed matrices and is available.
Document type :
Conference papers
Complete list of metadata
Contributor : Claude-Pierre Jeannerod Connect in order to contact the contributor
Submitted on : Monday, November 8, 2021 - 2:45:59 PM
Last modification on : Monday, November 22, 2021 - 2:39:02 PM
Long-term archiving on: : Wednesday, February 9, 2022 - 7:52:38 PM


Files produced by the author(s)


  • HAL Id : hal-03419442, version 1



Claude-Pierre Jeannerod, Eckhard Pflügel. A Reduction Algorithm for Matrices Depending on a Parameter. International Symposium on Symbolic and Algebraic Computation (ISSAC), Jul 1999, Vancouver, Canada. ⟨hal-03419442⟩



Record views


Files downloads