Pages that link to "Item:Q5961649"
From MaRDI portal
The following pages link to Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologies (Q5961649):
Displaying 15 items.
- Approximate least common multiple of several polynomials using the ERES division algorithm (Q331163) (← links)
- An improved Toeplitz algorithm for polynomial matrix null-space computation (Q1004243) (← links)
- A fast and numerically stable Euclidean-like algorithm for detecting relatively prime numerical polynomials (Q1281845) (← links)
- A matrix Euclidean algorithm induced by state space realization (Q1300871) (← links)
- Normal factorisation of polynomials and computational issues. (Q1416384) (← links)
- Blind image deconvolution via Hankel based method for computing the GCD of polynomials (Q1996974) (← links)
- A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials (Q2400326) (← links)
- Computing the polynomial remainder sequence via Bézout matrices (Q2448361) (← links)
- Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials (Q2511181) (← links)
- Further numerical aspects of the ERES algorithm for the computation of the greatest common divisor of polynomials and comparison with other existing methodologies (Q2785714) (← links)
- On the Computation of the GCD of 2-D Polynomials (Q3089756) (← links)
- Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance (Q5423857) (← links)
- On rank and null space computation of the generalized Sylvester matrix (Q5962121) (← links)
- Revisiting the Matrix Polynomial Greatest Common Divisor (Q6116668) (← links)
- The \(k\)-compound of a difference-algebraic system (Q6537347) (← links)
