Structured low rank approximations of the sylvester resultant matrix for approximate GCDS of Bernstein basis polynomials
From MaRDI portal
Publication:836798
zbMath1171.65039MaRDI QIDQ836798
Winkler, Joab R., John D. Allan
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 example; Bernstein polynomials; Sylvester resultant matrix; structured low rank approximation; greatest common divisors (GCDs)
65F35: Numerical computation of matrix norms, conditioning, scaling
15A12: Conditioning of matrices
11A05: Multiplicative structure; Euclidean algorithm; greatest common divisors
Related Items
A quadratically convergent algorithm for structured low-rank approximation, Overdetermined Weierstrass iteration and the nearest consistent system, The calculation of the degree of an approximate greatest common divisor of two polynomials, A unified approach to resultant matrices for 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
Uses Software