An algorithm for implicit interpolation

DOI10.1007/S00200-014-0213-8zbMATH Open1302.13027OpenAlexW2000741931MaRDI QIDQ744017FDOQ744017

Authors: Nardo Giménez 

Publication date: 2 October 2014

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-014-0213-8

Recommendations

• scientific article; zbMATH DE number 3876580
• Computational Aspects of Polynomial Interpolation in Several Variables
• Interpolation problems on algebraic manifolds
• Constructive theory of multivariate rational interpolation of degree zero and its algorithm
• Diversification improves interpolation

zbMATH Keywords

trace theorymultivariate polynomial interpolationgeometric solutionszero dimensional polynomial ideals

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Cites Work

• A concise proof of the Kronecker polynomial system solver from scratch
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computational methods of linear algebra
• The complexity of partial derivatives
• Sharp estimates for the arithmetic Nullstellensatz
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Exact solution of linear equations using p-adic expansions
• Straight-line programs in geometric elimination theory
• Generic local structure of the morphisms in commutative algebra
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Gröbner free alternative for polynomial system solving
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Gröbner bases of ideals defined by functionals with an application to ideals of projective points
• On multivariate polynomial interpolation
• Introduction to the solution of polynomial systems
• On the efficiency of effective Nullstellensätze
• Title not available (Why is that?)
• On the history of multivariate polynomial interpolation
• Title not available (Why is that?)
• Polynomial interpolation in several variables
• On the effective Nullstellensatz
• Modern computer algebra
• Definability and fast quantifier elimination in algebraically closed fields
• H-bases for polynomial interpolation and system solving
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Gröbner bases, H-bases and interpolation
• Lower bounds for diophantine approximations
• The least solution for the polynomial interpolation problem
• Sharper complexity bounds for zero-dimensional Gröbner bases and polynomial system solving
• Title not available (Why is that?)
• On the time-space complexity of geometric elimination procedures
• Title not available (Why is that?)
• On the intrinsic complexity of the arithmetic Nullstellensatz
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficient polynomial reduction

Cited In (12)

• Title not available (Why is that?)
• Interpolation of polynomials given by straight-line programs
• An Algorithm for Constrained Interpolation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computational aspects of multivariate polynomial interpolation: Indexing the coefficients
• An implicitization algorithm with fewer variables
• Title not available (Why is that?)
• Multihomogeneous polynomial interpolation over \(\mathbb Z\)
• Computational Aspects of Polynomial Interpolation in Several Variables
• Advanced algorithm for interpolation with Wendland functions

Uses Software

• Kronecker

This page was built for publication: An algorithm for implicit interpolation

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