For a contractive iterated function system (IFS), it is known that there natural hyperbolic graph structure (augmented tree) on the symbolic space of IFS reflects relationship among neighboring cells, and its boundary with Gromov metric Hölder equivalent to attractor K [14], [26], [28]. This setup was taken up study probabilistic potential theory [21], [20], bi-Lipschitz equivalence [29]. In th...

We deal with the problem of preserving various versions of completeness in (< κ)–support iterations of forcing notions, generalizing the case " S–complete proper is preserved by CS iterations for a stationary co-stationary S ⊆ ω 1 ". We give applications to Uniformization and the Whitehead problem. In particular, for a strongly inaccessible cardinal κ and a stationary set S ⊆ κ with fat complem...

In this paper, weconsider the fourth order p-Laplacian beam equation (?p(u??(t)))?? = f (t, u(t), u??(t)) with integral boundary conditions u??(0) u??(1) 0, u(0)??u?(0) ?10 g1(s)u(s)ds, u(1)+?u?(1) ? 10 g2(s)u(s)ds. By using contraction mapping principle, we establish existence and uniqueness of solutions for problem. The monotony iterations is also considered. At last, some examples are presen...

We study the asymptotic behaviour of Forsythe’s s-optimum gradient algorithm for the minimization of a quadratic function in R using a renormalization that converts the algorithm into iterations applied to a probability measure. Bounds on the performance of the algorithm (rate of convergence) are obtained through optimum design theory and the limiting behaviour of the algorithm for s = 2 is inv...

This paper presents a gray box approach for identifying physical parameters of an electromechanical actuator based on frequency response data. A feedforward and Linear-Quadratic Regulator feedback controller was developed to control the EMCV actuator for soft seating. A repetitive learning controller was designed to enhance the control performance through cycleto-cycle iterations. Experimental ...

where (x, y) ∈ S. The effects of an affine transform on a set are depicted in fig. 1. The union of N affine transformations is called the Hutchinson operator: W = ⋃N n=1 wn. For a specified metric the distance h(A, B) between two sets A, B can be defined. Under certain conditions [2] the Hutchinson operator is contractive, h(W (A),W (B)) ≤ sh(A, B), s < 1. Successive iterations with Hutchinson ...