Pages that link to "Item:Q836798"

The following pages link to Structured low rank approximations of the sylvester resultant matrix for approximate GCDS of Bernstein basis polynomials (Q836798):

Displaying 8 items.

• A quadratically convergent algorithm for structured low-rank approximation (Q285440) (← links)
• Overdetermined Weierstrass iteration and the nearest consistent system (Q476879) (← 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)
• Structured low-rank approximation: optimization on matrix manifold approach (Q2114475) (← links)
• Low rank approximation of the symmetric positive semidefinite matrix (Q2511200) (← links)