An Approximate Decomposition of a Multivariate Polynomial and Its Application

Key Points

• The research aims to develop a method for approximating the decomposition of multivariate polynomials using specific mathematical frameworks.
• Approximation of a multivariate polynomial using Hamming distance.
• Decomposition represented as f = g ∘ h + δ, where δ has few terms.
• Algorithm proposed for computing this approximate decomposition.
• Application of the method in the context of multivariate Horner's scheme.
• The proposed algorithm successfully computes the approximate decomposition of multivariate polynomials.
• The Hamming distance effectively measures the approximation accuracy.
• The application shows practical utility in optimizing polynomial evaluations.