Pages that link to "Item:Q2480912"

The following pages link to Structured total least norm and approximate GCDs of inexact polynomials (Q2480912):

Displaying 10 items.

• Approximate least common multiple of several polynomials using the ERES division algorithm (Q331163) (← links)
• The calculation of the degree of an approximate greatest common divisor of two polynomials (Q611832) (← links)
• A unified approach to resultant matrices for Bernstein basis polynomials (Q735500) (← links)
• A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix (Q989131) (← links)
• The computation of the degree of the greatest common divisor of three Bernstein basis polynomials (Q1989191) (← links)
• Blind image deconvolution via Hankel based method for computing the GCD of polynomials (Q1996974) (← links)
• Variable projection methods for approximate (greatest) common divisor computations (Q2357371) (← links)
• Computing the polynomial remainder sequence via Bézout matrices (Q2448361) (← links)
• Low rank approximation of the symmetric positive semidefinite matrix (Q2511200) (← links)
• Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach (Q2656632) (← links)