Deformation Driven Homogenization of Fracturing Solids

The paper discusses numerical formulations of the homogenization for solids with discrete crack development. We focus on multi–phase microstructures of heterogeneous materials, where fracture occurs in the form of debonding mechanisms as well as matrix cracking. The definition of overall properties critically depends on the developing discontinuities. To this end, we extend continuous formulations [1] to microstructures with discontinuities [2]. The basic underlying structure is a canonical variational formulation in the fully nonlinear range based on incremental energy minimization. We develop algorithms for numerical homogenization of fracturing solids in a deformation–driven context with non–trivial formulations of boundary conditions for (i) linear deformation and (ii) uniform tractions. The overall response of composite materials with fracturing microstructures are investigated. As a key result, we show the significance of the proposed non–trivial formulation of a traction–type boundary condition in the deformation–driven context. (© 2005 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Variational Homogenization of Micro-Electro-Elasticity

Understanding of micromechanical mechanisms in functional materials with electro-mechanical coupling is a highly demanding area of simulation technology and increasing interest has been shown in the last decades. Smart materials are characterized by microstructural properties, which can be changed by external stress and electric field stimuli, and hence find use as the active components in sensors and actuators. In this context, a key challenge is to combine models for microscopic electric domain evolution with variational principles of homogenization. We outline a variational-based micro-electro-elastic model for the micro-structural evolution of electric domains in ferroelectric ceramics. The micro-to-macro transition is performed on the basis of variational principles, extending purely mechanical formulations to coupled electro-mechanics. We focus on an electro-mechanical Boltzmann continuum on the macro-scale with mechanical displacement and electric potential as primary variables. The material model on the micro-scale is described by a gradient-extended continuum formulation taking into account the polarization vector field and its gradient, see Landis [1] and Schrade et al. [2] for conceptually similar approaches. A crucial aspect of the proposed homogenization analysis is the derivation of appropriate boundary conditions on the surface of the representative volume element. In this work we derive stiff Dirichlet-type, soft Neumann-type, and periodic boundary constraints starting from a generalized Hill-Mandel macrohomogeneity condition. Furthermore, we propose techniques to incorporate these boundary conditions in the variational principles of homogenization by means of Lagrange multiplier methods. (© 2012 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity

Recently, several authors [8, 10] have argued for the use of extended formulations to tighten production planning models. In this work we present two linear-programming extended formulations of the constant-capacity lot-sizing problem with backlogging. The first one applies to the problem with a general cost function and has O(n³) variables and constraints. This improves on the more straightforward O(n⁴) Florian and Klein [2] type formulation. The second one applies when the costs satisfy the Wagner-Whitin property but it has O(n²) variables and O(n³) constraints. As a by-product, we positively answer an open question of Miller and Wolsey [4] about the tightness of an extended formulation for the continuous mixing set. This text presents research results of the Belgian Program on Interuniversity Poles of Attraction initiated by the Belgian State, Prime Minister's Office, Science Policy Programming. The research was carried out with financial support of the Growth Project G1RD-1999-00034 (LISCOS) of the European Community. The scientific responsibility is assumed by the author.     

Hamiltonian reduction of free particle motion on the group SL(2, ℝ)

We analyze the structure of the reduced phase space that arises in the Hamiltonian reduction of the phase space of free particle motion over the groupSL(2, ℝ). The reduction considered is based on introducing constraints that are analogous to those used in the reduction of the Wess-Zumino-Novikov-Witten model to Toda systems. It is shown that the reduced phase space is diffeomorphic either to a union of two two-dimensional planes or to a cylinder S¹×ℝ. We construct canonical coordinates for both cases and show that in the first case, the reduced phase space is symplectomorphic to the union of two cotangent bundles T*(ℝ) endowed with a canonical symplectic structure, while in the second case, it is symplectomorphic to the cotangent bundle T* (S¹), which is also endowed with a canonical symplectic structure. Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 110, No. 1, pp. 149–161, January, 1997.     

Long time approximations for solutions of wave equations associated with the Steklov spectral homogenization problems

The interest in the use of quasimodes, or almost frequencies and almost eigenfunctions, to describe asymptotics for low‐frequency and high‐frequency vibrations in certain singularly perturbed spectral problems, which depend on a small parameter ε, has been recently highlighted in many papers. In this paper we deal with the low frequencies for a Steklov‐type eigenvalue homogenization problem: we consider harmonic functions in a bounded domain of ?², and strongly alternating boundary conditions of the Dirichlet and Steklov type on a part of the boundary. The spectral parameter appears in the boundary condition on small segments T^ε of size O(ε) periodically distributed along the boundary; ε also measures the periodicity of the structure. We consider associated second‐order evolution problems on spaces of traces that depend on ε, and we provide estimates for the time t in which standing waves, constructed from quasimodes, approach their solutions u^ε(t) as ε→0. Copyright © 2009 John Wiley & Sons, Ltd.     

Lagrange Multipliers and mixed formulations for some inequality constrained variational inequalities and some nonsmooth unilateral problems

Abstract

This paper addresses a class of inequality constrained variational inequalities and nonsmooth unilateral variational problems. We present mixed formulations arising from Lagrange multipliers. First we treat in a reflexive Banach space setting the canonical case of a variational inequality that has as essential ingredients a bilinear form and a non-differentiable sublinear, hence convex functional and linear inequality constraints defined by a convex cone. We extend the famous Brezzi splitting theorem that originally covers saddle point problems with equality constraints, only, to these nonsmooth problems and obtain independent Lagrange multipliers in the subdifferential of the convex functional and in the ordering cone of the inequality constraints. For illustration of the theory we provide and investigate an example of a scalar nonsmooth boundary value problem that models frictional unilateral contact problems in linear elastostatics. Finally we discuss how this approach to mixed formulations can be further extended to variational problems with nonlinear operators and equilibrium problems, and moreover, to hemivariational inequalities.     

Determination of a control function in three‐dimensional parabolic equations by Legendre pseudospectral method

A Legendre pseudospectral method is proposed for solving approximately an inverse problem of determining an unknown control parameter p(t) which is the coefficient of the solution u(x, y, z, t) in a diffusion equation in a three‐dimensional region. The diffusion equation is to be solved subject to suitably prescribed initial‐boundary conditions. The presence of the unknown coefficient p(t) requires an extra condition. This extra condition considered as the integral overspecification over the spacial domain. For discretizing the problem, after homogenization of the boundary conditions, we apply the Legendre pseudospectral method in a matrix based manner. As a results a system of nonlinear differential algebraic equations is generated. Then by using suitable transformation, the problem will be converted to a homogeneous time varying system of linear ordinary differential equations. Also a pseudospectral method for efficient solving of the resulted system of ordinary differential equations is proposed. The solution of this system gives the approximation to values of u and p. The matrix based structure of the present method makes it easy to implement. Numerical experiments are presented to demonstrate the accuracy and the efficiency of the proposed computational procedure. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 28: 74‐93, 2012     

Homogenization of integrals with pointwise gradient constraints via the periodic unfolding method

Abstract The pointwise gradient constrained homogenization process, for Neumann and Dirichlet type problems, is analyzed by means of the periodic unfolding method recently introduced in [21]. Classically, the proof of the homogenization formula in presence of pointwise gradient constraints relies on elaborated measure theoretic arguments. The one proposed here is elementary: it is based on weak convergence arguments in L^p spaces, coupled with suitable regularization techniques. Keywords: Homogenization, Gradient constrained problems, Periodic unfolding method Mathematics Subject Classification (2000): 49J45, 35B27, 74Q05     

Discontinuous Galerkin methods for periodic boundary value problems

This article considers the extension of well‐known discontinuous Galerkin (DG) finite element formulations to elliptic problems with periodic boundary conditions. Such problems routinely appear in a number of applications, particularly in homogenization of composite materials. We propose an approach in which the periodicity constraint is incorporated weakly in the variational formulation of the problem. Both H¹ and L² error estimates are presented. A numerical example confirming theoretical estimates is shown. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2007     

A new look at the moduli space of stable hyperelliptic curves

We carry out the log minimal model program for the moduli space ${\bar H_g}We carry out the log minimal model program for the moduli space [`(H)]<sub>g</sub>{\bar H_g} of stable hyperelliptic curves and show that certain log canonical models of [`(H)]_g{\bar H_g} are isomorphic to the proper transform of [`(H)]<sub>g</sub>{\bar H_g} in the corresponding log canonical models of [`(M)]_g{\bar M_g}. For g = 3, we retrieve the compact moduli space [`(B)]<sub>8</sub>{\bar B_{8}} of binary forms as a log canonical model, and obtain a decomposition of the natural map [`(H)]₃ ? [`(B)]<sub>8</sub>{\bar H_3 \to \bar B_{8}} into successive divisorial contractions of the boundary divisors. As a byproduct, we also obtain an isomorphism of [`(B)]₈{\bar B_8} with the GIT quotient of the Chow variety of bicanonically embedded hyperelliptic curves of genus three.     

Modified quasilinearization algorithm for optimal control problems with nondifferential constraints and general boundary conditions

This paper considers the numerical solution of the problem of minimizing a functionalI, subject to differential constraints, nondifferential constraints, and general boundary conditions. It consists of finding the statex(t), the controlu(t), and the parameter so that the functionalI is minimized while the constraints are satisfied to a predetermined accuracy.The modified quasilinearization algorithm (MQA) is extended, so that it can be applied to the solution of optimal control problems with general boundary conditions, where the state is not explicitly given at the initial point.The algorithm presented here preserves the MQA descent property on the cumulative error. This error consists of the error in the optimality conditions and the error in the constraints.Three numerical examples are presented in order to illustrate the performance of the algorithm. The numerical results are discussed to show the feasibility as well as the convergence characteristics of the algorithm.This work was supported by the Electrical Research Institute of Mexico and by CONACYT, Consejo Nacional de Ciencia y Tecnologia, Mexico City, Mexico.     

Homogenization of monotone operators in divergence form with <Emphasis Type="Italic">x</Emphasis>-dependent multivalued graphs

In a previous paper [4], we proved the existence of solutions to −div a(x, grad u) = f , together with appropriate boundary conditions, whenever a(x, e) belongs, for every fixed x, to a certain class of maximal monotone graphs in e. Here, we derive the corresponding homogenization result, letting a(x, e) depend upon a parameter ε, and imposing adequate ε-uniform boundedness and coercivity properties. The resulting homogenized graphs belong to the same class of maximal monotone graphs. Our results do not assume any kind of periodicity.      

Cross approximation in tensor electron density computations

We propose new tensor approximation algorithms for certain discrete functions related with Hartree–Fock/Kohn–Sham equations. Given a canonical tensor representation for the electron density function (for example, produced by quantum chemistry packages such as MOLPRO), we obtain its Tucker approximation with much fewer parameters than the input data and the Tucker approximation for the cubic root of this function, which is part of the Kohn–Sham exchange operator. The key idea is in the fast and accurate prefiltering of possibly large‐scale factors of the canonical tensor input. The new algorithms are based on the incomplete cross approximation method applied to matrices and tensors of order 3 and outperform other tools for the same purpose. First, we show that the cross approximation method is robust and much faster than the singular value decomposition‐based approach. As a consequence, it becomes possible to increase the resolution of grid and the complexity of molecules that can be handled by the Hartree–Fock chemical models. Second, we propose a new fast approximation method for f^1/3(x, y, z), based on the factor prefiltering method for f(x, y, z) and certain mimic approximation hypothesis. Third, we conclude that the Tucker format has advantages in the storage and computation time compared with the ubiquitous canonical format. Copyright © 2009 John Wiley & Sons, Ltd.     

The Stability in W s,p (Γ) Spaces of L 2-Projections on Some Convex Sets

ABSTRACT

For a polygonal open bounded subset of ?², of boundary Γ, we study stability estimates for the projection operator from L ¹(Γ) on a convex set K _h of continuous piecewise affine functions satisfying bound constraints. We establish stability estimates in L ^p (Γ) and in W ^s,p (Γ) for 1 ≤ p ≤ ∞ and 0 < s ≤ 1. This kind of result plays a crucial role in error estimates for the numerical approximation of optimal control problems of partial differential equations with bilateral control constraints.     

Kronecker product approximations for image restoration with anti‐reflective boundary conditions

The anti‐reflective boundary condition for image restoration was recently introduced as a mathematically desirable alternative to other boundary conditions presently represented in the literature. It has been shown that, given a centrally symmetric point spread function (PSF), this boundary condition gives rise to a structured blurring matrix, a submatrix of which can be diagonalized by the discrete sine transform (DST), leading to an O(n² log n) solution algorithm for an image of size n × n. In this paper, we obtain a Kronecker product approximation of the general structured blurring matrix that arises under this boundary condition, regardless of symmetry properties of the PSF. We then demonstrate the usefulness and efficiency of our approximation in an SVD‐based restoration algorithm, the computational cost of which would otherwise be prohibitive. Copyright © 2005 John Wiley & Sons, Ltd.     

Extended formulations in mixed integer conic quadratic programming

In this paper we consider the use of extended formulations in LP-based algorithms for mixed integer conic quadratic programming (MICQP). Extended formulations have been used by Vielma et al. (INFORMS J Comput 20: 438–450, 2008) and Hijazi et al. (Comput Optim Appl 52: 537–558, 2012) to construct algorithms for MICQP that can provide a significant computational advantage. The first approach is based on an extended or lifted polyhedral relaxation of the Lorentz cone by Ben-Tal and Nemirovski (Math Oper Res 26(2): 193–205 2001) that is extremely economical, but whose approximation quality cannot be iteratively improved. The second is based on a lifted polyhedral relaxation of the euclidean ball that can be constructed using techniques introduced by Tawarmalani and Sahinidis (Math Programm 103(2): 225–249, 2005). This relaxation is less economical, but its approximation quality can be iteratively improved. Unfortunately, while the approach of Vielma, Ahmed and Nemhauser is applicable for general MICQP problems, the approach of Hijazi, Bonami and Ouorou can only be used for MICQP problems with convex quadratic constraints. In this paper we show how a homogenization procedure can be combined with the technique by Tawarmalani and Sahinidis to adapt the extended formulation used by Hijazi, Bonami and Ouorou to a class of conic mixed integer programming problems that include general MICQP problems. We then compare the effectiveness of this new extended formulation against traditional and extended formulation-based algorithms for MICQP. We find that this new formulation can be used to improve various LP-based algorithms. In particular, the formulation provides an easy-to-implement procedure that, in our benchmarks, significantly improved the performance of commercial MICQP solvers.     

Segmented Lanczos-Chebyshev reduction method for convection dominated flows

It has been noted repeatedly in computational fluid mechanics literature that upwind-facing “essential” boundary condition poses difficulty for the Galerkin finite element method (and central difference method). Essentially three main remedies have been proposed to correct the spurious “wiggles” which may appear under these circumstances: mesh refinement, alternative numerical formulations, and special boundary layer treatment [1].Here, we seek an alternative formulation which has the same effect as special boundary layer functions based on piecewise polynomial solution via the segmented Lanczos-Chebyshev reduction method.     

Fast tensor method for summation of long‐range potentials on 3D lattices with defects

In this paper, we present a method for fast summation of long‐range potentials on 3D lattices with multiple defects and having non‐rectangular geometries, based on rank‐structured tensor representations. This is a significant generalization of our recent technique for the grid‐based summation of electrostatic potentials on the rectangular L × L × L lattices by using the canonical tensor decompositions and yielding the O(L) computational complexity instead of O(L³) by traditional approaches. The resulting lattice sum is calculated as a Tucker or canonical representation whose directional vectors are assembled by the 1D summation of the generating vectors for the shifted reference tensor, once precomputed on large N × N × N representation grid in a 3D bounding box. The tensor numerical treatment of defects is performed in an algebraic way by simple summation of tensors in the canonical or Tucker formats. To diminish the considerable increase in the tensor rank of the resulting potential sum, the ?‐rank reduction procedure is applied based on the generalized reduced higher‐order SVD scheme. For the reduced higher‐order SVD approximation to a sum of canonical/Tucker tensors, we prove the stable error bounds in the relative norm in terms of discarded singular values of the side matrices. The required storage scales linearly in the 1D grid‐size, O(N), while the numerical cost is estimated by O(NL). The approach applies to a general class of kernel functions including those for the Newton, Slater, Yukawa, Lennard‐Jones, and dipole‐dipole interactions. Numerical tests confirm the efficiency of the presented tensor summation method; we demonstrate that a sum of millions of Newton kernels on a 3D lattice with defects/impurities can be computed in seconds in Matlab implementation. The tensor approach is advantageous in further functional calculus with the lattice potential sums represented on a 3D grid, like integration or differentiation, using tensor arithmetics of 1D complexity. Copyright © 2015 John Wiley & Sons, Ltd.     

On Generalized Friedrichs and Krein‐von Neumann Extensions and Canonical Systems

Let S be a densely defined and closed symmetric relation in a Hilbert space ℋ︁ with defect numbers (1,1), and let A be some of its canonical selfadjoint extensions. According to Krein's formula, to S and A corresponds a so‐called Q‐function from the Nevanlinna class N . In this note we show to which subclasses N _γ of N the Q‐functions corresponding to S and its canonical selfadjoint extensions belong and specify the Q‐functions of the generalized Friedrichs and Krein‐von Neumann extensions. A result of L. de Branges implies that to each function Q ∈ N there corresponds a unique Hamiltonian H such that Q is the Titchmarsh‐Weyl coefficient of the two‐dimensional canonical system J_y′ = —zHy on [0, ∞) where Weyl's limit point case prevails at ∞. Then the boundary condition y(0) = 0 corresponds to a symmetric relation T_min with defect numbers (1,1) in the Hilbert space L²_H, and Q is equal to the Q‐function with respect to the extension corresponding to the boundary condition y₁(0) = 0. If H satisfies some growth conditions at 0 or ∞, wepresent results on the corresponding Q‐functions and show under which conditions the generalized Friedrichs or Krein‐von Neumann extension exists.     

Indecomposable Representations of the Superalgebra B(1,2)

Finite-dimensional indecomposable superbimodules over the superalgebra B(1,2) are treated. We propound a method for constructing indecomposable alternative superbimodules over B(1,2) containing a given socle (such can be presented by any irreducible module over B(1,2)). The method is based on adding on the Jordan basis. Also, for the characteristic 3 case, we give examples of Jordan indecomposable superbimodules which are not alternative.