Related papers: Computing a Solution of Feigenbaum's Functional Eq…
An unsteady problem is considered for a space-fractional equation in a bounded domain. A first-order evolutionary equation involves a fractional power of an elliptic operator of second order. Finite element approximation in space is…
We exhibit a sound and complete implicit-complexity formalism for functions feasibly computable by structural recursions over inductively defined data structures. Feasibly computable here means that the structural-recursive definition runs…
The computability of Julia sets of rational maps on the Riemann sphere has been intensively studied in recent years (see, e.g. https://doi.org/10.17323/1609-4514-2008-8-2-185-231, https://doi.org/10.1090/conm/797/15936) for an overview. For…
Most of theoretical physics is based on the mathematics of functions of a real or a complex variable; yet we frequently are drawn to try extending our reach to include quaternions. The non-commutativity of the quaternion algebra poses…
The first aim of this work is to establish a Peano type existence theorem for an initial value problem involving complex fractional derivative and the second is, as a consequence of this theorem, to give a partial answer to the local…
We present a FFT-based algorithm for the computation of a polynomial's coefficients from its roots, and apply it to obtain the coefficients of interpolation polynomials, to invert Vandermondians and to evaluate the symmetric functions of a…
Experimental science usually relies on laboratory procedures that, after finitely many steps, terminate with numerical reports on physical quantities. This paper argues that such procedures can be understood as algorithmic once the…
Feynman integral computations in theoretical high energy particle physics frequently involve square roots in the kinematic variables. Physicists often want to solve Feynman integrals in terms of multiple polylogarithms. One way to obtain a…
We prove a complexity dichotomy for a class of counting problems expressible as bipartite 3-regular Holant problems. For every problem of the form $\operatorname{Holant}\left(f\mid =_3 \right)$, where $f$ is any integer-valued ternary…
In this paper the singular Emden-Fowler equation of fractional order is introduced and a computational method is proposed for its numerical solution. For the approximation of the solutions we have used Boubaker polynomials and defined the…
In this paper we discuss the first order partial differential equations resolved with any derivatives. At first, we transform the first order partial differential equation resolved with respect to a time derivative into a system of linear…
An algorithm for the numerical solution of the Schr\"odinger equation in the case of a time dependent potential is proposed. Our simple modification upgrades the well known method of Koonin while negligibly increasing the computing time. In…
Solving the holography equation has long been a numerical task. While effective, the numeric approach has its own set of limitations. Relying solely on numerical approaches often obscures the intricate interplay and influence of the…
Analytical solutions to the time-dependent Schrodinger equation describing a driven two-level system are invaluable to many areas of physics, but they are also extremely rare. Here, we present a simple algorithm that generates an unlimited…
We show that a separation between the class of all problems that can efficiently be solved on a quantum computer and those solvable using probabilistic classical algorithms in polynomial time implies the generalized contextuality of quantum…
Roughly speaking, functional analysis is the study of vector spaces of arbitrary dimension over the field of real or complex numbers, and the continuous linear mappings between such spaces. Naturally, the notion of continuity requires a…
Leivant's ramified recurrence is one of the earliest examples of an implicit characterization of the polytime functions as a subalgebra of the primitive recursive functions. Leivant's result, however, is originally stated and proved only…
This paper provides a new and more direct proof of the assertion that a Turing computable function of the natural numbers is primitive recursive if and only if the time complexity of the corresponding Turing machine is bounded by a…
Let $\Delta_x f(x,y)=f(x+1,y)-f(x,y)$ and $\Delta_y f(x,y)=f(x,y+1)-f(x,y)$ be the difference operators with respect to $x$ and $y$. A rational function $f(x,y)$ is called summable if there exist rational functions $g(x,y)$ and $h(x,y)$…
For univalent and normalized functions $f$ the logarithmic coefficients $\gamma_n(f)$ are determined by the formula $\log(f(z)/z)=\sum_{n=1}^{\infty}2\gamma_n(f)z^n$. In the paper \cite{Pon} the authors posed the conjecture that a locally…