An iterative adaptive finite element method for elliptic eigenvalue problems

We consider the task of resolving accurately the n$n$th eigenpair of a generalized eigenproblem rooted in some elliptic partial differential equation (PDE), using an adaptive finite element method (FEM). Conventional adaptive FEM algorithms call a generalized eigensolver after each mesh refinement step. This is not practical in our situation since the generalized eigensolver needs to calculate n$n$ eigenpairs after each mesh refinement step, it can switch the order of eigenpairs, and for repeated eigenvalues it can return an arbitrary linear combination of eigenfunctions from the corresponding eigenspace. In order to circumvent these problems, we propose a novel adaptive algorithm that only calls a generalized eigensolver once at the beginning of the computation, and then employs an iterative method to pursue a selected eigenvalue–eigenfunction pair on a sequence of locally refined meshes. Both Picard’s and Newton’s variants of the iterative method are presented. The underlying partial differential equation (PDE) is discretized with higher-order finite elements (hp$hp$-FEM) but the algorithm also works for standard low-order FEM. The method is described and accompanied with theoretical analysis and numerical examples. Instructions on how to reproduce the results are provided.     

Complete Caps in with Both N and q Odd

In this work, an inductive method to construct complete caps in affine spaces is provided. Using this tool, for odd and q odd, complete caps smaller than all already known ones are obtained.     

A Shifted-Barrier Primal-Dual Algorithm Model for Linearly Constrained Optimization Problems

In this paper we describe a Newton-type algorithm model for solving smooth constrained optimization problems with nonlinear objective function, general linear constraints and bounded variables. The algorithm model is based on the definition of a continuously differentiable exact merit function that follows an exact penalty approach for the box constraints and an exact augmented Lagrangian approach for the general linear constraints. Under very mild assumptions and without requiring the strict complementarity assumption, the algorithm model produces a sequence of pairs converging quadratically to a pair where satisfies the first order necessary conditions and is a KKT multipliers vector associated to the linear constraints. As regards the behaviour of the sequence x ^k alone, it is guaranteed that it converges at least superlinearly. At each iteration, the algorithm requires only the solution of a linear system that can be performed by means of conjugate gradient methods. Numerical experiments and comparison are reported.     

An enhanced beam-theory model of the mixed-mode bending (MMB) test—Part II: Applications and results

The paper presents an enhanced beam-theory (EBT) model of the mixed-mode bending (MMB) test, whereby the specimen is considered as an assemblage of two sublaminates partly connected by an elastic–brittle interface. Analytical expressions for the compliance, energy release rate, and mode mixity are deduced. A compliance calibration strategy enabling numerical or experimental evaluation of the interface elastic constants is also presented. Furthermore, analytical expressions for the crack length correction parameters—analogous to those given by the corrected beam-theory (CBT) model for unidirectional laminated specimens—are furnished for multidirectional laminated specimens, as well. Lastly, an example application to experimental data reduction is presented.     

A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method

We propose a cutting-plane approach (namely, Benders decomposition) for a class of capacitated multi-period facility location problems. The novelty of this approach lies on the use of a specialized interior-point method for solving the Benders subproblems. The primal block-angular structure of the resulting linear optimization problems is exploited by the interior-point method, allowing the (either exact or inexact) efficient solution of large instances. The consequences of different modeling conditions and problem specifications on the computational performance are also investigated both theoretically and empirically, providing a deeper understanding of the significant factors influencing the overall efficiency of the cutting-plane method. The methodology proposed allowed the solution of instances of up to 200 potential locations, one million customers and three periods, resulting in mixed integer linear optimization problems of up to 600 binary and 600 millions of continuous variables. Those problems were solved by the specialized approach in less than one hour and a half, outperforming other state-of-the-art methods, which exhausted the (144 GB of) available memory in the largest instances.     

Fractional powers of the noncommutative Fourier's law by the S‐spectrum approach

Let e_?, for ? = 1,2,3, be orthogonal unit vectors in and let be a bounded open set with smooth boundary ?Ω. Denoting by a point in Ω, the heat equation, for nonhomogeneous materials, is obtained replacing the Fourier law, given by the following: into the conservation of energy law, here a, b, are given functions. With the S‐spectrum approach to fractional diffusion processes we determine, in a suitable way, the fractional powers of T. Then, roughly speaking, we replace the fractional powers of T into the conservation of energy law to obtain the fractional evolution equation. This method is important for nonhomogeneous materials where the Fourier law is not simply the negative gradient. In this paper, we determine under which conditions on the coefficients a, b, the fractional powers of T exist in the sense of the S‐spectrum approach. More in general, this theory allows to compute the fractional powers of vector operators that arise in different fields of science and technology. This paper is devoted to researchers working in fractional diffusion and fractional evolution problems, partial differential equations, and noncommutative operator theory.     

On the integrability of Degasperis–Procesi equation: Control of the Sobolev norms and Birkhoff resonances

We consider the dispersive Degasperis–Procesi equation $u_t?u_{xxt}?\mathtt{c}{u}_{xxx}+4\mathtt{c}{u}_x?u{u}_{xxx}?3u_x{u}_{xx}+4u{u}_x=0$ with $\mathtt{c}\in \mathbb{R}?\{0\}$. In [15] the authors proved that this equation possesses infinitely many conserved quantities. We prove that there are infinitely many of such constants of motion which control the Sobolev norms and which are analytic in a neighborhood of the origin of the Sobolev space $H^s$ with $s\ge 2$, both on $\mathbb{R}$ and $\mathbb{T}$. By the analysis of these conserved quantities we deduce a result of global well-posedness for solutions with small initial data and we show that, on the circle, the formal Birkhoff normal form of the Degasperis–Procesi at any order is action-preserving.     

Widened derangements and generalized Laguerre polynomials

The Ramanujan Journal - Let $$D_h$$ , $$E_k$$ and $$F_{alpha }$$ be sets of size $$h,k,alpha $$ respectively, with $$k le h$$ . We define a strongly widened derangement to be a permutation of...