A Method to Compute Minimal Polynomials

DOI10.1137/0606029MaRDI QIDQ3735078zbMATH OpenOpenAlexFDO

Authors Barbara R. Peskin, David R. Richman

Publication date 1985

Published in SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0606029

zbMATH Keywords

algorithmfinite fieldirreducible polynomial

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Polynomials in general fields (irreducibility, etc.) (12E05)

Recommendations

• On the computation of minimal polynomials
• Computing and using minimal polynomials
• An algorithm for a result on minimal polynomials
• On the computation of the minimal polynomial of a polynomial matrix
• Computing minimal polynomials of matrices
• scientific article; zbMATH DE number 4162881
• A complete algorithm to find exact minimal polynomial by approximations
• Finding exact minimal polynomial by approximations
• scientific article; zbMATH DE number 4032524
• New method of minimal polynomial construction

Cites work

• scientific article; zbMATH DE number 3121635 (Why is no real title available?)
• scientific article; zbMATH DE number 3463763 (Why is no real title available?)
• scientific article; zbMATH DE number 3506774 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3518934 (Why is no real title available?)
• scientific article; zbMATH DE number 3611267 (Why is no real title available?)
• scientific article; zbMATH DE number 3330441 (Why is no real title available?)
• scientific article; zbMATH DE number 3351382 (Why is no real title available?)
• scientific article; zbMATH DE number 3397423 (Why is no real title available?)
• scientific article; zbMATH DE number 3197115 (Why is no real title available?)
• Algebraic coding theory
• Generation of Irreducible Polynomials Over a Finite Field
• On the Asymptotic Complexity of Matrix Multiplication
• On the computation of minimal polynomials

Cited in

(14)

• scientific article; zbMATH DE number 4127340 (Why is no real title available?)
• Computing and using minimal polynomials
• A new proof of the Abhyankar-Moh-Suzuki theorem via a new algorithm for the polynomial dependence
• New method of minimal polynomial construction
• The algebraic degree of geometric optimization problems
• Finding exact minimal polynomial by approximations
• An extension of the Krylov method for calculating the coefficients of the minimal polynomial
• scientific article; zbMATH DE number 6319030 (Why is no real title available?)
• Minimal polynomial of an algebraic number
• On a problem of Dvornicich and Zannier
• Computing minimal polynomial of matrices over algebraic extension fields
• On the computation of minimal polynomials
• Minimal polynomial and reduced rank extrapolation methods are related
• On the Newton polyhedron of a Jacobian pair

This page was built for publication: A Method to Compute Minimal Polynomials

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