The quality of Global Navigation Satellite Systems (GNSS) networks are considerably influenced by the configuration of the observed baselines. Where, this study aims to find an optimal configuration for GNSS baselines in terms of the number and distribution  of baselines to improve the quality criteria of the GNSS networks. First order design problem (FOD) was applied in this research to optimize GNSS network baselines configuration, and based on sequential adjustment method to solve its objective functions.

FOD for optimum precision (FOD-p) was the proposed model which based on the design criteria of A-optimality and E-optimality. These design criteria were selected as objective functions of precision, whic

In this article, the solvability of some proposal types of the multi-fractional integro-partial differential system has been discussed in details by using the concept of abstract Cauchy problem and certain semigroup operators and some necessary and sufficient conditions. 

This paper aims to study the fractional differential systems arising in warm plasma, which exhibits traveling wave-type solutions. Time-fractional Korteweg-De Vries (KdV) and time-fractional Kawahara equations are used to analyze cold collision-free plasma, which exhibits magnet-acoustic waves and shock wave formation respectively. The decomposition method is used to solve the proposed equations. Also, the convergence and uniqueness of the obtained solution are discussed. To illuminate the effectiveness of the presented method, the solutions of these equations are obtained and compared with the exact solution. Furthermore, solutions are obtained for different values of time-fractional order and represented graphically.

In this paper Heun method has been used to find numerical solution for first order nonlinear functional differential equation. Moreover, this method has been modified in order to treat system of nonlinear functional differential equations .two numerical examples are given for conciliated the results of this method.

A new Differential Evolution (ARDE) algorithm is introduced that automatically adapt a repository of DE strategies and parameters adaptation schemes of the mutation factor and the crossover rate to avoid the problems of stagnation and make DE responds to a wide range of function characteristics at different stages of the evolution. ARDE algorithm makes use of JADE strategy and the MDE_pBX parameters adaptive schemes as frameworks. Then a new adaptive procedure called adaptive repository (AR) has been developed to select the appropriate combinations of the JADE strategies and the parameter control schemes of the MDE_pBX to generate the next population based on their fitness values. Experimental results have been presented to confirm the reli

Precision is one of the main elements that control the quality of a geodetic network, which defines as the measure of the network efficiency in propagation of random errors. This research aims to solve ZOD and FOD problems for a geodetic network using Rosenbrock Method to optimize the geodetic networks by using MATLAB programming language, to find the optimal design of geodetic network with high precision. ZOD problem was applied to a case study network consists of 19 points and 58 designed distances with a priori deviation equal to 5mm, to determine the best points in the network to consider as control points. The results showed that P55 and P73 having the minimum ellipse of error and considered as control points. FOD problem was applie

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