A Maximal Partial Spread of Size 45 in PG(3,7)

Anexample of a maximal partial spread of size 45 in PG(3,7)is given. This example shows that a conjecture of Bruen and Thasfrom 1976 is false. It also shows that an upper bound for thenumber of lines of a maximal partial spread, given by Blockhuisin 1994, cannot be improved in general.     

On the Majorant Method for the Cauchy--Kovalevskaya Problem

We present a theory which allows us to justify the existence theorems and derive majorant estimates for solutions of the Cauchy problem for a countable system of partial differential equations. Our results also allow to estimate the maximum existence interval for a solution.     

Mass distribution and skewness for passive scalar transport in pipes with polygonal and smooth cross sections

We extend our previous results characterizing the loading properties of a diffusing passive scalar advected by a laminar shear flow in ducts and channels to more general cross‐sectional shapes, including regular polygons and smoothed corner ducts originating from deformations of ellipses. For the case of the triangle and localized, cross‐wise uniform initial distributions, short‐time skewness is calculated exactly to be positive, while long‐time asymptotics shows it to be negative. Monte Carlo simulations confirm these predictions, and document the timescale for sign change. The equilateral triangle appears to be the only regular polygon with this property—all others possess positive skewness at all times. Alternatively, closed‐form flow solutions can be constructed for smooth deformations of ellipses, and illustrate how both nonzero short‐time skewness and the possibility of multiple sign switching in time is unrelated to domain corners. Exact conditions relating the median and the skewness to the mean are developed which guarantee when the sign for the skewness implies front (more mass to the right of the mean) or back (more mass to the left of the mean) “loading” properties of the evolving tracer distribution along the pipe. Short‐ and long‐time asymptotics confirm this condition, and Monte Carlo simulations verify this at all times. The simulations are also used to examine the role of corners and boundaries on the distribution for short‐time evolution of point source , as opposed to cross‐wise uniform, initial data.     

Local linear convergence analysis of Primal–Dual splitting methods

In this paper, we study the local linear convergence properties of a versatile class of Primal–Dual splitting methods for minimizing composite non-smooth convex optimization problems. Under the assumption that the non-smooth components of the problem are partly smooth relative to smooth manifolds, we present a unified local convergence analysis framework for these methods. More precisely, in our framework, we first show that (i) the sequences generated by Primal–Dual splitting methods identify a pair of primal and dual smooth manifolds in a finite number of iterations, and then (ii) enter a local linear convergence regime, which is characterized based on the structure of the underlying active smooth manifolds. We also show how our results for Primal–Dual splitting can be specialized to cover existing ones on Forward–Backward splitting and Douglas–Rachford splitting/ADMM (alternating direction methods of multipliers). Moreover, based on these obtained local convergence analysis result, several practical acceleration techniques are discussed. To exemplify the usefulness of the obtained result, we consider several concrete numerical experiments arising from fields including signal/image processing, inverse problems and machine learning. The demonstration not only verifies the local linear convergence behaviour of Primal–Dual splitting methods, but also the insights on how to accelerate them in practice.     

Conformable variational iteration method,conformable fractional reduced differential transform method and conformable homotopy analysis method for non-linear fractional partial differential equations

In this paper, we introduce conformable variational iteration method (C-VIM), conformable fractional reduced differential transform method (CFRDTM) and conformable homotopy analysis method (C-HAM). Between these methods, the C-VIM is introduced for the first time for fractional partial differential equations (FPDEs). These methods are new versions of well-known VIM, RDTM and HAM. In addition, above-mentioned techniques are based on new defined conformable fractional derivative to solve linear and non-linear conformable FPDEs. Firstly, we present some basic definitions and general algorithm for proposal methods to solve linear and non-linear FPDEs. Secondly, to understand better, the presented new methods are supported by some examples. Finally, the obtained results are illustrated by the aid of graphics and the tables. The applications show that these new techniques C-VIM, CFRDTM and C-HAM are extremely reliable and highly accurate and it provides a significant improvement in solving linear and non-linear FPDEs.     

Branch-and-bound for the Precedence Constrained Generalized Traveling Salesman Problem

The Precedence Constrained Generalized Traveling Salesman Problem (PCGTSP) combines the Generalized Traveling Salesman Problem (GTSP) and the Sequential Ordering Problem (SOP). We present a novel branching technique for the GTSP which enables the extension of a powerful pruning technique. This is combined with some modifications of known bounding methods for related problems. The algorithm manages to solve problem instances with 12–26 groups within a minute, and instances with around 50 groups which are denser with precedence constraints within 24 h.