Related papers: On Numerical Algorithms for the Solution of a Belt…
Suppose $F:=(f_1,\ldots,f_n)$ is a system of random $n$-variate polynomials with $f_i$ having degree $\leq\!d_i$ and the coefficient of $x^{a_1}_1\cdots x^{a_n}_n$ in $f_i$ being an independent complex Gaussian of mean $0$ and variance…
We investigate the use of piecewise linear systems, whose coefficient matrix is a piecewise constant function of the solution itself. Such systems arise, for example, from the numerical solution of linear complementarity problems and in the…
The off-lattice Boltzmann (OLB) method consists of numerical schemes which are used to solve the discrete Boltzmann equation. Unlike the commonly used lattice Boltzmann method, the spatial and time steps are uncoupled in the OLB method. In…
This paper presents an efficient numerical method for solving fractional optimal control problems using an operational matrix for a fractional wavelet. Using well-known formulae such as Caputo and Riemann-Liouville operators to determine…
We describe meromorphic solutions to the equations $f^n(z)+\left(f'\right)^n(z)=e^{\alpha z+\beta}$ and $f^n(z)+f^n(z+c)=e^{\alpha z+\beta}$ ($c\neq0$) over the complex plane $\mathbf{C}$ for integers $n\geq1$.
This paper presents a novel approach to automatically solving arithmetic word problems. This is the first algorithmic approach that can handle arithmetic problems with multiple steps and operations, without depending on additional…
In this paper we solve the Boltzmann transport equation using AI libraries. The reason why this is attractive is because it enables one to use the highly optimised software within AI libraries, enabling one to run on different computer…
We continue the investigation on the applications of the Kramers equation to the numerical simulation of field theoretic models. In a previous paper we have described the theory and proposed various algorithms. Here, we compare the simplest…
Flexible sparsity regularization means stably approximating sparse solutions of operator equations by using coefficient-dependent penalizations. We propose and analyse a general nonconvex approach in this respect, from both theoretical and…
The numerical analysis for the small amplitude motion of an elastic beam with internal damping is investigated in domain with moving ends. An efficient numerical method is constructed to solve this moving boundary problem. The stability and…
Inspired by the Boltzmann kinetics, we propose a collision-based dynamics with a Monte Carlo solution algorithm that approximates the solution of the multi-marginal optimal transport problem via randomized pairwise swapping of sample…
We describe algorithms for computing eigenpairs (eigenvalue-eigenvector pairs) of a complex $n\times n$ matrix $A$. These algorithms are numerically stable, strongly accurate, and theoretically efficient (i.e., polynomial-time). We do not…
It is known that Goertzel's algorithm is much less numerically accurate than the Fast Fourier Transform (FFT)(Cf. \cite{gen:69}). In order to improve accuracy we propose modifications of both Goertzel's and Horner's algorithms based on the…
In this note, we polynomially reduce an instance of the partition problem to a dynamic lot sizing problem, and show that solving the latter problem solves the former problem. By solving the dynamic program formulation of the dynamic lot…
The randomized Kaczmarz method and its accelerated variants are a powerful class of iterative methods for solving large-scale linear systems, offering guaranteed convergence with low per-iteration cost. However, their numerical stability…
We design nearly-linear time numerical algorithms for the problem of multivariate multipoint evaluation over the fields of rational, real and complex numbers. We consider both \emph{exact} and \emph{approximate} versions of the algorithm.…
We settle the computational complexity of fundamental questions related to multicriteria integer linear programs, when the dimensions of the strategy space and of the outcome space are considered fixed constants. In particular we construct:…
In this paper, we aim to provide an accessible survey to various formulae for calculating single Hurwitz numbers. Single Hurwitz numbers count certain classes of meromorphic functions on complex algebraic curves and have a rich geometric…
Mahler equations relate evaluations of the same function $f$ at iterated $b$th powers of the variable. They arise in particular in the study of automatic sequences and in the complexity analysis of divide-and-conquer algorithms. Recently,…
A fast and accurate algorithm for solving a Bernstein-Vandermonde linear system is presented. The algorithm is derived by using results related to the bidiagonal decomposition of the inverse of a totally positive matrix by means of Neville…