Towards a maximal extension of Pelczynski`s decomposition method in Banach spaces

l Suppose that X, Y. A and B are Banach spaces such that X is isomorphic to Y E) A and Y is isomorphic to X circle plus B. Are X and Y necessarily isomorphic? In this generality. the answer is no, as proved by W.T. Cowers in 1996. In the present paper, we provide a very simple necessary and sufficient condition on the 10-tuples (k, l, m, n. p, q, r, s, u, v) in N with p+q+u >= 3, r+s+v >= 3, uv >= 1, (p,q)$(0,0), (r,s)not equal(0,0) and u=1 or v=1 or (p. q) = (1, 0) or (r, s) = (0, 1), which guarantees that X is isomorphic to Y whenever these Banach spaces satisfy X(u) similar to X(p)circle plus Y(q), Y(u) similar to X(r)circle plus Y(s), and A(k) circle plus B(l) similar to A(m) circle plus B(n). Namely, delta = +/- 1 or lozenge not equal 0, gcd(lozenge, delta (p + q - u)) divides p + q - u and gcd(lozenge, delta(r + s - v)) divides r + s - v, where 3 = k - I - in + n is the characteristic number of the 4-tuple (k, l, m, n) and lozenge = (p - u)(s - v) - rq is the discriminant of the 6-tuple (p, q, r, s, U, v). We conjecture that this result is in some sense a maximal extension of the classical Pelczynski`s decomposition method in Banach spaces: the case (1, 0. 1, 0, 2. 0, 0, 2. 1. 1). (C) 2009 Elsevier Inc. All rights reserved.

Generalizations of Pelczynski`s decomposition method for Banach spaces containing a complemented copy of their squares

Suppose that X and Y are Banach spaces isomorphic to complemented subspaces of each other. In 1996, W. T. Gowers solved the Schroeder- Bernstein Problem for Banach spaces by showing that X is not necessarily isomorphic to Y. However, if X-2 is complemented in X with supplement A and Y-2 is complemented in Y with supplement B, that is, { X similar to X-2 circle plus A Y similar to Y-2 circle plus B, then the classical Pelczynski`s decomposition method for Banach spaces shows that X is isomorphic to Y whenever we can assume that A = B = {0}. But unfortunately, this is not always possible. In this paper, we show that it is possible to find all finite relations of isomorphism between A and B which guarantee that X is isomorphic to Y. In order to do this, we say that a quadruple (p, q, r, s) in N is a P-Quadruple for Banach spaces if X is isomorphic to Y whenever the supplements A and B satisfy A(p) circle plus B-q similar to A(r) circle plus B-s . Then we prove that (p, q, r, s) is a P-Quadruple for Banach spaces if and only if p - r = s - q = +/- 1.

Approximate closed-form solutions of realistic true proportional navigation guidance using the Adomian decomposition method

Approximate closed-form solutions of the non-linear relative equations of motion of an interceptor pursuing a target under the realistic true proportional navigation (RTPN) guidance law are derived using the Adomian decomposition method in this article. In the literature, no study has been reported on derivation of explicit time-series solutions in closed form of the nonlinear dynamic engagement equations under the RTPN guidance. The Adomian method provides an analytical approximation, requiring no linearization or direct integration of the non-linear terms. The complete derivation of the Adomian polynomials for the analysis of the dynamics of engagement under RTPN guidance is presented for deterministic ideal case, and non-ideal dynamics in the loop that comprises autopilot and actuator dynamics and target manoeuvre, as well as, for a stochastic case. Numerical results illustrate the applicability of the method.

An adaptive decomposition method for video

Scalable video coding (SVC) is an emerging standard built on the success of advanced video coding standard (H.264/AVC) by the Joint video team (JVT). Motion compensated temporal filtering (MCTF) and Closed loop hierarchical B pictures (CHBP) are two important coding methods proposed during initial stages of standardization. Either of the coding methods, MCTF/CHBP performs better depending upon noise content and characteristics of the sequence. This work identifies other characteristics of the sequences for which performance of MCTF is superior to that of CHBP and presents a method to adaptively select either of MCTF and CHBP coding methods at the GOP level. This method, referred as "Adaptive Decomposition" is shown to provide better R-D performance than of that by using MCTF or CRBP only. Further this method is extended to non-scalable coders.

A new parallel overlapped domain decomposition method for nonlinear dynamic finite element analysis

In this paper a new parallel algorithm for nonlinear transient dynamic analysis of large structures has been presented. An unconditionally stable Newmark-beta method (constant average acceleration technique) has been employed for time integration. The proposed parallel algorithm has been devised within the broad framework of domain decomposition techniques. However, unlike most of the existing parallel algorithms (devised for structural dynamic applications) which are basically derived using nonoverlapped domains, the proposed algorithm uses overlapped domains. The parallel overlapped domain decomposition algorithm proposed in this paper has been formulated by splitting the mass, damping and stiffness matrices arises out of finite element discretisation of a given structure. A predictor-corrector scheme has been formulated for iteratively improving the solution in each step. A computer program based on the proposed algorithm has been developed and implemented with message passing interface as software development environment. PARAM-10000 MIMD parallel computer has been used to evaluate the performances. Numerical experiments have been conducted to validate as well as to evaluate the performance of the proposed parallel algorithm. Comparisons have been made with the conventional nonoverlapped domain decomposition algorithms. Numerical studies indicate that the proposed algorithm is superior in performance to the conventional domain decomposition algorithms. (C) 2003 Elsevier Ltd. All rights reserved.

Modified Adomian decomposition method for fracture of laminated uni-directional composites

In this paper, the well-known Adomian Decomposition Method (ADM) is modified to solve the fracture laminated multi-directional problems. The results are compared with the existing analytical/exact or experimental method. The already known existing ADM is modified to improve the accuracy and convergence. Thus, the modified method is named as Modified Adomian Decomposition Method (MADM). The results fromMADM are found to converge very quickly, simple to apply for fracture(singularity) problems and are more accurate compared to experimental and analytical methods. MADM is quite efficient and is practically well-suited for use in these problems. Several examples are given to check the reliability of the present method. In the present paper, the principle of the decomposition method is described, and its advantages form the analyses of fracture of laminated uni-directional composites.

Modified Adomian Decomposition Method for Van der Pol equations

In the paper, the well known Adomian Decomposition Method (ADM) is modified to solve the parabolic equations. The present method is quite different than the numerical method. The results are compared with the existing exact or analytical method. The already known existing Adomian Decomposition Method is modified to improve the accuracy and convergence. Thus, the modified method is named as Modified Adomian Decomposition Method (MADM). The Modified Adomian Decomposition Method results are found to converge very quickly and are more accurate compared to ADM and numerical methods. MADM is quite efficient and is practically well suited for use in these problems. Several examples are given to check the reliability of the present method. Modified Adomian Decomposition Method is a non-numerical method which can be adapted for solving parabolic equations. In the current paper, the principle of the decomposition method is described, and its advantages are shown in the form of parabolic equations. (C) 2014 The Authors. Published by Elsevier Ltd. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/3.0/).

A Multiscale-Domain Decomposition Method for High Reynolds Number Flows

The high Reynolds number flow contains a wide range of length and time scales, and the flow domain can be divided into several sub-domains with different characteristic scales. In some sub-domains, the viscosity dissipation scale can only be considered in a certain direction; in some sub-domains, the viscosity dissipation scales need to be considered in all directions; in some sub-domains, the viscosity dissipation scales are unnecessary to be considered at all. For laminar boundary layer region, the characteristic length scales in the streamwise and normal directions are L and L Re-1/ 2 , respectively. The characteristic length scale and the velocity scale in the outer region of the boundary layer are L and U, respectively. In the neighborhood region of the separated point, the length scale l<decomposition method is developed for the high Reynolds number flow. First, the whole domain is decomposed to different sub-domains with the different characteristic scales. Then the different dominant equation of all sub-domains is defined according to the diffusion parabolized (DP) theory of viscous flow. Finally these different equations are solved simultaneously in whole computational region. For numerical tests of high Reynolds numerical flows, two-dimensional supersonic flows over rearward and frontward steps as well as an interaction flow between shock wave and boundary layer were solved numerically. The pressure distributions and local coefficients of skin friction on the wall are given. The numerical results obtained by the multiscale-domain decomposition algorithm are well agreement with those by NS equations. Comparing with the usual method of solving the Navier-Stokes equations in the whole flow, under the same numerical accuracy, the present multiscale domain decomposition method decreases CPU consuming about 20% and reflects the physical mechanism of practical flow more accurately.

Studying nonlinear effects on the early stage of phase ordering using a decomposition method

Nonlinear effects on the early stage of phase ordering are studied using Adomian's decomposition method for the Ginzburg-Landau equation for a nonconserved order parameter. While the long-time regime and the linear behavior at short times of the theory are well understood, the onset of nonlinearities at short times and the breaking of the linear theory at different length scales are less understood. In the Adomians decomposition method, the solution is systematically calculated in the form of a polynomial expansion for the order parameter, with a time dependence given as a series expansion. The method is very accurate for short times, which allows to incorporate the short-time dynamics of the nonlinear terms in a analytical and controllable way. (c) 2005 Elsevier B.V. All rights reserved.

An application of the Adomian's decomposition method to the analysis of MHD duct flows

A new approach is proposed in this work for the treatment of boundary value problems through the Adomian's decomposition method. Although frequently claimed as accurate and having fast convergence rates, the original formulation of Adomian's method does not allow the treatment of homogeneous boundary conditions along closed boundaries. The technique here presented overcomes this difficulty, and is applied to the analysis of magnetohydrodynamic duct flows. Results are in good agreement with finite element method calculations and analytical solutions for square ducts. Therefore, new possibilities appear for the application of Adomian's method in electromagnetics.

A decentralized approach for optimal reactive power dispatch using a Lagrangian decomposition method

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)