A Modified Krasnosel’skiǐ–Mann Iterative Algorithm for Approximating Fixed Points of Enriched Nonexpansive Mappings

For approximating the fixed points of enriched nonexpansive mappings in Hilbert spaces, we consider a modified Krasnosel’skiǐ–Mann algorithm for which we prove a strong convergence theorem. We also empirically compare the rate of convergence of the modified Krasnosel’skiǐ–Mann algorithm and of the simple Krasnosel’skiǐ fixed point algorithm. Based on the numerical experiments reported in the paper we conclude that, for the class of enriched nonexpansive mappings, it is more convenient to work with the simple Krasnosel’skiǐ fixed point algorithm than with the modified Krasnosel’skiǐ–Mann algorithm.

On Some Approximation Properties for a Sequence of λ-Bernstein Type Operators

In 2010, Long and Zeng introduced a new generalization of the Bernstein polynomials that depends on a parameter and called -Bernstein polynomials. After that, in 2018, Lain and Zhou studied the uniform convergence for these -polynomials and obtained a Voronovaskaja-type asymptotic formula in ordinary approximation. This paper studies the convergence theorem and gives two Voronovaskaja-type asymptotic formulas of the sequence of -Bernstein polynomials in both ordinary and simultaneous approximations. For this purpose, we discuss the possibility of finding the recurrence relations of the -th order moment for these polynomials and evaluate the values of -Bernstein for the functions , is a non-negative integer

A new self adaptive Tseng’s extragradient method with double-projection for solving pseudomonotone variational inequality problems in Hilbert spaces

The purpose of this paper is to study a new Tseng’s extragradient method with two different stepsize rules for solving pseudomonotone variational inequalities in real Hilbert spaces. We prove a strong convergence theorem of the proposed algorithm under some suitable conditions imposed on the parameters. Moreover, we also give some numerical experiments to demonstrate the performance of our algorithm.

A Relaxed Kaczmarz Method for Fuzzy Linear Systems

A relaxed Kaczmarz method is presented for solving a class of fuzzy linear systems of equations with crisp coefficient matrix and fuzzy right-hand side. The iterative scheme is established and the convergence theorem is provided. Numerical examples show that the method is effective.

Convergence of the Nelder-Mead method

We develop a matrix form of the Nelder-Mead simplex method and show that its convergence is related to the convergence of infinite matrix products. We then characterize the spectra of the involved matrices necessary for the study of convergence. Using these results, we discuss several examples of possible convergence or failure modes. Then, we prove a general convergence theorem for the simplex sequences generated by the method. The key assumption of the convergence theorem is proved in low-dimensional spaces up to 8 dimensions.

Integration

The concept of an integral on a general measure space is developed from first principles. Riemann–Stieltjes and Lebesgue–Stieltjes integrals are defined. The monotone convergence theorem, fundamental properties of integrals, and related inequalities are covered. Other topics include product measure and multiple integrals, Fubini’s theorem, signed measures, and the Radon–Nikodym theorem.

Convergence of Certain Baskakov Operators of Integral Type

In the present paper, we propose a Baskakov operator of integral type using a function φ on [0,∞) with the properties: φ(0)=0,φ′>0 on [0,∞) and limx→∞φ(x)=∞. The proposed operators reproduce the function φ and constant functions. For the constructed operator, some approximation properties are studied. Voronovskaja asymptotic type formulas for the proposed operator and its derivative are also considered. In the last section, the interest is focused on weighted approximation properties, and a weighted convergence theorem of Korovkin’s type on unbounded intervals is obtained. The results can be extended on the interval (−∞,0] (the symmetric of the interval [0,∞) from the origin).

Application of Said Ball Curve for Solving Fractional Differential-Algebraic Equations

The aim of this paper is to apply the Said Ball curve (SBC) to find the approximate solution of fractional differential-algebraic equations (FDAEs). This method can be applied to solve various types of fractional order differential equations. Convergence theorem of the method is proved. Some examples are presented to show the efficiency and accuracy of the method. Based on the obtained results, the SBC is more accurate than the Bezier curve method.