An efficient technique, called pseudo-Galerkin, is performed to approximate some types of linear/nonlinear BVPs. The core of the performance process is the two well-known weighted residual methods, collocation and Galerkin. A novel basis of functions, consisting of first derivatives of Chebyshev polynomials, has been used. Consequently, new operational matrices for derivatives of any integer order have been introduced. An error analysis is performed to ensure the convergence of the presented method. In addition, the accuracy and the efficiency are verified by solving BVPs examples, including real-life problems.
In this paper, the authors investigate the Hyers–Ulam stability results of the quadratic functional equation in Banach spaces and non-Archimedean Banach spaces by utilizing two different techniques in terms of direct and fixed point techniques.
This article discusses a variety of important notions, including ideal convergence and ideal Cauchyness of topological sequences produced by fuzzy normed spaces. Furthermore, the connections between the concepts of the ideal limit and ideal cluster points of a sequence in a fuzzy normed linear space are investigated. In a fuzzy normed space, we investigated additional effects, such as describing compactness in terms of ideal cluster points and other relevant but previously unresearched ideal convergence and adjoint ideal convergence aspects of sequences and nets. The countable compactness of a fuzzy normed space and its link to it were also defined. The terms ideal and its adjoint divergent sequences are then introduced, and specific aspects of them are explored in a fuzzy normed space. Our study supports the importance of condition (AP) in examining summability via ideals. It is suggested to use a fuzzy point symmetry-based genetic clustering method to automatically count the number of clusters in a data set and determine how well the data are fuzzy partitioned. As long as the clusters have the attribute of symmetry, they can be any size, form, or convexity. One of the crucial ways that symmetry is used in fuzzy systems is in the solution of the linear Fuzzy Fredholm Integral Equation (FFIE), which has symmetric triangular (Fuzzy Interval) output and any fuzzy function input.
In this paper, we have introduced some viscosity-type inertial iterative methods for solving fixed point and variational inclusion problems in Hilbert spaces. Our methods calculated the viscosity approximation, fixed point iteration, and inertial extrapolation jointly in the starting of every iteration. Assuming some suitable assumptions, we demonstrated the strong convergence theorems without computing the resolvent of the associated monotone operators. We used some numerical examples to illustrate the efficiency of our iterative approaches and compared them with the related work.
In this article, we prove some coincidence and common fixed point theorems under the relation-theoretic Meir-Keeler contractions in a metric space endowed with a locally finitely -transitive binary relation. Our newly proved results generalize, extend, and sharpen some existing coincidence point as well as fixed point theorems existing in the literature. Moreover, we give some examples to affirm the efficacy of our results.
In this article, we study the JF iterative algorithm to approximate the fixed points of a non-linear operator that satisfies condition (E) in uniformly convex Banach spaces. Further, some weak and strong convergence results are presented for the same operator using the JF iterative algorithm. We also demonstrate that the JF iterative algorithm is weakly -stable with respect to almost contractions. In connection with our results, we provide some illustrative numerical examples to show that the JF iterative algorithm converges faster than some well-known iterative algorithms. Finally, we apply the JF iterative algorithm to estimate the solution of a functional non-linear integral equation. The results of the present manuscript generalize and extend the results in existing literature and will draw the attention of researchers.