This paper introduces a novel recursive algorithm for inverting matrix polynomials, developed as a generalized extension of the classical Leverrier–Faddeev scheme. The approach is motivated by the need for scalable and efficient inversion techniques in applications such as system analysis, control, and FEM-based structural modeling, where matrix polynomials naturally arise. The proposed algorithm is fully numerical, recursive, and division free, making it suitable for large-scale computation. Validation is performed through a finite element simulation of the transverse vibration of a fighter aircraft wing. Results confirm the method’s accuracy, robustness, and computational efficiency in computing characteristic polynomials and adjugate-related forms, supporting its potential for broader application in control, structural analysis, and future extensions to structured or nonlinear matrix systems.
No takes yet. Share an insight, caveat, or question.
Bekhiti et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: