Faster algorithms for the characteristic polynomial
From MaRDI portal
Recommendations
Cited in
(23)- Fast algorithms for the characteristic polynomial
- Fast recursive computation of Krawtchouk polynomials
- Deterministic computation of the characteristic polynomial in the time of matrix multiplication
- Elimination-based certificates for triangular equivalence and rank profiles
- The RCH method for computing minimal polynomials of polynomial matrices
- Berkowitz's algorithm and clow sequences
- On finding multiplicities of characteristic polynomial factors of black-box matrices
- Calculation of the characteristic polynomial of a matrix
- Efficient computation of the characteristic polynomial of a threshold graph
- scientific article; zbMATH DE number 4151735 (Why is no real title available?)
- Matrix rank certification
- Fast parallel computation of characteristic polynomials by Leverrier's power sum method adapted to fields of finite characteristic
- scientific article; zbMATH DE number 1929930 (Why is no real title available?)
- scientific article; zbMATH DE number 2086387 (Why is no real title available?)
- Efficient computation of the characteristic polynomial of a threshold graph
- A fast randomized geometric algorithm for computing Riemann-Roch spaces
- Efficient computation of the characteristic polynomial
- scientific article; zbMATH DE number 7329538 (Why is no real title available?)
- Efficient algorithms for computing the characteristic polynomial in a domain
- Efficient parallel computation of the characteristic polynomial of a sparse, separable matrix
- Dynamic normal forms and dynamic characteristic polynomial
- Algorithms for computing norms and characteristic polynomials on general Drinfeld modules
- Computing Krylov iterates in the time of matrix multiplication
This page was built for publication: Faster algorithms for the characteristic polynomial
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301686)
