Related papers: A new semilocal convergence theorem for the Weiers…

Zeros of many ensembles of polynomials with random coefficients are asymptotically equidistributed near the unit circumference. We give quantitative estimates for such equidistribution in terms of the expected discrepancy and expected…

In a companion paper [On semiclassical orthogonal polynomials via polynomial mappings, J. Math. Anal. Appl. (2017)] we proved that the semiclassical class of orthogonal polynomials is stable under polynomial transformations. In this work we…

In this paper, we study the Boltzmann equation with uncertainties and prove that the spectral convergence of the semi-discretized numerical system holds in a combined velocity and random space, where the Fourier-spectral method is applied…

In this paper, we prove several theorems on systems of polynomials with at least one positive real zero based on the theory of conceive polynomials. These theorems provide sufficient conditions for systems of multivariate polynomials…

We extend the authors' previous work on Wiener-Wintner double recurrence theorem to the case of polynomials.

In this paper we investigate the superconvergence properties of the discontinuous Galerkin method based on the upwind-biased flux for linear time-dependent hyperbolic equations. We prove that for even-degree polynomials, the method is…

This paper presents an iterative method suitable for inverting semilinear problems which are important kernels in many numerical applications. The primary idea is to employ a parametrization that is able to reduce semilinear problems into…

Datalogo is an extension of Datalog that allows for aggregation and recursion over an arbitrary commutative semiring. Like Datalog, Datalogo programs can be evaluated via the natural iterative algorithm until a fixed point is reached.…

The aim of this paper is to introduce a new Newton-type iterative method and then to show that this process converges to the unique solution of the scalar nonlinear equation f(x)=0 under weaker conditions involving only f and f' by fixed…

Fitting a polynomial to observed data is an ubiquitous task in many signal processing and machine learning tasks, such as interpolation and prediction. In that context, input and output pairs are available and the goal is to find the…

We study the convergence analysis of a Picard-S iteration method for a particular class of weak-contraction mappings. Furthermore, we prove a data dependence result for fixed point of the class of weak-contraction mappings with the help of…

This paper introduces a unified model for thermo-poroelasticity and multiple-network poroelasticity, reformulated into a total-pressure-based system. We first establish the well-posedness of the problem via a Galerkin-based argument and…

The classical Szeg\H{o}-Verblunsky theorem relates integrability of the logarithm of the absolutely continuous part of a probability measure on the circle to square summability of the sequence of recurrence coefficients for the orthogonal…

In this paper, we study an iteration in defined by a diffeomorphism polynomial bounded. Semi invariant curves tend to curves with parametric Weierstrass-Mandelbrot's functions. So, self-similarity and fractal dimension are justified. We…

We generalise the semi-Riemannian Morse index theorem to elliptic systems of partial differential equations on star-shaped domains. Moreover, we apply our theorem to bifurcation from a branch of trivial solutions of semilinear systems,…

Power-law uniform (in the operator norm) convergence on vector subspaces with their own norms in von Neumann's ergodic theorem with continuous time is considered. All possible exponents of the considered power-law convergence are found; for…

This paper develops a unified theory of natural superconvergence points for polynomial spline approximations to second-order elliptic problems. Beginning with the one-dimensional case, we establish that when a point $x_0$ is a local…

Hensel's lemma, combined with repeated applications of Weierstrass preparation theorem, allows for the factorization of polynomials with multivariate power series coefficients. We present a complexity analysis for this method and leverage…

In this note we extend the Gauss-Lucas theorem on the zeros of the derivative of a univariate polynomial to the case of sequences of univariate polynomials whose almost all zeros lie in a given convex bounded domain in C.

We study the convergence speed of distributed iterative algorithms for the consensus and averaging problems, with emphasis on the latter. We first consider the case of a fixed communication topology. We show that a simple adaptation of a…