Pages that link to "Item:Q800983"
From MaRDI portal
The following pages link to Division of generalized polynomials using the comrade matrix (Q800983):
Displaying 12 items.
- A novel elementary algorithm for solving comrade linear systems (Q273373) (← links)
- Factorization of Hessenberg matrices (Q739107) (← links)
- Euclidean remainders for generalized polynomials (Q1108743) (← links)
- Leverrier's algorithm for orthogonal polynomial bases (Q1911435) (← links)
- On linear-time solvers for comrade linear systems (Q2332725) (← links)
- Symbolic algorithm for solving comrade linear systems based on a modified stair-diagonal approach (Q2339092) (← links)
- An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials (Q2564953) (← links)
- Multiplication of Generalized Polynomials, with Applications to Classical Orthogonal Polynomials (Q3216886) (← links)
- Basis-Independent Polynomial Division Algorithm Applied to Division in Lagrange and Bernstein Basis (Q3597981) (← links)
- Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix (Q3597983) (← links)
- Change of Basis for Products of Orthogonal Polynomials (Q3794677) (← links)
- On the factorization and the inverse of a tridiagonal matrix (Q5059589) (← links)
