• Journal of Applied and Pure Mathematics
• /
• v.5 no.1_2
• /
• pp.69-93
• /
• 2023

Here we give multivariate quantitative approximations of Banach space valued continuous multivariate functions on a box or ℝ^N, N ∈ ℕ, by the multivariate normalized, quasi-interpolation, Kantorovich type and quadrature type neural network operators. We treat also the case of approximation by iterated operators of the last four types. These approximations are derived by establishing multidimensional Jackson type inequalities involving the multivariate modulus of continuity of the engaged function or its high order Fréchet derivatives. Our multivariate operators are defined by using a multidimensional density function induced by a parametrized Gudermannian sigmoid function. The approximations are pointwise and uniform. The related feed-forward neural network is with one hidden layer.

• Bulletin of the Korean Mathematical Society
• /
• v.47 no.4
• /
• pp.825-837
• /
• 2010

In this paper, we obtain a Korovkin type approximation theorem for double sequences of positive linear operators of two variables from $H_w$ (K) to C (K) via A-statistical convergence. Also, we construct an example such that our new approximation result works but its classical case does not work. Furthermore, we study the rates of A-statistical convergence by means of the modulus of continuity.

• Kyungpook Mathematical Journal
• /
• v.58 no.3
• /
• pp.453-462
• /
• 2018

In this paper, we present a symbolic formulation of the error obtained due to an approximation of a given function by the mixed-interpolating function. Using the proposed symbolic method, we compute the error evaluation operator as well as the error estimation at any arbitrary point. We also present an algorithm to compute an approximation of a function by the mixed interpolation technique in terms of projector operator. Certain examples are presented to illustrate the proposed algorithm. Maple implementation of the proposed algorithm is discussed with sample computations.

• Kyungpook Mathematical Journal
• /
• v.59 no.4
• /
• pp.679-688
• /
• 2019

In the present note, we study some approximation properties of the Szász type operators based on Charlier polynomials introduced by S. Varma and F. Taşdelen (Math. Comput. Modelling, 56 (5-6) (2012) 108-112). We establish the rates of A-statistical convergence of these operators. Finally, we prove a Voronovskaja type approximation theorem and local approximation theorem via the concept of A-statistical convergence.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.191-196
• /
• 1991

LQG/LTR method have a theoretical constraint that it cannot applied to nonminimum phase plant. In this paper, we suggest two methods of approximation of minimum phase plant for a given nonminimum phase plant to solve this constraint. Error is described by additive form which can reduce its magnitude in broad frequency range. A optimal approximation method was suggesetd by using Hankel operator theory and Nehari theory. It is showen by example that the methods suggested can resolve the frequency domain constraint arised in Stein and Athans approximation.

• Kyungpook Mathematical Journal
• /
• v.56 no.3
• /
• pp.877-897
• /
• 2016

In the present article, we study some approximation properties of the Kantorovich type generalization of $Sz{\acute{a}}sz$ type operators involving Charlier polynomials introduced by S. Varma and F. Taşdelen (Math. Comput. Modelling, 56 (5-6) (2012) 108-112). First, we establish approximation in a Lipschitz type space, weighted approximation theorems and A-statistical convergence properties for these operators. Then, we obtain the rate of approximation of functions having derivatives of bounded variation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.10
• /
• pp.972-980
• /
• 1991

LQG/LTR method have a theoretical constraint that it cannot applied to nonminimum phase plant. In this paper we suggest two methods of approximation of minimum phase plant for a given nonminimum phase plant to solve this constraint. Error is described by additive form which can reduce its magnitude in broad frequency range. A optimal approximation method was suggested by using Hankel operator theory and Nehan theory it is shown by example that the methods suggested can resolve the frequency domain constraint arised in Stein and Athans approximation.

• Communications of the Korean Mathematical Society
• /
• v.19 no.2
• /
• pp.293-305
• /
• 2004

Trotter-Kato type approximations of the convoluted solution operator families for the Volterra integral equations (V $E_n$): v(t)=$A_{n} \int_0^t v(t-s) d\mu_n(s) + f_n(t), t \geq 0$ and the convergence of the solutions to the equations (V $E_n$) are studied.

• Journal of Institute of Control, Robotics and Systems
• /
• v.4 no.3
• /
• pp.308-314
• /
• 1998

This paper studies the problem of computing the Hankel singular values and vectors in the input delay systems. It is shown that the Hankel singular values are solutions to a transcendental equation and the Hankel singular vectors are obtained from the kernel of the matrix. The computation is carried out in state space framework. Finally, Hankel approximation of a simple example shows the usefulness of this study.

• Coupled systems mechanics
• /
• v.1 no.4
• /
• pp.325-343
• /
• 2012

We present different numerical methods for solving the shallow shelf equations with basal drag (SSAB). An alternative approach of splitting the SSAB equation into a Laplacian and diagonal shift operator is discussed with respect to the underlying eigenvalue problem. First, we solve the equations using standard methods. Then, the coupled equations are decomposed into operators for membranes stresses, basal shear stress and driving stress. Applying reasonable parameter values, we demonstrate that the operator of the membrane stresses is much stiffer than the operator of the basal shear stress. Here, we could apply a new splitting method, which alternates between the iteration on the membrane-stress operator and the basal-shear operator, with a more frequent iteration on the operator of the membrane stresses. We show that this splitting accelerates and stabilize the computational performance of the numerical method, although an appropriate choice of the standard method used to solve for all operators in one step speeds up the scheme as well.