Computing Characteristic Polynomials of Matrices of Structured Polynomials

DOI10.1007/978-3-319-45641-6_22zbMath1365.68497OpenAlexW2515908536MaRDI QIDQ2830011

Marshall Law, Michael B. Monagan

Publication date: 9 November 2016

Published in: Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL: http://summit.sfu.ca/item/17301

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Matrices over function rings in one or more variables (15A54) Computational methods for problems pertaining to field theory (12-08)

Related Items (1)

Computing characteristic polynomials of matrices of structured polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• On computing the determinant in small parallel time using a small number of processors
• A new truncated fourier transform algorithm
• Probabilistic Algorithms in Finite Fields
• The truncated fourier transform and applications
• Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination

This page was built for publication: Computing Characteristic Polynomials of Matrices of Structured Polynomials