The main goal of this paper is to study applications of the fractional calculus techniques for a certain subclass of multivalent analytic functions on Hilbert Space. Also, we obtain the coefficient estimates, extreme points, convex combination and hadamard product.

The aim of this paper is to employ the fractional shifted Legendre polynomials (FSLPs) in the matrix form to approximate the fractional derivatives and find the numerical solutions of the one-dimensional space-fractional bioheat equation (SFBHE). The Caputo formula was utilized to approximate the fractional derivative. The proposed methodology applied for two examples showed its usefulness and efficiency. The numerical results showed that the utilized technique is very efficacious with high accuracy and good convergence.

     This article is devoted to presenting results on invariant approximations over a non-star-shsped weakly compact subset of a complete modular space by introduced a new notion called S-star-shaped with center f:  if   be a mapping and , . Then the existence of common invariant best approximation is proved for Banach operator pair of mappings by combined the hypotheses with Opial’s condition or demi-closeness condition

            The article describes a certain computation method of -arcs to construct the number of distinct -arcs in  for . In this method, a new approach employed to compute the number of -arcs and the number of distinct arcs respectively. This approach is based on choosing the number of inequivalent classes } of -secant distributions that is the number of 4-secant, 3-secant, 2-secant, 1-secant and 0-secant in each process. The maximum size of -arc that has been constructed by this method is . The new method is a new tool to deal with the programming difficulties that sometimes may lead to programming problems represented by the increasing number of arcs. It is essential to reduce the established number of -arcs in each cons

Let Y be a"uniformly convex n-Banach space, M be a nonempty closed convex subset of Y, and S:M→M be adnonexpansive mapping. The purpose of this paper is to study some properties of uniform convex set that help us to develop iteration techniques for1approximationjof"fixed point of nonlinear mapping by using the Mann iteration processes in n-Banachlspace.

A new human-based heuristic optimization method, named the Snooker-Based Optimization Algorithm (SBOA), is introduced in this study. The inspiration for this method is drawn from the traits of sales elites—those qualities every salesperson aspires to possess. Typically, salespersons strive to enhance their skills through autonomous learning or by seeking guidance from others. Furthermore, they engage in regular communication with customers to gain approval for their products or services. Building upon this concept, SBOA aims to find the optimal solution within a given search space, traversing all positions to obtain all possible values. To assesses the feasibility and effectiveness of SBOA in comparison to other algorithms, we conducte

    In this paper, we introduce new conditions to prove that the existence and boundedness of the solution by convergent sequences and convergent series. The theorem of Krasnoselskii, Lebesgue’s dominated convergence theorem and fixed point theorem are used to get some sufficient conditions for the existence of solutions. Furthermore, we get sufficient conditions to guarantee the oscillatory property for all solutions in this class of equations. An illustrative example is included as an application to the main results.

In this paper, we present a concept of nC- symmetric operator as  follows: Let A be a bounded linear operator on separable complex Hilbert space , the operator A is said to be nC-symmetric if there exists a positive number n (n  such that CAⁿ = A*^ⁿ C (Aⁿ = C A*^ⁿ C). We provide an example and study the basic properties of this class of operators. Finally, we attempt to describe the relation between nC-symmetric operator and some other operators such as Fredholm and self-adjoint operators.

Most of the world's drilling companies use API method for calculating the
pressure drop in drilling oil and gas wells. Iraqi Drilling Company also uses this
method for drilling oil wells in all fields of Iraq. In Russia, the method is actively
used Grodde for calculating the pressure drop in drilling oil and gas wells. This
study includes a comparison of formulas API, Grodde and new techniques
developed methods for the laminar flow of viscoplastic fluids in the annular space.
The aim of this study is to determine the most accurate way to calculate the pressure
loss in drilling oil wells. The comparison was focused on identifying changes in the
values of β, using the above calculation methods.

A cap of size  and degree  in a projective space, (briefly; (k,r)-cap) is a set of  points with the property that each line in the space meet it in at most  points. The aim of this research is to extend the size and degree of complete caps and incomplete caps, (k, r)-caps of degree r<12 in the finite projective space of dimension three over the finite field of order eleven, which already exist and founded by the action of subgroups of the general linear group over the finite field of order eleven and degree four, to (k+i,r+1) -complete caps. These caps have been classified by giving the t_i-distribution and -distribution. The Gap programming has been used to execute the designed algorit