The aim of this paper is to approximate multidimensional functions by using the type of Feedforward neural networks (FFNNs) which is called Greedy radial basis function neural networks (GRBFNNs). Also, we introduce a modification to the greedy algorithm which is used to train the greedy radial basis function neural networks. An error bound are introduced in Sobolev space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result is published in [16]).

This paper proposes feedback linearization control (FBLC) based on function approximation technique (FAT) to regulate the vibrational motion of a smart thin plate considering the effect of axial stretching. The FBLC includes designing a nonlinear control law for the stabilization of the target dynamic system while the closedloop dynamics are linear with ensured stability. The objective of the FAT is to estimate the cubic nonlinear restoring force vector using the linear parameterization of weighting and orthogonal basis function matrices. Orthogonal Chebyshev polynomials are used as strong approximators for adaptive schemes. The proposed control architecture is applied to a thin plate with a large deflection that stimulates the axial loadin

Background/Aim: Endometrial abnormalities represent a diagnostic challenge due to overlapping imaging features with normal endometrium. Aim of this study was to assess accuracy of dynamic contrast-enhanced and diffusion-weighted magnetic resonance imaging (MRI) in evaluation of endometrial lesions in comparison with T2 and to assess local staging validity and degree of myometrial invasion in malignancy. Methods: Forty patients with abnormal vaginal bleeding or sonographic thickened endometrial were recruited. MRI examination of pelvis was per-formed using 1.5 T scanner with a pelvic array coil. Conventional T1-and T2, dynamic contrast-enhanced (DCE) sequences and diffusion-weighted image (DWI) were performed. Results: Mean age of pa

Abstract. Fibrewise micro-topological spaces be a useful tool in various branches of mathematics. These mathematical objects are constructed by assigning a micro-topology to each fibre from a fibre bundle. The fibrewise micro-topological space is then formed by taking the direct limit of these individual micro-topological spaces. It can be adapted to analyze various mathematical structures, from algebraic geometry to differential equations. In this study, we delve into the generalizations of fibrewise micro-topological spaces and explore the applications of these abstract structures in different branches of mathematics. This study aims to define the fibrewise micro topological space through the generalizations that we use in this paper, whi

هناك دائما حاجة إلى طريقة فعالة لتوليد حل عددي أكثر دقة للمعادلات التكاملية ذات النواة المفردة أو المفردة الضعيفة لأن الطرق العددية لها محدودة. في هذه الدراسة ، تم حل المعادلات التكاملية ذات النواة المفردة أو المفردة الضعيفة باستخدام طريقة متعددة حدود برنولي. الهدف الرئيسي من هذه الدراسة هو ايجاد حل تقريبي لمثل هذه المشاكل في شكل متعددة الحدود في سلسلة من الخطوات المباشرة. أيضا ، تم افتراض أن مقام النواة

In this paper, an approximate solution of nonlinear two points boundary variational problem is presented. Boubaker polynomials have been utilized to reduce these problems into quadratic programming problem. The convergence of this polynomial has been verified; also different numerical examples were given to show the applicability and validity of this method.

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

Chemical compounds, characteristics, and molecular structures are inevitably connected. Topological indices are numerical values connected with chemical molecular graphs that contribute to understanding a chemical compounds physical qualities, chemical reactivity, and biological activity. In this study, we have obtained some topological properties of the first dominating David derived (DDD) networks and computed several K-Banhatti polynomials of the first type of DDD.