In this study, a new technique is considered for solving linear fractional Volterra-Fredholm integro-differential equations (LFVFIDE's) with fractional derivative qualified in the Caputo sense. The method is established in three types of Lagrange polynomials (LP’s), Original Lagrange polynomial (OLP), Barycentric Lagrange polynomial (BLP), and Modified Lagrange polynomial (MLP). General Algorithm is suggested and examples are included to get the best effectiveness, and implementation of these types. Also, as special case fractional differential equation is taken to evaluate the validity of the proposed method. Finally, a comparison between the proposed method and other methods are taken to present the effectiveness of the proposal method in solving these problems.
Oscillation criteria are obtained for all solutions of the first-order linear delay differential equations with positive and negative coefficients where we established some sufficient conditions so that every solution of (1.1) oscillate. This paper generalized the results in [11]. Some examples are considered to illustrate our main results.
This paper deals with founding an estimation of best approximation of unbounded functions which satisfied weighted Lipschitz condition with respect to the convex polynomials by means of weighted moduli of smoothness of fractional order , ( , ) p f t . In addition we prove some properties of weighted moduli of smoothness of fractional order.
Orthogonal polynomials and their moments serve as pivotal elements across various fields. Discrete Krawtchouk polynomials (DKraPs) are considered a versatile family of orthogonal polynomials and are widely used in different fields such as probability theory, signal processing, digital communications, and image processing. Various recurrence algorithms have been proposed so far to address the challenge of numerical instability for large values of orders and signal sizes. The computation of DKraP coefficients was typically computed using sequential algorithms, which are computationally extensive for large order values and polynomial sizes. To this end, this paper introduces a computationally efficient solution that utilizes the parall
... Show MoreLong memory analysis is one of the most active areas in econometrics and time series where various methods have been introduced to identify and estimate the long memory parameter in partially integrated time series. One of the most common models used to represent time series that have a long memory is the ARFIMA (Auto Regressive Fractional Integration Moving Average Model) which diffs are a fractional number called the fractional parameter. To analyze and determine the ARFIMA model, the fractal parameter must be estimated. There are many methods for fractional parameter estimation. In this research, the estimation methods were divided into indirect methods, where the Hurst parameter is estimated fir
... Show MoreVarious simple and complicated models have been utilized to simulate the stress-strain behavior of the soil. These models are used in Finite Element Modeling (FEM) for geotechnical engineering applications and analysis of dynamic soil-structure interaction problems. These models either can't adequately describe some features, such as the strain-softening of dense sand, or they require several parameters that are difficult to gather by conventional laboratory testing. Furthermore, soils are not completely linearly elastic and perfectly plastic for the whole range of loads. Soil behavior is quite difficult to comprehend and exhibits a variety of behaviors under various circumstances. As a result, a more realistic constitutive model is
... Show MoreThis paper analyzes a piled-raft foundation on non-homogeneous soils with variable layer depth percentages. The present work aims to perform a three-dimensional finite element analysis of a piled-raft foundation subjected to vertical load using the PLAXIS 3D software. Parametric analysis was carried out to determine the effect of soil type and initial layer thickness. The parametric study showed that increasing the relative density from 30 % to 80 % of the upper sand layer and the thickness of the first layer has led to an increase in the ultimate load and a decrease in the settlement of piled raft foundations for the cases of sand over weak soil. In clay over weak soil, the ultimate load of the piled raft foundation w
... Show MoreVarious simple and complicated models have been utilized to simulate the stress-strain behavior of the soil. These models are used in Finite Element Modeling (FEM) for geotechnical engineering applications and analysis of dynamic soil-structure interaction problems. These models either can't adequately describe some features, such as the strain-softening of dense sand, or they require several parameters that are difficult to gather by conventional laboratory testing. Furthermore, soils are not completely linearly elastic and perfectly plastic for the whole range of loads. Soil behavior is quite difficult to comprehend and exhibits a variety of behaviors under various circumstances. As a result, a more realistic constitutive model is
... Show MoreThe accuracy of the Moment Method for imposing no-slip boundary conditions in the lattice Boltzmann algorithm is investigated numerically using lid-driven cavity flow. Boundary conditions are imposed directly upon the hydrodynamic moments of the lattice Boltzmann equations, rather than the distribution functions, to ensure the constraints are satisfied precisely at grid points. Both single and multiple relaxation time models are applied. The results are in excellent agreement with data obtained from state-of-the-art numerical methods and are shown to converge with second order accuracy in grid spacing.
Most heuristic search method's performances are dependent on parameter choices. These parameter settings govern how new candidate solutions are generated and then applied by the algorithm. They essentially play a key role in determining the quality of the solution obtained and the efficiency of the search. Their fine-tuning techniques are still an on-going research area. Differential Evolution (DE) algorithm is a very powerful optimization method and has become popular in many fields. Based on the prolonged research work on DE, it is now arguably one of the most outstanding stochastic optimization algorithms for real-parameter optimization. One reason for its popularity is its widely appreciated property of having only a small number of par
... Show More