Related papers: Complexity of Creative Telescoping for Bivariate R…
The Loewner framework is an interpolatory approach for the approximation of linear and nonlinear systems. The purpose here is to extend this framework to linear parametric systems with an arbitrary number n of parameters. To achieve this, a…
The problem of computing recurrence coefficients of sequences of rational functions orthogonal with respect to a discrete inner product is formulated as an inverse eigenvalue problem for a pencil of Hessenberg matrices. Two procedures are…
Symbolic Regression searches for a function form that approximates a dataset often using Genetic Programming. Since there is usually no restriction to what form the function can have, Genetic Programming may return a hard to understand…
We present an abstract multiscale analysis scheme for matrix functions $(H_{\varepsilon}(m,n))_{m,n\in \mathfrak{T}}$, where $\mathfrak{T}$ is an Abelian group equipped with a distance $|\cdot|$. This is an extension of the scheme developed…
We consider multiply periodic functions, sometimes called Abelian functions, defined with respect to the period matrices associated with classes of algebraic curves. We realise them as generalisations of the Weierstras P-function using two…
Achieving terabit-per-second (Tbps) data rates in terahertz (THz)-band communications requires bridging the complexity gap in baseband transceiver design. This work addresses the signal processing challenges associated with data detection…
We study linear problems defined on tensor products of Hilbert spaces with an additional (anti-) symmetry property. We construct a linear algorithm that uses finitely many continuous linear functionals and show an explicit formula for its…
This paper presents a fast algorithm for full-polarisation, direction dependent calibration in radio interferometry. It is based on Wirtinger's approach to complex differentiation. Compared to the classical case, and under reasonable…
An algorithm is designed which decomposes a tropical univariate rational function into a composition of tropical binomials and trinomials. When a function is monotone, the composition consists just of binomials. Similar algorithms are…
Low-rank tensor approximation techniques attempt to mitigate the overwhelming complexity of linear algebra tasks arising from high-dimensional applications. In this work, we study the low-rank approximability of solutions to linear systems…
We consider radial complex scaling/perfectly matched layer methods for scalar resonance problems in homogeneous exterior domains. We introduce a new abstract framework to analyze the convergence of domain truncations and discretizations.…
Large scale parameter estimation problems are among some of the most computationally demanding problems in numerical analysis. An academic researcher's domain-specific knowledge often precludes that of software design, which results in…
We present an approach to sums of random Hermitian matrices via the theory of spherical functions for the Gelfand pair $(\mathrm{U}(n) \ltimes \mathrm{Herm}(n), \mathrm{U}(n))$. It is inspired by a similar approach of Kieburg and K\"osters…
Unlike polynomials, rational functions can represent functions having poles or branch cuts with root-exponential convergence and no Runge phenomenon. Recent developments of the AAA and greedy Thiele algorithms have sparked renewed interest…
With the development of low order scaling methods for performing Kohn-Sham Density Functional Theory, it is now possible to perform fully quantum mechanical calculations of systems containing tens of thousands of atoms. However, with an…
This article surveys results on graded algebras and their Hilbert series. We give simple constructions of finitely generated graded associative algebras $R$ with Hilbert series $H(R,t)$ very close to an arbitrary power series $a(t)$ with…
In this work we investigate from a broad perspective the reduction of degrees of freedom through serendipity techniques for polytopal methods compatible with Hilbert complexes. We first establish an abstract framework that, given two…
We outline basic principles of a new method that gives a conceptual reasoning for and, at the same time, proofs of (super)congruences for truncated sums of arithmetic hypergeometric evaluations.
We present a new algorithm for solving the reduction problem in the context of holonomic integrals, which in turn provides an approach to integration with parameters. Our method extends the Griffiths--Dwork reduction technique to holonomic…
We introduce the notion of rationality for hyperholomorphic functions (functions in the kernel of the Cauchy-Fueter operator). Following the case of one complex variable, we give three equivalent definitions: the first in terms of…