We define the notion of approximate affine equivalence for polynomially parametrized curves and trigonometric curves, i.e., curves parametrized by truncated Fourier series, whose coefficients are floating point numbers, therefore known up to finite precision, and provide symbolic-numeric algorithms in any dimension to compute the approximate affine equivalences between such curves. In order to do this, we first develop the notion of approximate equivalence in norm , which leads to concrete algorithms, and then we analyze the relationship between closeness in norm, and closeness in terms of the Hausdorff distance. The algorithms have been implemented in the computer algebra system Maple; we report on experiments carried out with these algorithms to provide evidence of their efficiency.
Approximate Affine Equivalences of Polynomial and Trigonometric Curves. // Bulletin of Materials Science. – 2026. – DOI: 10.1007/s11786-026-00625-9. – URL: https://link.springer.com/article/10.1007/s11786-026-00625-9
(2026). Approximate Affine Equivalences of Polynomial and Trigonometric Curves. Bulletin of Materials Science. https://doi.org/10.1007/s11786-026-00625-9
“Approximate Affine Equivalences of Polynomial and Trigonometric Curves.” Bulletin of Materials Science, 2026. doi:10.1007/s11786-026-00625-9.
@article{article34439,
title = {Approximate Affine Equivalences of Polynomial and Trigonometric Curves},
journal = {Bulletin of Materials Science},
year = {2026},
doi = {10.1007/s11786-026-00625-9},
url = {https://link.springer.com/article/10.1007/s11786-026-00625-9}
}
A multivariate polynomial $f$ is decomposable if $f$ is a composition $f=u\circ h$, where $u$ is a univariate polynomial of degree greater than one and $h$ is a multivariate polynomial. We consider the problem of computing the nearest...
Cancer is a major cause of mortality, yet the mechanisms governing its growth, progression, and elimination remain incompletely understood. Mathematical modeling not only clarifies these complex processes but also provides clinicians...
Residue number systems based on pairwise relatively prime moduli are a powerful tool for accelerating integer computations via the Chinese Remainder Theorem. We study a structured family of moduli of the form $2^{n} - 2^{k} + 1$,...
This work is devoted to the symbolic computation of centralizers of ordinary differential operators (ODOs), in the ring of differential operators. Starting with an operator $L$ of order $n$ and the order $\mathfrak{m}$ of a non-trivial...
In this work, we address the problem of expressing sequences of $d$-orthogonal polynomials in terms of either orthogonal polynomials or the canonical basis. We derive a general recurrence relation that enables the symbolic recursive...