Algebraic Curve Interpolation for Intervals via Symbolic-Numeric Computation

Lydia Dehbi; Zhengfeng Yang; Chao Peng; Yaochen Xu; Zhenbing Zeng

doi:10.1360/scm-2023-0092

Home/Archive/arXiv

arXiv · 2407.07095

Algebraic Curve Interpolation for Intervals via Symbolic-Numeric Computation

Lydia Dehbi·Zhengfeng Yang·Chao Peng·Yaochen Xu·Zhenbing Zeng

View original source ↗Read source document ↗Export metadata ↓

Abstract

Algebraic curve interpolation is described by specifying the location of N points in the plane and constructing an algebraic curve of a function f that should pass through them. In this paper, we propose a novel approach to construct the algebraic curve that interpolates a set of data (points or neighborhoods). This approach aims to search the polynomial with the smallest degree interpolating the given data. Moreover, the paper also presents an efficient method to reconstruct the algebraic curve of integer coefficients with the smallest degree and the least monomials that interpolates the provided data. The problems are converted into optimization problems and are solved via Lagrange multipliers methods and symbolic computation. Various examples are presented to illustrate the proposed approaches.

Explore related subjects

math.GM

Keep this discovery

BibTeX RIS

Lydia Dehbi, Zhengfeng Yang, Chao Peng, Yaochen Xu, Zhenbing Zeng. 2024-05-20. Algebraic Curve Interpolation for Intervals via Symbolic-Numeric Computation. https://doi.org/10.1360/scm-2023-0092

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM↗

arXiv2026

The decrease in sectional curvature of the Fisher--Rao manifold of beta distributions

In the paper, the author develops a general convexity lemma and applies it to demonstrate the monotonic decrease of a function involving polygamma functions, arising from the sectional curvature of the Fisher--Rao manifold of beta distributions.

math.GM↗

arXiv2026

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM↗