Related papers: A numerical algorithm for computing the zeros of p…
In this paper some algorithms will be presented which can be used for the calculation of zeros of polynomials and eigenvalues of polynomial matrices with a multiplicity larger than one. The numerical values calculated with MATLAB are used…
A new robust algorithm for the numerical computation of biarcs, i.e. $G^1$ curves composed of two arcs of circle, is presented. Many algorithms exist but are based on geometric constructions, which must consider many geometrical…
This paper sketches a technique for improving the rate of convergence of a general oscillatory sequence, and then applies this series acceleration algorithm to the polylogarithm and the Hurwitz zeta function. As such, it may be taken as an…
We use visible point vector identities to examine polylogarithms in the neighbourhood of the Riemann zeta function zeroes. New formulas limiting to the trivial zeroes and to the critical line on the zeta function are given. Similar results…
Let f_{\lambda} be a family of holomorphic functions in the unit disk, holomorphic in parameter \lambda\in U\subset\C^{n}. We estimate the number of zeros of f_{\lambda} in a smaller disk via some characteristic of the ideal generated by…
We present an iterative root finding method for harmonic mappings in the complex plane, which is a generalization of Newton's method for analytic functions. The complex formulation of the method allows an analysis in a complex variables…
We investigate the zeros of two one-parameter families of harmonic functions and describe how the number of zeros depends on the parameter. Our functions have the property that all zeros lie on certain rays in the complex plane and thus we…
In this paper, we propose an incremental algorithm for computing cylindrical algebraic decompositions. The algorithm consists of two parts: computing a complex cylindrical tree and refining this complex tree into a cylindrical tree in real…
We present an algorithm for generating approximations for the logarithm of Barnes $G$-function in the half-plane $Re(z)\ge 3/2$. These approximations involve only elementary functions and are easy to implement. The algorithm is based on a…
This manuscript presents a novel and reliable third-order iterative procedure for computing the zeros of solutions to second-order ordinary differential equations. By approximating the solution of the related Riccati differential equation…
By application of the theory for second-order linear differential equations with two turning points developed in \cite{Olver1975}, uniform asymptotic approximations are obtained for the Lam\'{e} and Mathieu functions with a large real…
In this paper, we introduce a Matlab program method to compute Carleman estimate for the fourth order partial differential operator $\gamma\partial_t+\partial_x^4\ (\gamma\in\mathbb{R})$. We obtain two kinds of Carleman estimates with…
A fast algorithm (linear in the degrees of freedom) for the solution of linear variable-coefficient rational-order fractional integral and differential equations is described. The approach is related to the ultraspherical method for…
We report on the implementation of an algorithm for computing the set of all regular triangulations of finitely many points in Euclidean space. This algorithm, which we call down-flip reverse search, can be restricted, e.g., to computing…
This paper introduces an efficient algorithm for computing the general oscillatory matrix functions. These computations are crucial for solving second-order semi-linear initial value problems. The method is exploited using the scaling and…
We introduce an algorithm for the least squares solution of a rectangular linear system $Ax=b$, in which $A$ may be arbitrarily ill-conditioned. We assume that a complementary matrix $Z$ is known such that $A - AZ^*A$ is numerically low…
An algorithm for computing the incomplete gamma function $\gamma^*(a,z)$ for real values of the parameter $a$ and negative real values of the argument $z$ is presented. The algorithm combines the use of series expansions, Poincar\'e-type…
A collection of algorithms in object-oriented MATLAB is described for numerically computing with smooth functions defined on the unit ball in the Chebfun software. Functions are numerically and adaptively resolved to essentially machine…
We present a family of algorithms for the numerical approximation of the Schr\"odinger equation with potential concentrated at a finite set of points. Our methods belong to the so-called fast and oblivious convolution quadrature algorithms.…
In this article, a novel method to compute all discrete polyharmonic functions in the quarter plane for models with small steps, zero drift and a finite group is proposed. A similar method is then introduced for continuous polyharmonic…