Division of generalized polynomials using the comrade matrix
From MaRDI portal
(Redirected from Publication:800983)
Recommendations
- The division of polynomial matrices
- On the division of polynomial matrices
- Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix
- On the computation of generalized division polynomials
- scientific article; zbMATH DE number 2034379
- A division algorithm for polynomial matrices
- Division by non-singular matric polynomials
- scientific article; zbMATH DE number 3843928
- Divisors of polynomial matrices: Theory and applications
- Matrix multiplication and division of polynomials
Cites work
Cited in
(16)- On the factorization and the inverse of a tridiagonal matrix
- An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials
- Basis-Independent Polynomial Division Algorithm Applied to Division in Lagrange and Bernstein Basis
- A novel elementary algorithm for solving comrade linear systems
- On linear-time solvers for comrade linear systems
- Change of Basis for Products of Orthogonal Polynomials
- Factorization of Hessenberg matrices
- Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix
- Euclidean remainders for generalized polynomials
- Symbolic algorithm for solving comrade linear systems based on a modified stair-diagonal approach
- Multiplication of Generalized Polynomials, with Applications to Classical Orthogonal Polynomials
- Leverrier's algorithm for orthogonal polynomial bases
- scientific article; zbMATH DE number 2034379 (Why is no real title available?)
- A new approach to polynomials
- Decomposition of the infinite companion and interpolation
- scientific article; zbMATH DE number 4071049 (Why is no real title available?)
This page was built for publication: Division of generalized polynomials using the comrade matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q800983)