Related papers: Exponential divided differences via Chebyshev poly…
Estimating the Lipschitz constant of deep neural networks is of growing interest as it is useful for informing on generalisability and adversarial robustness. Convolutional neural networks (CNNs) in particular, underpin much of the recent…
Motivated by problems where the response is needed at select localized regions in a large computational domain, we devise a novel finite element discretization that results in exponential convergence at pre-selected points. The two key…
An $\mathcal{O}(N(\log N)^2/\log\!\log N)$ algorithm for computing the discrete Legendre transform and its inverse is described. The algorithm combines a recently developed fast transform for converting between Legendre and Chebyshev…
We present sparse interpolation algorithms for recovering a polynomial with $\le B$ terms from $N$ evaluations at distinct values for the variable when $\le E$ of the evaluations can be erroneous. Our algorithms perform exact arithmetic in…
In this paper, an efficient method is presented for solving three dimensional Volterra integral equations of the second kind with continuous kernel. Shifted Chebyshev polynomial is applied to approximate a solution for these integral…
Chebyshev polynomials have shown significant promise as an efficient tool for both classical and quantum neural networks to solve linear and nonlinear differential equations. In this work, we adapt and generalize this framework in a quantum…
This paper is concerned with the investigation of the controllability and observability of Caputo fractional differential linear systems of any real order {\alpha} . Expressions for the expansions of the evolution operators in powers of the…
We revisit and adapt the extended sequential quadratic method (ESQM) in [3] for solving a class of difference-of-convex optimization problems whose constraints are defined as the intersection of level sets of Lipschitz differentiable…
Unions of graph Fourier multipliers are an important class of linear operators for processing signals defined on graphs. We present a novel method to efficiently distribute the application of these operators to the high-dimensional signals…
In this paper, a new framework for continuous-time maximum a posteriori estimation based on the Chebyshev polynomial optimization (ChevOpt) is proposed, which transforms the nonlinear continuous-time state estimation into a problem of…
Nonlinear differential equations model diverse phenomena but are notoriously difficult to solve. While there has been extensive previous work on efficient quantum algorithms for linear differential equations, the linearity of quantum…
We consider dimensional reduction techniques for the Liouville-von Neumann equation for the evaluation of the expectation values in a mixed quantum system. In applications such as nuclear spin dynamics the main goal for simulations is being…
In the framework of mapped pseudospectral methods, we introduce a new polynomial-type mapping function in order to describe accurately the dynamics of systems developing almost singular structures. Using error criteria related to the…
Harmonic Balance is one of the most popular methods for computing periodic solutions of nonlinear dynamical systems. In this work, we address two of its major shortcomings: First, we investigate to what extent the computational burden of…
In this paper we present an algorithm to fit data via exponentials when the error is measured using the max-norm. We prove the necesssary results to show that the algorithm will converge to the best approximation no matter the dataset.
We describe a method for the numerical evaluation of normalized versions of the associated Legendre functions $P_\nu^{-\mu}$ and $Q_\nu^{-\mu}$ of degrees $0 \leq \nu \leq 1,000,000$ and orders $-\nu \leq \mu \leq \nu$ on the interval…
Constrained quasiconvex optimization problems appear in many fields, such as economics, engineering, and management science. In particular, fractional programming, which models ratio indicators such as the profit/cost ratio as fractional…
In this paper, we study quantum Ordered Binary Decision Diagrams($OBDD$) model; it is a restricted version of read-once quantum branching programs, with respect to "width" complexity. It is known that the maximal gap between deterministic…
Computing dynamical distributions in quantum many-body systems represents one of the paradigmatic open problems in theoretical condensed matter physics. Despite the existence of different techniques both in real-time and frequency space,…
This article is concerned with an extension of univariate Chebyshev polynomials of the first kind to the multivariate setting, where one chases best approximants to specific monomials by polynomials of lower degree relative to the uniform…