Related papers: Intermediate arithmetic operations on ordinal numb…
The computation of the matrix exponential is a ubiquitous operation in numerical mathematics, and for a general, unstructured $n\times n$ matrix it can be computed in $\mathcal{O}(n^3)$ operations. An interesting problem arises if the input…
It is shown how Dedekind cuts can be used to introduce the extended real numbers along with sound arithmetic laws via one simple rule for the addition of sets. The crucial idea is that the use of the lower and the upper part of the cuts,…
In 1938 E. T. Bell introduced "The Iterated Exponential Integers". He proved that these numbers may be expressed by polynomials with rational coefficients. However, Bell gave no formulas for any of the coefficients except the trivial one,…
Using elementary methods, we define and derive a particular weighted average of the trapezoidal and composite trapezoidal rules and show that this approximation, as well as its composite, is straightforward in computation. This…
It is not uncommon in analysis that existence of extremal objects is obtained via an iterative procedure: we start from a given admissible object, then modify it, then modify again etc... If being extremal means maximimizing a real valued…
Sequences of orthogonal polynomials that are alternative to the Jacobi polynomials on the interval $[0,1]$ are defined and their properties are established. An $(\alpha,\beta)$-parameterized system of orthogonal polynomials of the…
Umbral calculus can be viewed as an abstract theory of the Heisenberg commutation relation $[\hat P,\hat M]=1$. In ordinary quantum mechanics $\hat P$ is the derivative and $\hat M$ the coordinate operator. Here we shall realize $\hat P$ as…
We propose a quadrature-based formula for computing the exponential function of matrices with a non-oscillatory integral on an infinite interval and an oscillatory integral on a finite interval. In the literature, existing quadrature-based…
We consider fractional differential equations of order $\alpha \in (0,1)$ for functions of one independent variable $t\in (0,\infty)$ with the Riemann-Liouville and Caputo-Dzhrbashyan fractional derivatives. A precise estimate for the order…
We demonstrate that a modification of the classical index calculus algorithm can be used to factor integers. More generally, we reduce the factoring problem to finding an overdetermined system of multiplicative relations in any factor base…
In the article integer divisibility properties and related prime factors natural number representation concepts have been defined over the whole infinite hyperoperation hierarchy. The definitions have been made across and above of unique…
We study the problem of addition and subtraction using the Zeckendorf representation of integers. We show that both operations can be performed in linear time; in fact they can be performed by combinational logic networks with linear size…
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…
Multiplication of n-digit integers by long multiplication requires O(n^2) operations and can be time-consuming. In 1970 A. Schoenhage and V. Strassen published an algorithm capable of performing the task with only O(n log(n)) arithmetic…
Originating in Girard's Linear logic, Ehrhard and Regnier's Taylor expansion of $\lambda$-terms has been broadly used as a tool to approximate the terms of several variants of the $\lambda$-calculus. Many results arise from a Commutation…
We show that the classical algebra of quaternions is a commutative $\Z_2\times\Z_2\times\Z_2$-graded algebra. A similar interpretation of the algebra of octonions is impossible.
Dual numbers and their higher order version are important tools for numerical computations, and in particular for finite difference calculus. Based upon the relevant algebraic rules and matrix realizations of dual numbers, we will present a…
The classical division algorithm for polynomials requires $O(n^2)$ operations for inputs of size $n$. Using reversal technique and Newton iteration, it can be improved to $O({M}(n))$, where ${M}$ is a multiplication time. But the method…
In this paper we review and derive hyperbolic and trigonometric double summation addition theorems for Jacobi functions of the first and second kind. In connection with these addition theorems, we perform a full analysis of the relation…
The exponential trapezoidal rule is proposed and analyzed for the numerical integration of semilinear integro-differential equations. Although the method is implicit, the numerical solution is easily obtained by standard fixed-point…