Semiparametric Bayesian measurement error modeling

This work presents a Bayesian semiparametric approach for dealing with regression models where the covariate is measured with error. Given that (1) the error normality assumption is very restrictive, and (2) assuming a specific elliptical distribution for errors (Student-t for example), may be somewhat presumptuous; there is need for more flexible methods, in terms of assuming only symmetry of errors (admitting unknown kurtosis). In this sense, the main advantage of this extended Bayesian approach is the possibility of considering generalizations of the elliptical family of models by using Dirichlet process priors in dependent and independent situations. Conditional posterior distributions are implemented, allowing the use of Markov Chain Monte Carlo (MCMC), to generate the posterior distributions. An interesting result shown is that the Dirichlet process prior is not updated in the case of the dependent elliptical model. Furthermore, an analysis of a real data set is reported to illustrate the usefulness of our approach, in dealing with outliers. Finally, semiparametric proposed models and parametric normal model are compared, graphically with the posterior distribution density of the coefficients. (C) 2009 Elsevier Inc. All rights reserved.

Local solvability for a class of evolution equations

Motivated by the celebrated example of Y. Kannai of a linear partial differential operator which is hypoelliptic but not locally solvable, we consider it class of evolution operators with real-analytic coefficients and study their local solvability both in L(2) and in the weak sense. In order to do so we are led to propose a generalization of the Nirenberg-Treves condition (psi) which is suitable to our study. (C) 2009 Published by Elsevier Inc.

Cascades of Hopf bifurcations from boundary delay

We consider a 1-dimensional reaction-diffusion equation with nonlinear boundary conditions of logistic type with delay. We deal with non-negative solutions and analyze the stability behavior of its unique positive equilibrium solution, which is given by the constant function u equivalent to 1. We show that if the delay is small, this equilibrium solution is asymptotically stable, similar as in the case without delay. We also show that, as the delay goes to infinity, this equilibrium becomes unstable and undergoes a cascade of Hopf bifurcations. The structure of this cascade will depend on the parameters appearing in the equation. This equation shows some dynamical behavior that differs from the case where the nonlinearity with delay is in the interior of the domain. (C) 2009 Elsevier Inc. All rights reserved.

Efficient solutions to robust, semi-implicit discretizations of the immersed boundary method

The immersed boundary method is a versatile tool for the investigation of flow-structure interaction. In a large number of applications, the immersed boundaries or structures are very stiff and strong tangential forces on these interfaces induce a well-known, severe time-step restriction for explicit discretizations. This excessive stability constraint can be removed with fully implicit or suitable semi-implicit schemes but at a seemingly prohibitive computational cost. While economical alternatives have been proposed recently for some special cases, there is a practical need for a computationally efficient approach that can be applied more broadly. In this context, we revisit a robust semi-implicit discretization introduced by Peskin in the late 1970s which has received renewed attention recently. This discretization, in which the spreading and interpolation operators are lagged. leads to a linear system of equations for the inter-face configuration at the future time, when the interfacial force is linear. However, this linear system is large and dense and thus it is challenging to streamline its solution. Moreover, while the same linear system or one of similar structure could potentially be used in Newton-type iterations, nonlinear and highly stiff immersed structures pose additional challenges to iterative methods. In this work, we address these problems and propose cost-effective computational strategies for solving Peskin`s lagged-operators type of discretization. We do this by first constructing a sufficiently accurate approximation to the system`s matrix and we obtain a rigorous estimate for this approximation. This matrix is expeditiously computed by using a combination of pre-calculated values and interpolation. The availability of a matrix allows for more efficient matrix-vector products and facilitates the design of effective iterative schemes. We propose efficient iterative approaches to deal with both linear and nonlinear interfacial forces and simple or complex immersed structures with tethered or untethered points. One of these iterative approaches employs a splitting in which we first solve a linear problem for the interfacial force and then we use a nonlinear iteration to find the interface configuration corresponding to this force. We demonstrate that the proposed approach is several orders of magnitude more efficient than the standard explicit method. In addition to considering the standard elliptical drop test case, we show both the robustness and efficacy of the proposed methodology with a 2D model of a heart valve. (C) 2009 Elsevier Inc. All rights reserved.

Instability of equilibrium points of some Lagrangian systems

In this work we show that, if L is a natural Lagrangian system such that the k-jet of the potential energy ensures it does not have a minimum at the equilibrium and such that its Hessian has rank at least n - 2, then there is an asymptotic trajectory to the associated equilibrium point and so the equilibrium is unstable. This applies, in particular, to analytic potentials with a saddle point and a Hessian with at most 2 null eigenvalues. The result is proven for Lagrangians in a specific form, and we show that the class of Lagrangians we are interested can be taken into this specific form by a subtle change of spatial coordinates. We also consider the extension of this results to systems subjected to gyroscopic forces. (C) 2008 Elsevier Inc. All rights reserved.

Three-dimensional, fully adaptive simulations of phase-field fluid models

We present an efficient numerical methodology for the 31) computation of incompressible multi-phase flows described by conservative phase-field models We focus here on the case of density matched fluids with different viscosity (Model H) The numerical method employs adaptive mesh refinements (AMR) in concert with an efficient semi-implicit time discretization strategy and a linear, multi-level multigrid to relax high order stability constraints and to capture the flow`s disparate scales at optimal cost. Only five linear solvers are needed per time-step. Moreover, all the adaptive methodology is constructed from scratch to allow a systematic investigation of the key aspects of AMR in a conservative, phase-field setting. We validate the method and demonstrate its capabilities and efficacy with important examples of drop deformation, Kelvin-Helmholtz instability, and flow-induced drop coalescence (C) 2010 Elsevier Inc. All rights reserved

The C(K, X) spaces for compact metric spaces K and X with a uniformly convex maximal factor

In this paper, we prove that if a Banach space X contains some uniformly convex subspace in certain geometric position, then the C(K, X) spaces of all X-valued continuous functions defined on the compact metric spaces K have exactly the same isomorphism classes that the C(K) spaces. This provides a vector-valued extension of classical results of Bessaga and Pelczynski (1960) [2] and Milutin (1966) [13] on the isomorphic classification of the separable C(K) spaces. As a consequence, we show that if 1 < p < q < infinity then for every infinite countable compact metric spaces K(1), K(2), K(3) and K(4) are equivalent: (a) C(K(1), l(p)) circle plus C(K(2), l(q)) is isomorphic to C(K(3), l(p)) circle plus (K(4), l(q)). (b) C(K(1)) is isomorphic to C(K(3)) and C(K(2)) is isomorphic to C(K(4)). (C) 2011 Elsevier Inc. All rights reserved.

On the Hamilton-Jacobi equation in the framework of generalized functions

In this work we study, in the framework of Colombeau`s generalized functions, the Hamilton-Jacobi equation with a given initial condition. We have obtained theorems on existence of solutions and in some cases uniqueness. Our technique is adapted from the classical method of characteristics with a wide use of generalized functions. We were led also to obtain some general results on invertibility and also on ordinary differential equations of such generalized functions. (C) 2011 Elsevier Inc. All rights reserved.

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.

Banach spaces without minimal subspaces

We prove three new dichotomies for Banach spaces a la W.T. Gowers` dichotomies. The three dichotomies characterise respectively the spaces having no minimal subspaces, having no subsequentially minimal basic sequences, and having no subspaces crudely finitely representable in all of their subspaces. We subsequently use these results to make progress on Gowers` program of classifying Banach spaces by finding characteristic spaces present in every space. Also, the results are used to embed any partial order of size K I into the subspaces of any space without a minimal subspace ordered by isomorphic embeddability. (c) 2009 Elsevier Inc. All fights reserved.

Irreducible morphisms of categories of complexes

We study irreducible morphisms of complexes. In particular, we show that the irreducible morphisms having one (finite) irreducible submorphism fall into three canonical forms and we give necessary and sufficient conditions for a given morphism of that type to be irreducible. Our characterization of the above mentioned type of irreducible morphisms of complexes characterizes also some class of irreducible morphisms of the derived category D(-)(A) for A a finite dimensional k-algebra, where k is a field. (C) 2009 Published by Elsevier Inc.

A criterion for unitary similarity of upper triangular matrices in general position

Each square complex matrix is unitarily similar to an upper triangular matrix with diagonal entries in any prescribed order. Let A = [a(ij)] and B = [b(ij)] be upper triangular n x n matrices that are not similar to direct sums of square matrices of smaller sizes, or are in general position and have the same main diagonal. We prove that A and B are unitarily similar if and only if parallel to h(A(k))parallel to = parallel to h(B(k))parallel to for all h is an element of C vertical bar x vertical bar and k = 1, ..., n, where A(k) := [a(ij)](i.j=1)(k) and B(k) := [b(ij)](i.j=1)(k) are the leading principal k x k submatrices of A and B, and parallel to . parallel to is the Frobenius norm. (C) 2011 Elsevier Inc. All rights reserved.

Sylow`s theorem for Moufang loops

For finite Moufang loops, we prove an analog of the first Sylow theorem giving a criterion for the existence of a p-Sylow subloop. We also find the maximal order of p-subloops in the Moufang loops that do not possess p-Sylow subloops. (c) 2009 Elsevier Inc. All rights reserved.

Lie properties of symmetric elements in group rings

Let * be an involution of a group G extended linearly to the group algebra KG. We prove that if G contains no 2-elements and K is a field of characteristic p, 0 2, then the *-symmetric elements of KG are Lie nilpotent (Lie n-Engel) if and only if KG is Lie nilpotent (Lie n-Engel). (C) 2008 Elsevier Inc. All rights reserved.

An application of lattice basis reduction to polynomial identities for algebraic structures

The authors` recent classification of trilinear operations includes, among other cases, a fourth family of operations with parameter q epsilon Q boolean OR {infinity}, and weakly commutative and weakly anticommutative operations. These operations satisfy polynomial identities in degree 3 and further identities in degree 5. For each operation, using the row canonical form of the expansion matrix E to find the identities in degree 5 gives extremely complicated results. We use lattice basis reduction to simplify these identities: we compute the Hermite normal form H of E(t), obtain a basis of the nullspace lattice from the last rows of a matrix U for which UE(t) = H, and then use the LLL algorithm to reduce the basis. (C) 2008 Elsevier Inc. All rights reserved.