Related papers: General convergence theorems for iterative process…

We first generalize a classical iteration formula for one variable holomorphic mappings to a formula for higher dimensional holomorphic mappings. Then, as an application, we give a short and intuitive proof of a classical theorem, due to H.…

For a class of stationary regularly varying and weakly dependent time series, we prove the so-called complete convergence result for the corresponding space-time point processes. As an application of our main theorem, we give a simple proof…

We extend the notion of generalised Cesaro summation/convergence developed previously to the more natural setting of what we call "remainder" Cesaro summation/convergence and, after illustrating the utility of this approach in deriving…

We prove a generalisation of Fernique's theorem which applies to a class of (measurable) functionals on abstract Wiener spaces by using the isoperimetric inequality. Our motivation comes from rough path theory where one deals with iterated…

We show that for any constant d, complex roots of degree d univariate rational (or Gaussian rational) polynomials---given by a list of coefficients in binary---can be computed to a given accuracy by a uniform TC^0 algorithm (a uniform…

We study the Kaczmarz methods for solving systems of quadratic equations, i.e., the generalized phase retrieval problem. The methods extend the Kaczmarz methods for solving systems of linear equations by integrating a phase selection…

The Zernike radial polynomials are a system of orthogonal polynomials over the unit interval with weight x. They are used as basis functions in optics to expand fields over the cross section of circular pupils. To calculate the roots of…

The convergence of inexact Newton methods is studied for solving generalized equations on Riemannian manifolds by using the metric regularity property, which is also explored. Under appropriate conditions and without any additional…

A new inverse iteration algorithm that can be used to compute all the eigenvectors of a real symmetric tri-diagonal matrix on parallel computers is developed. The modified Gram-Schmidt orthogonalization is used in the classical inverse…

We study the discrete dynamical system obtained by repeatedly applying the Pearson correlation operator to a real matrix. Each step centers every row, normalizes each centered row to unit Euclidean norm, and forms the Gram matrix of the…

Some near-optimal polynomial root-finders of 2024-25, based on subdivision iterations, approximate all complex roots of a polynomial or all roots in a fixed Region of Interest in the complex plane. The iterations can be applied to a black…

In this paper, we present the generalized iterated function system for constructing of common fractals of generalized contractive mappings in the setup of dislocated metric spaces. The well-posedness of attractors based problems of rational…

The paper investigates uniform convergence of wavelet expansions of Gaussian random processes. The convergence is obtained under simple general conditions on processes and wavelets which can be easily verified. Applications of the developed…

We provide two weakly convergent algorithms for finding a zero of the sum of a maximally monotone operator, a cocoercive operator, and the normal cone to a closed vector subspace of a real Hilbert space. The methods exploit the intrinsic…

We develop a novel, fundamental and surprisingly simple randomized iterative method for solving consistent linear systems. Our method has six different but equivalent interpretations: sketch-and-project, constrain-and-approximate, random…

The paper presents a globally convergent algorithm for solving coefficient inverse problems. Being rooted in the globally convergent numerical method (SIAM J. Sci. Comput., 31, No.1 (2008), pp. 478-509) for solving multidimensional…

We develop the theory of meta-iteration trees, that is, iteration trees whose base "model" is itself an ordinary iteration tree. We prove a comparison theorem for meta-iteration strategies parallel to the one for ordinary iteration…

This is the first in a set of three papers providing an introduction to generalised Cesaro convergence. We start with traditional Cesaro methods for extending classical convergence and further generalise these to allow the calculation of…

In this paper, we develop a novel approach to the Weingarten calculus by employing the notion of virtual isometries. Traditionally, Weingarten calculus provides explicit formulas for integrating polynomial functions over compact matrix…

We propose and study a strongly convergent inexact inertial projective splitting (PS) algorithm for finding zeros of composite monotone inclusion problems involving the sum of finitely many maximal monotone operators. Strong convergence of…