scientific article; zbMATH DE number 871951

MaRDI QIDQ4875226zbMATH OpenFDO

Authors Victor Y. Pan

Publication date 4 September 1996

zbMATH Keywords

computational complexityparallel computationgreatest common divisorgcd of two polynomialsToeplitz linear systemPadé approximantsBerlekamp-Massey problemToeplitz, Hankel, Vandermonde or Cauchy matrices

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Direct numerical methods for linear systems and matrix inversion (65F05) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Parallel computation of polynomial GCD and some related parallel computations over abstract fields
• scientific article; zbMATH DE number 1263395
• Rapid parallel computation of degrees in a quotient ring of polynomials over a finite field
• Parallel algorithms on greatest common divisor of polynomial system
• scientific article; zbMATH DE number 4062581
• A fast parallel sparse polynomial GCD algorithm
• A fast parallel sparse polynomial GCD algorithm
• scientific article; zbMATH DE number 1273687
• scientific article; zbMATH DE number 1263394
• Computation of approximate polynomial GCDs and an extension

Cited in

(2)

• Parallel algorithms on greatest common divisor of polynomial system
• Parallel Algorithms for Algebraic Problems

This page was built for publication:

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