Efficient algorithms for computing the characteristic polynomial in a domain, Journal of Pure and Applied Algebra, vol.156, issue.2-3, pp.127-145, 2001. ,
On computing the determinant in small parallel time using a small number of processors, Information Processing Letters, vol.18, issue.3, pp.147-150, 1984. ,
Fast Algorithms for Manipulating Formal Power Series, Journal of the ACM, vol.25, issue.4, pp.581-595, 1978. ,
Characteristic Polynomials of p-adic Matrices, Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01458027
A Course in Computational Algebraic Number Theory, 1996. ,
Fast Parallel Matrix Inversion Algorithms, SIAM Journal on Computing, vol.5, issue.4, pp.618-623, 1976. ,
Preprint repository arXiv achieves milestone million uploads, Physics Today, 2014. ,
Efficient computation of the characteristic polynomial, Proceedings of the 2005 international symposium on Symbolic and algebraic computation - ISSAC '05, 2005. ,
URL : https://hal.archives-ouvertes.fr/hal-00004056
Powers of tensors and fast matrix multiplication, Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation -ISSAC'14, 2014. ,
Fast Library for Number Theory: An Introduction, Mathematical Software ? ICMS 2010, pp.88-91, 2010. ,
ANTIC: Algebraic number theory in C, Computeralgebra-Rundbrief, vol.56, 2015. ,
On Faddeev-Leverrier's method for the computation of the characteristic polynomial of a matrix and of eigenvectors, Linear Algebra and its Applications, vol.185, pp.219-233, 1993. ,
Classroom Note:A Simple Proof of the Leverrier--Faddeev Characteristic Polynomial Algorithm, SIAM Review, vol.40, issue.3, pp.706-709, 1998. ,
A fast algorithm for reversion of power series, Mathematics of Computation, vol.84, issue.291, pp.475-484, 2014. ,
Arb: Efficient Arbitrary-Precision Midpoint-Radius Interval Arithmetic, IEEE Transactions on Computers, vol.66, issue.8, pp.1281-1292, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01394258
Faster Arbitrary-Precision Dot Product and Matrix Multiplication, 2019 IEEE 26th Symposium on Computer Arithmetic (ARITH), 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-01980399
On computing determinants of matrices without divisions, Papers from the international symposium on Symbolic and algebraic computation - ISSAC '92, 1992. ,
On the complexity of computing determinants, computational complexity, vol.13, issue.3-4, pp.91-130, 2005. ,
URL : https://hal.archives-ouvertes.fr/hal-02102099
Preprint repository arXiv achieves milestone million uploads, Physics Today, 2014. ,
On the number of nonscalar multiplications necessary to evaluate polynomials, SIAM Journal on Computing, vol.2, issue.1, pp.60-66, 1973. ,
Faster algorithms for the characteristic polynomial, Proceedings of the 2007 international symposium on Symbolic and algebraic computation - ISSAC '07, 2007. ,
Preprint repository arXiv achieves milestone million uploads, Physics Today, 2014. ,
Verification methods: Rigorous results using floating-point arithmetic, Acta Numerica, vol.19, pp.287-449, 2010. ,
, Appendix: Answers to Exercises, The Sage Developers. SageMath, the Sage Mathematics Software System (Version 9, pp.401-446, 2018.
Sur les variations séculaire desélements des orbites pour les sept planétes principales, J. de Math, issue.1, 1840. ,
Kaltofen?s division-free determinant algorithm differentiated for matrix adjoint computation, Journal of Symbolic Computation, vol.46, issue.7, pp.773-790, 2011. ,
The algebraic eigenvalue problem, vol.87, 1965. ,