Structured low rank approximations of the sylvester resultant matrix for approximate GCDS of Bernstein basis polynomials
From MaRDI portal
Publication:836798
zbMath1171.65039MaRDI QIDQ836798
John D. Allan, Winkler, Joab R.
Publication date: 8 September 2009
Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/130629
numerical exampleBernstein polynomialsSylvester resultant matrixstructured low rank approximationgreatest common divisors (GCDs)
Numerical computation of matrix norms, conditioning, scaling (65F35) Conditioning of matrices (15A12) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)
Related Items
A quadratically convergent algorithm for structured low-rank approximation ⋮ The calculation of the degree of an approximate greatest common divisor of two polynomials ⋮ Overdetermined Weierstrass iteration and the nearest consistent system ⋮ The computation of the degree of the greatest common divisor of three Bernstein basis polynomials ⋮ A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix ⋮ Low rank approximation of the symmetric positive semidefinite matrix ⋮ A unified approach to resultant matrices for Bernstein basis polynomials ⋮ Structured low-rank approximation: optimization on matrix manifold approach
Uses Software
