Faster algorithms for the characteristic polynomial

zbMATH Open1190.68032MaRDI QIDQ5301686FDOQ5301686

Clément Pernet, Arne Storjohann

Publication date: 20 January 2009

Recommendations

• Deterministic computation of the characteristic polynomial in the time of matrix multiplication
• Efficient computation of the characteristic polynomial
• Calculation of the characteristic polynomial of a matrix
• Computing minimal polynomials of matrices
• scientific article; zbMATH DE number 1256647

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20)

Cited In (16)

• Berkowitz's algorithm and clow sequences
• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficient parallel computation of the characteristic polynomial of a sparse, separable matrix
• Efficient Computation of the Characteristic Polynomial of a Threshold Graph
• Deterministic computation of the characteristic polynomial in the time of matrix multiplication
• Title not available (Why is that?)
• Fast recursive computation of Krawtchouk polynomials
• Dynamic normal forms and dynamic characteristic polynomial
• Elimination-based certificates for triangular equivalence and rank profiles
• Efficient algorithms for computing the characteristic polynomial in a domain
• Title not available (Why is that?)
• A fast randomized geometric algorithm for computing Riemann-Roch spaces
• Efficient computation of the characteristic polynomial of a threshold graph
• Matrix rank certification
• Fast algorithms for the characteristic polynomial

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)