In this paper, we first construct a preconditioned two-parameter generalized Hermitian and skew-Hermitian splitting (PTGHSS) iteration method based on the two-parameter generalized Hermitian and skew-Hermitian splitting (TGHSS) iteration method for non-Hermitian positive definite linear systems. Then a class of PTGHSSbased iteration methods are proposed for solving weakly nonlinear systems base...

‎The present paper is devoted to the existence and uniqueness result of the fractional evolution equation $D^{q}_c u(t)=g(t,u(t))=Au(t)+f(t)$‎ ‎for the real $qin (0,1)$ with the initial value $u(0)=u_{0}intilde{R}$‎, ‎where $tilde{R}$ is the set of all generalized real numbers and $A$ is an operator defined from $mathcal G$ into itself‎. Here the Caputo fractional derivative $D^{q}_c$ is used i...

In this paper, we introduce some new types of pairs of mappings (f , g) on G-metric spaces called G-weakly commuting of type Gf and G–R-weakly commuting of type Gf . We obtain also several common fixed point results by using the (E.A) property. © 2012 Elsevier Ltd. All rights reserved.

Conditions are found on a sequence of probability measures pn on a locally compact abelian group G so that, for any strongly continuous unitary representation of G, J" Utfd/x„ will converge to a [/-invariant function. These conditions are applied in the case where the group is the integers. Introduction. In a recent paper [3] Greenleaf discusses summing sequences in amenable locally compact gro...

For a connected graph G and any non-empty S ⊆ V (G), S is called a weakly connected dominating set of G if the subgraph obtained from G by removing all edges each joining any two vertices in V (G) \ S is connected. The weakly connected domination number γw(G) is defined to be the minimum integer k with |S| = k for some weakly connected dominating set S of G. In this note, we extend a result on ...

Let G be a connected graph with vertex set V (G). A set S of vertices in G is called a weakly connected dominating set of G if (i) S is a dominating set of G and (ii) the graph obtained from G by removing all edges joining two vertices in V (G) \ S is connected. A weakly connected dominating set S of G is said to be minimum or a γw-set if |S| is minimum among all weakly connected dominating set...

We study properties of generalized Pickands constants H that appear in the extreme value theory of Gaussian processes and are de ned via the limit H lim T H T T where H T IE exp maxt T p t Var t and t is a centered Gaussian process with stationary increments We give estimates of the rate of convergence of H T T to H and prove that if n t weakly converges in C to t then under some weak condition...