We say a functional equation () is stable if any function g satisfying the equation () approximatelyis near to true solution of (). Using xed point methods, we investigate approximately higherternary derivations in Banach ternary algebras via the Cauchy functional equationf(1x + 2y + 3z) = 1f(x) + 2f(y) + 3f(z) :

In this paper, we prove that an implicit iterative process with er-rors converges strongly to a common xed point for a nite family of generalizedasymptotically quasi-nonexpansive mappings on unbounded sets in a uniformlyconvex Banach space. Our results unify, improve and generalize the correspond-ing results of Ud-din and Khan [4], Sun [21], Wittman [23], Xu and Ori [26] andmany others.

There is a class of implication-based methods that identify logic redundancy from circuit topology and without any primary input assignment. These methods are less complex than automatic test pattern generation ATPG but identify only a subset of all redundancies. This paper provides new results to enlarge this subset. Contributions are a xed-value theorem and two theorems on fanout stem unobser...

the aim of this work is to describe the qualitative behavior of the solution set of a givensystem of fractional differential equations and limiting behavior of the dynamical system or flow defined by the system of fractional differential equations. in order to achieve this goal, it is first necessary to develop the local theory for fractional nonlinear systems. this is done by the extension of ...

Some fixed point theorems and common fixed point theorem in Logarithmic convex structure areproved.

A common xed theorem is proved for two pairs of compatible mappings on a normed vector space.

In this paper‎, ‎we introduce a new type of graph contraction using a special class of functions and give a best proximity point theorem for this contraction in complete metric spaces endowed with a graph under two different conditions‎. ‎We then support our main theorem by a non-trivial example and give some consequences of best proximity point of it for usual graphs.

A xed-point C compiler is developed for convenient and efcient programming of TMS320C50 xed-point digital signal processor. This compiler supports the `fix' data type that can have an individual integer word-length according to the range of a variable. It can add or subtract two data having di erent integer word-lengths by automatically inserting shift operations. The accuracy of xed-point mult...

In this paper we formulate and prove some xed and common xed pointTheorems for self-mappings dened on complete lower Transversal functionalprobabilistic spaces.

The paper addresses the question of when the least-xed-point operator, in a cartesian closed category of domains, is characterised as the unique dinatural transformation from the exponentiation bifunctor to the identity functor. We give a suucient condition on a cartesian closed full subcategory of the category of algebraic cpos for the characterisation to hold. The condition is quite mild, and...