Approximate GCD by bernstein basis, and its applications

DOI10.1145/3373207.3403991OpenAlexW3046108013WikidataQ131130485 ScholiaQ131130485MaRDI QIDQ5145998FDOQ5145998

Authors: Kosaku Nagasaka 

Publication date: 22 January 2021

Published in: Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3373207.3403991

Recommendations

• Approximate GCD in Bernstein basis
• The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials
• Structured low rank approximations of the sylvester resultant matrix for approximate GCDS of Bernstein basis polynomials
• Structure preserving methods for the computation of approximate GCDs of Bernstein polynomials
• Computation of approximate polynomial GCDs and an extension

zbMATH Keywords

Bernstein polynomial basisapproximate GCDrational function approximationPadé approximation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cited In (4)

• Relaxed NewtonSLRA for approximate GCD
• Approximate GCD and its application to ill-conditioned algebraic equations
• Approximate GCD of several multivariate sparse polynomials based on SLRA interpolation
• SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials

Uses Software

• AAA

This page was built for publication: Approximate GCD by bernstein basis, and its applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145998)