Bounds on the coefficients of the characteristic and minimal polynomials
Jean-Guillaume Dumas
Abstract
This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associated matrix. Moreover, we present algorithms to compute more precise input-dependant bounds on these coefficients. Such bounds are e.g. useful to perform deterministic chinese remaindering of the characteristic or minimal polynomial of an integer matrix.
Create a lesson
Related papers
StabQ: Quantum Program Analysis via Weighted Stabilizer Representations
Shangzhou Xia, Junjie Luo, Jianjun Zhao
Least-Squares and Low-Rank Approximation for Linear Relations Using a Diagrammatic Language
Júlia de Araújo Mota, Iago Leal de Freitas, Lucas Rufino et al.
AutoSR: Automatic Symbolic Regression by Searching Research States
Kejia Zhang, Youran Sun, Xinyu Ren et al.
Stationarity is not enough: tightness of the quantum mechanical bootstrap and the copositive cone
Daniel Keren
Technical Report: A Formal Semantics for Java Symbolic Evaluation using Large-Block Encoding
Soha Hussein, Stephen McCamant, Kelton OBrien et al.
Complete Reduction for Derivatives in a Transcendental Liouvillian Extension
Shaoshi Chen, Hao Du, Yiman Gao et al.