An example of an operator satisfying assumptions (g1 - g3) is given here.
An example of an operator is given, which is both a restriction and a quotient of a generalized scalar operator, but which is even not strongly decomposable.
An example of an operator that is computable is ( L n y ) ( t ) ≡ y ( n ) ( t ) + ∑ i = 0 n − 1 ∑ j = 1 n i p i j ( t ) y ( i ) [ h i j ( t ) ] = f ( t ), y ( i ) = 0, ξ ∉ [ 0, T ], t ∈ [ 0, T ], if the coefficients p i j are the elements of the set P m n and the functions h i j are computable over the partition (6) in the generalized sense.
To date, there is no example of any operator that requires Noor iteration; that is, no example of an operator for which Noor iteration converges, but for which neither Mann nor Ishikawa converges.
We give a simple example of an operator which satisfies condition ((S_)_{T}) but not condition ((S_)); see also [11], Example 3.3.
FedEx, for example, as an operator of trucks, supported the first-ever fuel efficiency and greenhouse gas standards for US commercial vehicles, which were enacted in 2007.
Greylock's John Lilly is a strong example of an operator with domain expertise.
For example, let an operator be in state (mathrm{III}_{2}).
The following example provides an operator which is algebraically quasi-paranormal but not quasi-paranormal.
Crown software, for example, requires an operator to run through an inspection of the equipment and determines whether his training is up to date.
