Computing characteristic polynomials of matrices of structured polynomials

DOI10.1007/978-3-319-45641-6_22MaRDI QIDQ2830011zbMATH OpenOpenAlexFDO

Authors Marshall Law, Michael 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

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

Recommendations

• Efficient computation of the characteristic polynomial
• A modular algorithm for computing the characteristic polynomial of an integer matrix in Maple
• Deterministic computation of the characteristic polynomial in the time of matrix multiplication
• Calculation of the characteristic polynomial of a matrix
• Fast parallel computation of characteristic polynomials by Leverrier's power sum method adapted to fields of finite characteristic

Cites work

• A new truncated Fourier transform algorithm
• scientific article; zbMATH DE number 108109 (Why is no real title available?)
• scientific article; zbMATH DE number 1936673 (Why is no real title available?)
• On computing the determinant in small parallel time using a small number of processors
• Probabilistic Algorithms in Finite Fields
• Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
• The truncated fourier transform and applications

Cited in

(11)

• Computing the characteristic polynomial of multivariate polynomial matrices given by straight-line programs
• On finding multiplicities of characteristic polynomial factors of black-box matrices
• scientific article; zbMATH DE number 4199470 (Why is no real title available?)
• A modular algorithm for computing the characteristic polynomial of an integer matrix in Maple
• Fast parallel computation of characteristic polynomials by Leverrier's power sum method adapted to fields of finite characteristic
• Commuting row contractions with polynomial characteristic functions
• Efficient computation of the characteristic polynomial
• Computing characteristic polynomials of matrices of structured polynomials
• scientific article; zbMATH DE number 2214031 (Why is no real title available?)
• Efficient parallel computation of the characteristic polynomial of a sparse, separable matrix
• Systolic computation of characteristic polynomials of Hessenberg matrices

This page was built for publication: Computing characteristic polynomials of matrices of structured polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2830011)