Division of generalized polynomials using the comrade matrix
From MaRDI portal
Publication:800983
DOI10.1016/0024-3795(84)90077-6zbMath0552.15003OpenAlexW1969455262MaRDI QIDQ800983
Publication date: 1984
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(84)90077-6
Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Polynomials in real and complex fields: factorization (12D05) Canonical forms, reductions, classification (15A21)
Related Items
A novel elementary algorithm for solving comrade linear systems ⋮ On the factorization and the inverse of a tridiagonal matrix ⋮ Euclidean remainders for generalized polynomials ⋮ Leverrier's algorithm for orthogonal polynomial bases ⋮ Multiplication of Generalized Polynomials, with Applications to Classical Orthogonal Polynomials ⋮ Change of Basis for Products of Orthogonal Polynomials ⋮ Basis-Independent Polynomial Division Algorithm Applied to Division in Lagrange and Bernstein Basis ⋮ Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix ⋮ Factorization of Hessenberg matrices ⋮ An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials ⋮ On linear-time solvers for comrade linear systems ⋮ Symbolic algorithm for solving comrade linear systems based on a modified stair-diagonal approach
Cites Work
This page was built for publication: Division of generalized polynomials using the comrade matrix
