Structured low rank approximations of the sylvester resultant matrix for approximate GCDS of Bernstein basis polynomials
zbMATH Open1171.65039MaRDI QIDQ836798FDOQ836798
Authors: John D. Allan, Joab R. Winkler 
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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- Structure preserving methods for the computation of approximate GCDs of Bernstein polynomials
- scientific article; zbMATH DE number 5168246
- Resultant matrices and the computation of the degree of an approximate greatest common divisor of two inexact Bernstein basis polynomials
- Structured total least norm and approximate GCDs of inexact polynomials
- The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials
Bernstein polynomialsnumerical exampleSylvester 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)
Cited In (13)
- The computation of the degree of the greatest common divisor of three Bernstein basis polynomials
- Structured total least norm and approximate GCDs of inexact polynomials
- Structured low-rank approximation: optimization on matrix manifold approach
- A quadratically convergent algorithm for structured low-rank approximation
- An improved non-linear method for the computation of a structured low rank approximation of the Sylvester resultant matrix
- 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
- A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials
- Low rank approximation of the symmetric positive semidefinite matrix
- Structure preserving methods for the computation of approximate GCDs of Bernstein polynomials
- Overdetermined Weierstrass iteration and the nearest consistent system
- Resultant matrices and the computation of the degree of an approximate greatest common divisor of two inexact Bernstein basis polynomials
Uses Software
This page was built for publication: Structured low rank approximations of the sylvester resultant matrix for approximate GCDS of Bernstein basis polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q836798)
