Beyond Paterson-Stockmeyer: Advancing Matrix Polynomial Computation
[EN] Since 1973, the Paterson¿Stockmeyer method has been considered the most efficient approach for evaluating general matrix polynomials. In this paper, we challenge this long-standing belief by demonstrating that newly developed methods surpass its efficiency. We summarize the state of the art and...
| Authors: | , , , |
|---|---|
| Format: | article |
| Publication Date: | 2025 |
| Country: | España |
| Institution: | Universitat Politècnica de València (UPV) |
| Repository: | RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia |
| Language: | English |
| OAI Identifier: | oai:dnet:riunet______::a288a3b1caaec4634a185da2f4bd68a5 |
| Online Access: | https://riunet.upv.es/handle/10251/235361 |
| Access Level: | Open access |
| Keyword: | Matrix polynomial Evaluation Efficient Stability Rational Mixed rational and polynomial Approximation Matrix function 13.- Tomar medidas urgentes para combatir el cambio climático y sus efectos |
| Summary: | [EN] Since 1973, the Paterson¿Stockmeyer method has been considered the most efficient approach for evaluating general matrix polynomials. In this paper, we challenge this long-standing belief by demonstrating that newly developed methods surpass its efficiency. We summarize the state of the art and present new results. Additionally, for decades, rational approximations have been deemed superior to polynomial approximations in terms of computational efficiency. However, we reveal that polynomial approximations can achieve a higher order of accuracy than state-of-the-art rational methods at the same computational cost. Through theoretical insights and practical examples, we illustrate the implications of these findings for advanced matrix computations, with potential applications in scientific computing, numerical analysis, and artificial intelligence. |
|---|