• Nonlinear Functional Analysis and Applications
• /
• v.26 no.1
• /
• pp.165-175
• /
• 2021

In this article we derive some best approximation theorems for multimaps in abstract convex metric spaces. We are based on generalized KKM maps due to Kassay-Kolumbán, Chang-Zhang, and studied by Park, Kim-Park, Park-Lee, and Lee. Our main results are extensions of a recent work of Mitrović-Hussain-Sen-Radenović on G-convex metric spaces to partial KKM metric spaces. We also recall known works related to single-valued maps, and introduce new partial KKM metric spaces which can be applied our new results.

• The Pure and Applied Mathematics
• /
• v.8 no.1
• /
• pp.9-14
• /
• 2001

In some problems of abstract approximation theory the approximating set depends on some parameter p. In this paper, we make a set M(f) depends on the element f, $\phi$ and then best approximations are sought from a subset M(f) of M.

• Journal of Applied and Pure Mathematics
• /
• v.4 no.3_4
• /
• pp.185-209
• /
• 2022

Here we exhibit 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 achieved 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 the generalized symmetrical sigmoid function. The approximations are point-wise and uniform. The related feed-forward neural network is with one hidden layer.

• ETRI Journal
• /
• v.16 no.4
• /
• pp.27-47
• /
• 1995

This paper improves top-down execution models of logic programs based on a two-phase abstract interpretation which consists of a bottom-up analysis followed by a top-down one. The two-phase analysis provides an approximation of all (possibly non-ground) success patterns of clauses relevant to a query. It is specialized by considering Sato and Tamaki’s depth k abstraction as abstract function. By the ability of the analysis to approximate possibly non-ground success patterns of clauses relevant to a query, it can be statically determined whether some subgoals will fail during execution and some succeeding subgoals do not participate in success patterns of program clauses relevant to a given query. These properties are utilized to improve execution models. This approach can be easily applied to any top-down (parallel) execution models. As instances, it is shown to be applicable to linear execution model and AND/OR Process Model.

• Journal of Korea Spatial Information System Society
• /
• v.7 no.2 s.14
• /
• pp.57-66
• /
• 2005

The Interconnecting Highways problem is an abstract of many practical Layout Design problems in the areas of VLSI design, the optical and wired network design, and the planning for the road constructions. For the road constructions, the shortest-length road layouts that interconnect existing positions will provide many more economic benefits than others. That is, finding new road layouts to interconnect existing roads and cities over a wide area is an important issue. This paper addresses an approximation scheme that finds near optimal road layouts for the Interconnecting Highways problem which is NP-hard. As long as computational resources are provided, the near optimality can be acquired asymptotically. This implies that the result of the scheme can be regarded as the optimal solution for the problem in practice. While other approximation schemes can be made for the problem, this proposed scheme provides a big merit that the algorithm designed by this scheme fits well to given problem instances.

• Journal of applied mathematics & informatics
• /
• v.33 no.5_6
• /
• pp.699-721
• /
• 2015

This paper investigates the existence of mild solution for a fractional integro-differential equations with a deviating argument and nonlocal initial condition in an arbitrary separable Hilbert space H via technique of approximations. We obtain an associated integral equation and then consider a sequence of approximate integral equations obtained by the projection of considered associated nonlocal fractional integral equation onto finite dimensional space. The existence and uniqueness of solutions to each approximate integral equation is obtained by virtue of the analytic semigroup theory via Banach fixed point theorem. Next we demonstrate the convergence of the solutions of the approximate integral equations to the solution of the associated integral equation. We consider the Faedo-Galerkin approximation of the solution and demonstrate some convergenceresults. An example is also given to illustrate the abstract theory.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.8
• /
• pp.62-67
• /
• 2007

In some wireless sensor networks, the sensor nodes are required to be located sparsely at designated positions over a wide area, introducing the problem of adding minimum number of relay nodes to interconnect the sensor nodes. The problem finds its form in literature: the Minimum number of Steiner Points. Since it is known to be NP-hard, this paper proposes an approximation scheme to estimate the minimum number of relay nodes through the properties of the abstract from. Reducing the number of nodes in a sensor network, the amount of data exchange over the net will be far decreased.

• Kyungpook Mathematical Journal
• /
• v.56 no.1
• /
• pp.221-233
• /
• 2016

The present paper proposes a new monotone iteration method for existence as well as approximation of the coupled solutions for a coupled periodic boundary value problem of first order ordinary nonlinear differential equations. A new hybrid coupled fixed point theorem involving the Dhage iteration principle is proved in a partially ordered normed linear space and applied to the coupled periodic boundary value problems for proving the main existence and approximation results of this paper. An algorithm for the coupled solutions is developed and it is shown that the sequences of successive approximations defined in a certain way converge monotonically to the coupled solutions of the related differential equations under some suitable mixed hybrid conditions. A numerical example is also indicated to illustrate the abstract theory developed in the paper.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.11 no.4
• /
• pp.1-8
• /
• 2007

In some wireless sensor networks, the sensor nodes are required to be located sparsely at designated positions over a wide area, introducing the problem of adding minimum number of relay nodes to interconnect the sensor nodes. The problem finds its a bstract form in literature: the Minimum number of Steiner Points. Since it is known to be NP-hard, this paper proposes an approximation scheme to estimate the minimum number of relay nodes through the properties of the abstract form. Note that by reducing the numb er of nodes in a sensor network, the amount of data exchange over the net will be far decreased.

• Journal of applied mathematics & informatics
• /
• v.4 no.2
• /
• pp.433-446
• /
• 1997

In this paper we study an existence and the approxi-mation of the solution of the solution of the elliptic variational inequality from an abstract axiomatic point of view. We discuss convergence results and give an error estimate for the difference of the two solutions in an appropriate norm Also we present some computational results by using fixed point method.