Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userAlgorithm Univariate Teomterpolation of Piecewise Function
خوارزمية استيفاء داخلي خطي لتابع أملس
935
0 50
0
(
0
)
Authors
هاشم عبدللي( باحث )
Created by
Shamra Editor
Ask ChatGPT about the research
تم في هذا البحث وضع خوارزمية جديدة لاستيفاء داخلي بوساطة حدوديات تكعيبية بين كل نقطتين متتاليتين من نقاط التوزيع التي تعتمد على إيجاد المشتقات من المرتبين الأولى و الثانية. حيث تم توزيع النقاط المعطاة إلى مجموعات ثلاثية و بشكلين, الشكل الأول و هو الموجود في ( ٦)، و أن عدد المجموعات الثلاثية و المسماة الجسور يساوي N-1, و أن N هو عدد النقاط.
Algorithm of fitting curves based on piecewise function composed of a set of third degree polynomials is presented in this paper. These polynomials are applicable to successive intervals of the given data points. This algorithm applied to the method of univariate interpolation, which developed by the author [٦]. This method depends on the values of the first order derivative at the data points.
References used
Akima. H, (١٩٦٩), a method of smooth curve fitting, ESS technical report no. ١٠١- ITS ٧٣, U.S. Government printing office, Washington, D.C
Akima. H, (١٩٧٠), anew method of interpolation and smooth curve fitting based on local procedures, ACM, vol. ١٧, pp. ٥٨٩-٦٠٢
rate research
Read More
In this paper, we introduce an Effective algorithm to find the
shortest path in Multiple – Source Graph, by choosing the path
between the source and the distance that gives at least the length of
the path down to the sink. This algorithm is based
on the principle
of iteration to access the optimal solution of the shortest-path
problem, Where the algorithm steps are repeated for all the darts in
the Graph. We proved that the time of implementation of the
proposed algorithm in this paper is linear time O(n+L) and This is
considered the best times of the algorithms at all.
This paper introduces a new algorithm to solve some problems
that data clustering algorithms such as K-Means suffer from.
This new algorithm by itself is able to cluster data without the
need of other clustering algorithms.
In this paper, we introduce a modification to fuzzy mountain
data clustering algorithm. We were able to make this algorithm
working automatically, through finding a way to divide the
space, to determine the values of the input parameters, and
the stop condition automatically, instead of getting them by the
user.
In this paper, we introduce a modification to fuzzy mountain
data clustering algorithm. We were able to make this algorithm
working automatically, through finding a way to divide the
space, to determine the values of the input parameters, and
the stop condition automatically, instead of getting them by the
user.
Modeling solar radiation consider one of important and helpful
matter in researches in generation an electric power from solar
cells.
Researchers interested in this subject and put number of
mathematical models to modeling solar radiation.
In th
is paper we will study one of this models (cloudiness degree
model), then put algorithm for it, and based on it writing program
using mathlab, then comparing this results with real value taken
from position in Syrian Arabic.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
