Parallel computation of polynomial GCD and some related parallel computations over abstract fields
type: Item
instance of: scholarly article
title: Parallel computation of polynomial GCD and some related parallel computations over abstract fields
zbMATH Open document ID: 0874.12010
DOI: 10.1016/0304-3975(96)00030-8
published in: Theoretical Computer Science
publication date: 1997-09-10T00:00:00Z
Mathematics Subject Classification ID: 12Y05
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 65F05
zbMATH DE Number: 1059057
zbMATH Keywords: parallel computations
zbMATH Keywords: Cauchy matrices
zbMATH Keywords: Vandermonde matrices
zbMATH Keywords: Hankel matrices
zbMATH Keywords: gcd
zbMATH Keywords: lcm
zbMATH Keywords: resultant
zbMATH Keywords: coefficients of a linear recurrence sequence
zbMATH Keywords: ranks
zbMATH Keywords: null-spaces
zbMATH Keywords: Toeplitz matrices
zbMATH Keywords: randomized parallel arithmetic complexity
zbMATH Keywords: recursive Padé approximation
zbMATH Keywords: algebraic coding
author: Victor Y. Pan
MaRDI profile type: Publication
full work available at URL: 0304-3975(96)00030-8
OpenAlex ID: W2030911590
cites work: On the computational power of pushdown automata
cites work: Superfast Solution of Real Positive Definite Toeplitz Systems
cites work: Q4061081
cites work: Simple algorithms for approximating all roots of a polynomial with real roots
cites work: Q5598073
cites work: On computing the determinant in small parallel time using a small number of processors
cites work: Fast Parallel Computation of the Polynomial Remainder Sequence via Bézout and Hankel Matrices
cites work: Q3138975
cites work: Improved Parallel Polynomial Division
cites work: Q4234196
cites work: Q4314299
cites work: Asymptotically fast solution of Toeplitz and related systems of linear equations
cites work: Fast parallel matrix and GCD computations
cites work: The Parallel Evaluation of General Arithmetic Expressions
cites work: Fast solution of toeplitz systems of equations and computation of Padé approximants
cites work: On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
cites work: On Euclid's Algorithm and the Theory of Subresultants
cites work: On fast multiplication of polynomials over arbitrary algebras
cites work: Q3719722
cites work: Fast Parallel Algorithms for QR and Triangular Factorization
cites work: Divide-and-Conquer Solutions of Least-Squares Problems for Matrices with Displacement Structure
cites work: Subresultants and Reduced Polynomial Remainder Sequences
cites work: Matrix multiplication via arithmetic progressions
cites work: Fast Parallel Matrix Inversion Algorithms
cites work: A new algorithm for solving Toeplitz systems of equations
cites work: A probabilistic remark on algebraic program testing
cites work: Parallel evaluation of the determinant and of the inverse of a matrix
cites work: Parallel Algorithms for Algebraic Problems
cites work: The Padé Table and Its Relation to Certain Algorithms of Numerical Analysis
cites work: Q4764036
cites work: Q4023519
cites work: A view of three decades of linear filtering theory
cites work: Q3787908
cites work: Q4733961
cites work: Displacement ranks of matrices and linear equations
cites work: Inverses of Toeplitz Operators, Innovations, and Orthogonal Polynomials
cites work: Q4234327
cites work: Q4279517
cites work: Q4228446
cites work: Q4038737
cites work: Q4385522
cites work: Lattice filter parameterization and modeling of nonstationary processes
cites work: Q3732964
cites work: Complexity of parallel matrix computations
cites work: Root-squaring with DPR1 matrices
cites work: Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros
cites work: Q4001760
cites work: Parametrization of Newton's iteration for computations with structured matrices and applications
cites work: Complexity of Computations with Matrices and Polynomials
cites work: Parallel solution of Toeplitzlike linear systems

Parallel computation of polynomial GCD and some related parallel computations over abstract fields (cites work)
cites work: Decreasing the Displacement Rank of a Matrix

Parallel computation of polynomial GCD and some related parallel computations over abstract fields (cites work)
cites work: Optimal and nearly optimal algorithms for approximating polynomial zeros

Parallel computation of polynomial GCD and some related parallel computations over abstract fields (cites work)
cites work: Q4717956

Parallel computation of polynomial GCD and some related parallel computations over abstract fields (cites work)
cites work: Work-Preserving Speed-Up of Parallel Matrix Computations

Parallel computation of polynomial GCD and some related parallel computations over abstract fields (cites work)
cites work: The parallel computation of minimum cost paths in graphs by stream contraction

Parallel computation of polynomial GCD and some related parallel computations over abstract fields (cites work)
cites work: A new approach to fast polynomial interpolation and multipoint evaluation

Parallel computation of polynomial GCD and some related parallel computations over abstract fields (cites work)
cites work: An improved parallel processor bound in fast matrix inversion

Parallel computation of polynomial GCD and some related parallel computations over abstract fields (cites work)
cites work: Q4234126

Parallel computation of polynomial GCD and some related parallel computations over abstract fields (cites work)
cites work: Fast parallel computation of characteristic polynomials by Leverrier's power sum method adapted to fields of finite characteristic

Parallel computation of polynomial GCD and some related parallel computations over abstract fields (cites work)
cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities

Parallel computation of polynomial GCD and some related parallel computations over abstract fields (cites work)
cites work: Fast construction of irreducible polynomials over finite fields

Parallel computation of polynomial GCD and some related parallel computations over abstract fields (cites work)
cites work: Q4324960

Parallel computation of polynomial GCD and some related parallel computations over abstract fields (cites work)
cites work: Solving sparse linear equations over finite fields

Parallel computation of polynomial GCD and some related parallel computations over abstract fields (cites work)
cites work: Q3851616

Parallel computation of polynomial GCD and some related parallel computations over abstract fields (cites work)
cites work: Q3359644

Parallel computation of polynomial GCD and some related parallel computations over abstract fields (cites work)
cites work: Q4002466

Parallel computation of polynomial GCD and some related parallel computations over abstract fields (Wikidata QID)
Wikidata QID: Q127526100