scientific article; zbMATH DE number 871951

zbMATH Open0846.65006MaRDI QIDQ4875226FDOQ4875226

Victor Y. Pan

Publication date: 4 September 1996

Title of this publication is not available (Why is that?)

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

• Computation of approximate polynomial GCDs and an extension 👍 👎
• Parallel computation of polynomial GCD and some related parallel computations over abstract fields 👍 👎
• Rapid parallel computation of degrees in a quotient ring of polynomials over a finite field 👍 👎
• A fast parallel sparse polynomial GCD algorithm 👍 👎
• A Fast Parallel Sparse Polynomial GCD Algorithm 👍 👎
• Parallel algorithms on greatest common divisor of polynomial system 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)