Fast parallel computation of characteristic polynomials by Leverrier's power sum method adapted to fields of finite characteristic

DOI10.1007/3-540-56939-1_90zbMath1422.68330OpenAlexW1559471605MaRDI QIDQ4630279

Arnold Schönhage

Publication date: 29 March 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-56939-1_90

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Parallel algorithms in computer science (68W10)

Related Items (3)

Parallel computation of polynomial GCD and some related parallel computations over abstract fields ⋮ New techniques for the computation of linear recurrence coefficients ⋮ Fast computation of special resultants

Cites Work

• On computing the determinant in small parallel time using a small number of processors
• An improved parallel processor bound in fast matrix inversion
• Fast Parallel Matrix Inversion Algorithms
• Fast parallel matrix and GCD computations
• Unnamed Item

This page was built for publication: Fast parallel computation of characteristic polynomials by Leverrier's power sum method adapted to fields of finite characteristic