Related papers: Efficient modified Jacobi-Bernstein basis transfor…
We propose a sufficient condition for invertibility of a polynomial mapping function defined on a cube or simplex. This condition is applicable to finite element analysis using curved meshes. The sufficient condition is based on an analysis…
Efficient algorithms are known for many operations on truncated power series (multiplication, powering, exponential, ...). Composition is a more complex task. We isolate a large class of power series for which composition can be performed…
We present an improved Bayesian framework for performing inference of affine transformations of constrained functions. We focus on quadrature with nonnegative functions, a common task in Bayesian inference. We consider constraints on the…
In this short letter, I present a powerful application in dimensionality reduction of the lesser-used Jacobi-Davidson algorithm for the generalized eigenvalue decomposition. When combined with matrix-free implementations of relevant…
Orthogonal systems in $\mathrm{L}_2(\mathbb{R})$, once implemented in spectral methods, enjoy a number of important advantages if their differentiation matrix is skew-symmetric and highly structured. Such systems, where the differentiation…
Quantum neural networks (QNNs) provide expressive probabilistic models by leveraging quantum superposition and entanglement, yet their practical training remains challenging due to highly oscillatory loss landscapes and noise inherent to…
Classical orthogonal polynomials have widespread applications including in numerical integration, solving differential equations, and interpolation. Changing basis between classical orthogonal polynomials can affect the convergence,…
We develop a new kind of nonnegativity certificate for univariate polynomials on an interval. In many applications, nonnegative Bernstein coefficients are often used as a simple way of certifying polynomial nonnegativity. Our proposed…
We address complexity issues for linear differential equations in characteristic $p>0$: resolution and computation of the $p$-curvature. For these tasks, our main focus is on algorithms whose complexity behaves well with respect to $p$. We…
We present an accelerated Schoof-type point-counting algorithm for curves of genus 2 equipped with an efficiently computable real multiplication endomorphism. Our new algorithm reduces the complexity of genus 2 point counting over a finite…
M\"obius inversion of functions on partially ordered sets (posets) $\mathcal{P}$ is a classical tool in combinatorics. For finite posets it consists of two, mutually inverse, linear transformations called zeta and M\"obius transform,…
The Bernstein polynomial basis sees significant use owing to its unique properties, particularly in the field of optimal control. However, the basis is known to have a slow rate of convergence to the function it approximates. With this in…
We develop a theory and an algorithm for constructing minimal-degree polynomial moving frames for polynomial curves in an affine space. The algorithm is equivariant under volume-preserving affine transformations of the ambient space and the…
In the classic polyline simplification problem we want to replace a given polygonal curve $P$, consisting of $n$ vertices, by a subsequence $P'$ of $k$ vertices from $P$ such that the polygonal curves $P$ and $P'$ are as close as possible.…
Efficient computation of shortest cycles which form a homology basis under $\mathbb{Z}_2$-additions in a given simplicial complex $\mathcal{K}$ has been researched actively in recent years. When the complex $\mathcal{K}$ is a weighted graph…
Computing the topology of an algebraic plane curve $\mathcal{C}$ means to compute a combinatorial graph that is isotopic to $\mathcal{C}$ and thus represents its topology in $\mathbb{R}^2$. We prove that, for a polynomial of degree $n$ with…
Many real-world optimisation problems such as hyperparameter tuning in machine learning or simulation-based optimisation can be formulated as expensive-to-evaluate black-box functions. A popular approach to tackle such problems is Bayesian…
This paper studies the effects on Zernike coefficients of aperture scaling, translation and rotation, when a given aberrated wavefront is described on the Zernike polynomial basis. It proposes a new analytical method for computing the…
In this work we present an explicit representation of the orthonormal Bernstein polynomials and demonstrate that they can be generated from a linear combination of non-orthonormal Bernstein polynomials. In addition, we report a set of $n$…
We extend the group law of curves of degree three by chords and tangents to the Jacobi variety of plane curves of degree n>4 by replacing points by point groups and lines by algebraic curves. The curves are nonsingular or have simple…