Related papers: A systematic approach to computing and indexing th…
In this paper, we investigate properties of the fixed point sequence of the Josephus function $J_3$. First, we establish a connection between this sequence and the Chinese Remainder Theorem. Next, we identify a clear numerical pattern for…
In this paper, we modify the Newton-Secant method with third order of convergence for finding multiple roots of nonlinear equations. Per iteration this method requires two evaluations of the function and one evaluation of its first…
In this paper, we introduce a new iterative method which we call one step back approach: the main idea is to anticipate the consequence of the iterative computation per coordinate and to optimize on the choice of the sequence of the…
In this paper we provide a new method to certify that a nearby polynomial system has a singular isolated root with a prescribed multiplicity structure. More precisely, given a polynomial system f $=(f\_1, \ldots, f\_N)\in C[x\_1, \ldots,…
Given an odd prime $p$, we provide formulas for the Hensel lifts of polynomial roots modulo $p$, and give an explicit factorization over the ring of formal power series with integer coefficients for certain reducible polynomials whose…
In this paper, we present a third-order iterative method based on Potra-Pt{\'a}k method to compute the approximate multiple roots of nonlinear equations. The method requires two evaluations of the function and one evaluation of its first…
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 construct variants of the Riemann zeta function with convenient properties and make conjectures about their dynamics; some of the conjectures are based on an analogy with the dynamical system of zeta. More specifically, we study the…
We present a practical implementation based on Newton's method to find all roots of several families of complex polynomials of degrees exceeding one billion ($10^9$) so that the observed complexity to find all roots is between $O(d\ln d)$…
Approximate computing has shown to provide new ways to improve performance and power consumption of error-resilient applications. While many of these applications can be found in image processing, data classification or machine learning, we…
We present improved algorithms for fast calculation of the inverse square root for single-precision floating-point numbers. The algorithms are much more accurate than the famous fast inverse square root algorithm and have the same or…
We present identities for permutations with fixed points. The formulas are based on successive derivations or integrations of the determinant of a particular matrix.
We use Newton's method to find all roots of several polynomials in one complex variable of degree up to and exceeding one million and show that the method, applied to appropriately chosen starting points, can be turned into an algorithm…
We present a novel algorithm for calculating fix-points. The algorithm calculates fix-points of an endo-function f on a distributive lattice, by performing reachability computation a graph derived from the dual of f; this is in comparison…
We introduce two algorithms for accurately evaluating powers to a positive integer in floating-point arithmetic, assuming a fused multiply-add (fma) instruction is available. We show that our log-time algorithm always produce…
The approximation of a multiple isolated root is a difficult problem. In fact the root can even be a repulsive root for a fixed point method like the Newton method. However there exists a huge literature on this topic but the answers given…
This paper presents a fast and robust numerical method for reconstructing point-like sources in the time-harmonic Maxwell's equations given Cauchy data at a fixed frequency. This is an electromagnetic inverse source problem with broad…
In this paper, we provide a comprehensive solution to the open problem regarding the existence of a recurrence formula for computing fixed points of the Josephus function precisely when the reduction constant is three. Incorporating this…
In this article, we introduce a recurrence formula which only involves two adjacent values of the Riemann zeta function at integer arguments. Based on the formula, an algorithm to evaluate $\zeta$-values(i.e. the values of Riemann zeta…
Using exact computer arithmetic, it is possible to determine the (exact) solution of a numerical model without rounding error. For such purposes, a corresponding system of equations should be exactly defined, either directly or by…