ALGORITHMIC COMPLEXITY ANALYSIS AND NUMERICAL EXPERIMENTS FOR COMPUTING THE MATRIX EXPONENTIAL
Journal of Computer Science and Electrical Engineering · 2026
DOI: 10.61784/jcsee3153 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Computer Science and Electrical Engineering, 2026. Verfasst von Hang Ye und 2 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
The fundamental solution matrix is a central object in the theoretical study and numerical computation of linear systems of ordinary differential equations with constant coefficients. This paper establishes a unified framework for the algorithmic complexity analysis of seven classical methods, with theoretical comparison from the perspectives of time complexity, space complexity, and numerical stability. Numerical experiments on six classes of typical test matrices are conducted, and quantitative evaluations are performed with respect to computational accuracy, running time, and robustness. The results indicate that the scaling-and-squaring method achieves optimal numerical stability; the eigenvalue decomposition method attains the highest accuracy for diagonalizable well-conditioned matrices; and the direct sum decomposition method significantly outperforms the Jordan canonical form method on non-diagonalizable matrices. A selection strategy is proposed to provide reference for teaching and engineering practice.
Zitieren
APA
Ye, H., Guo, H., & Li, Z. (2026). ALGORITHMIC COMPLEXITY ANALYSIS AND NUMERICAL EXPERIMENTS FOR COMPUTING THE MATRIX EXPONENTIAL. Journal of Computer Science and Electrical Engineering. https://doi.org/10.61784/jcsee3153
Vancouver
Ye H, Guo H, Li Z. ALGORITHMIC COMPLEXITY ANALYSIS AND NUMERICAL EXPERIMENTS FOR COMPUTING THE MATRIX EXPONENTIAL. Journal of Computer Science and Electrical Engineering. 2026. doi:10.61784/jcsee3153
BibTeX
@article{Ye2026,
author = {Ye, Hang and Guo, Hua and Li, ZeDong},
title = {ALGORITHMIC COMPLEXITY ANALYSIS AND NUMERICAL EXPERIMENTS FOR COMPUTING THE MATRIX EXPONENTIAL},
journal = {Journal of Computer Science and Electrical Engineering},
year = {2026},
doi = {10.61784/jcsee3153}
}
EUVIMED