Crowd dynamics through non-local conservation laws

We present a Lax-Friedrichs type scheme to compute the solutions of a class of non-local and non-linear systems of conservation laws in several space dimensions. The convergence of the approximate solutions is proved by providing suitable L¹, L^∞ and BV uniform bounds. To illustrate the performances of the scheme, we consider an application to crowd dynamics. Numerical integrations show the formation of lanes in groups moving in opposite directions. This is joint work with R.M. Colombo (INDAM Unit, University of Brescia).     

Some matrix functional equations

We investigate the pair of matrix functional equations G(x)F(y) = G(xy) and G(x)G(y) = F(y/x), featuring the two independent scalar variables x and y and the two N×N matrices F(z) andG(z) (with N an arbitrary positive integer and the elements of these two matrices functions of the scalar variable z). We focus on the simplest class of solutions, i.e., on matrices all of whose elements are analytic functions of the independent variable. While in the scalar (N = 1) case this pair of functional equations only possess altogether trivial constant solutions, in the matrix (N > 1) case there are nontrivial solutions. These solutions satisfy the additional pair of functional equations F(x)G(y) = G(y/x) andF(x)F(y) = F(xy), and an endless hierarchy of other functional equations featuring more than two independent variables.     

Numerical solution and structural analysis of two-dimensional integral-algebraic equations

The υ-smoothing property of a one-dimensional Volterra integral operator and some projectors (Liang and Brumer, SIAM J. Numer. Anal. 51, 2238–2259 (2013)) are extended for two-dimensional integral-algebraic equations (TIAEs). Using these concepts, we decompose the given general TIAEs into mixed systems of two-dimensional Volterra integral equations (TVIEs) consisting of second- and first-kind TVIEs. Numerical technique based on the Chebyshev polynomial collocation methods is presented for the solution of the mixed TVIE system. Global convergence results are established and the performance of the numerical scheme is illustrated by means of some test problems.     

Cartesian Closed Extensions of Subcategories of CONT

In this paper we give a uniform way of proving cartesian closedness for many new subcategories of continuous posets. We define C-P to be the category of continuous posets whose D–completions are isomorphic to objects from C, where C is a subcategory of the category CONT of domains. The main result is that if C is a cartesian closed full subcategory of ALG _⊥ or BC, then C-P is also a cartesian closed subcategory of the category CONTP of continuous posets and Scott continuous functions. In particular, we have the following cartesian closed categories : BC-P, LAT-P, aL-P, aBC-P, B-P, aLAT-P, ω -B-P, ω -aLAT-P, etc.     

The Homomorphism Lattice Induced by a Finite Algebra

Each finite algebra A induces a lattice L _A via the quasi-order → on the finite members of the variety generated by A, where B →C if there exists a homomorphism from B to C. In this paper, we introduce the question: ‘Which lattices arise as the homomorphism lattice L _A induced by a finite algebra A?’ Our main result is that each finite distributive lattice arises as L _Q , for some quasi-primal algebra Q. We also obtain representations of some other classes of lattices as homomorphism lattices, including all finite partition lattices, all finite subspace lattices and all lattices of the form L ⊕1, where L is an interval in the subgroup lattice of a finite group.     

Hereditary,Additive and Divisible Classes in Epireflective Subcategories of Top

Hereditary coreflective subcategories of an epireflective subcategory A of Top such that I ₂ ? A (here I ₂ is the two-point indiscrete space) were studied in [4]. It was shown that a coreflective subcategory B of A is hereditary (closed under the formation subspaces) if and only if it is closed under the formation of prime factors. The main problem studied in this paper is the question whether this claim remains true if we study the (more general) subcategories of A which are closed under topological sums and quotients in A instead of the coreflective subcategories of A. We show that this is true if A ? Haus or under some reasonable conditions on B. E.g., this holds if B contains either a prime space, or a space which is not locally connected, or a totally disconnected space or a non-discrete Hausdorff space. We touch also other questions related to such subclasses of A. We introduce a method extending the results from the case of non-bireflective subcategories (which was studied in [4]) to arbitrary epireflective subcategories of Top. We also prove some new facts about the lattice of coreflective subcategories of Top and ZD.     

The lattice of extensions of the minimal logic

In this article, we survey the results on the lattice of extensions of the minimal logic Lj, a paraconsistent analog of the intuitionistic logic Li. Unlike the well-studied classes of explosive logics, the class of extensions of the minimal logic has an interesting global structure. This class decomposes into the disjoint union of the class Int of intermediate logics, the class Neg of negative logics with a degenerate negation, and the class Par of properly paraconsistent extensions of the minimal logic. The classes Int and Neg are well studied, whereas the study of Par can be reduced to some extent to the classes Int and Neg.     

A hybrid viscosity iterative method with averaged mappings for split equilibrium problems and fixed point problems

In this paper, with the help of averaged mappings, we introduce and study a hybrid iterative method to approximate a common solution of a split equilibrium problem and a fixed point problem of a finite collection of nonexpansive mappings. We prove that the sequences generated by the iterative scheme strongly converges to a common solution of the above-said problems. We give some numerical examples to ensure that our iterative scheme is more efficient than the methods of Plubtieng and Punpaeng (J. Math Anal. Appl. 336(1), 455–469, 15), Liu (Nonlinear Anal. 71(10), 4852–4861, 10) and Wen and Chen (Fixed Point Theory Appl. 2012(1), 1–15, 18). The results presented in this paper are the extension and improvement of the recent results in the literature.     

A uniform Birkhoff theorem

Birkhoff’s HSP theorem characterizes the classes of models of algebraic theories as those being closed with respect to homomorphic images, subalgebras, and products. In particular, it implies that an algebra B satisfies all equations that hold in an algebra A of the same signature if and only if B is a homomorphic image of a subalgebra of a (possibly infinite) direct power of A. The former statement is equivalent to the existence of a natural map sending term functions of the algebra A to those of B—the natural clone homomorphism. The study of continuity properties of natural clone homomorphisms has been initiated recently by Bodirsky and Pinsker for locally oligomorphic algebras.Revisiting the argument of Bodirsky and Pinsker, we show that for any algebra B in the variety generated by an algebra A, the induced natural clone homomorphism is uniformly continuous if and only if every finitely generated subalgebra of B is a homomorphic image of a subalgebra of a finite power of A. Based on this observation, we study the question as to when Cauchy continuity of natural clone homomorphisms implies uniform continuity. We introduce the class of almost locally finite algebras, which encompasses all locally oligomorphic as well as all locally finite algebras, and show that, in case A is almost locally finite, then the considered natural homomorphism is uniformly continuous if (and only if) it is Cauchy-continuous. In particular, this provides a locally finite counterpart of the result by Bodirsky and Pinsker. Along the way, we also discuss some peculiarities of oligomorphic permutation groups on uncountable sets.     

Local nonglobal minima for solving large-scale extended trust-region subproblems

We study large-scale extended trust-region subproblems (eTRS) i.e., the minimization of a general quadratic function subject to a norm constraint, known as the trust-region subproblem (TRS) but with an additional linear inequality constraint. It is well known that strong duality holds for the TRS  and that there are efficient algorithms for solving large-scale TRS  problems. It is also known that there can exist at most one local non-global minimizer (LNGM) for TRS. We combine this with known characterizations for strong duality for eTRS  and, in particular, connect this with the so-called hard case for TRS. We begin with a recent characterization of the minimum for the TRS  via a generalized eigenvalue problem and extend this result to the LNGM. We then use this to derive an efficient algorithm that finds the global minimum for eTRS  by solving at most three generalized eigenvalue problems.     

Speeding up Huff form of elliptic curves

This paper presents faster inversion-free point addition formulas for the curve \(y (1+ax^2) = cx (1+dy^2)\). The proposed formulas improve the point doubling operation count record (I, M, S, D, a are arithmetic operations over a field. I: inversion, M: multiplication, S: squaring, D: multiplication by a curve constant, a: addition/subtraction) from \(6\mathbf{{M}}+ 5\mathbf{{S}}\) to \(8\mathbf{{M}}\) and mixed addition operation count record from \(10\mathbf{{M}}\) to \(8\mathbf{{M}}\). Both sets of formulas are shown to be 4-way parallel, leading to an effective cost of \(2\mathbf{{M}}\) per either of the group operations.     

An unconditionally stable linearized difference scheme for the fractional Ginzburg-Landau equation

In this paper, we propose a linearized implicit finite difference scheme for solving the fractional Ginzburg-Landau equation. The scheme, which involves three time levels, is unconditionally stable and second-order accurate in both time and space variables. Moreover, the unique solvability, the unconditional stability, and the convergence of the method in the \(L^{\infty }\)-norm are proved by the energy method and mathematical induction. Compared with the implicit midpoint difference scheme (Wang and Huang J. Comput. Phys. 312, 31–49, 2016), current linearized method generally reduces the computational cost. Finally, numerical results are presented to confirm the theoretical results.     

Quasivarieties of Graphs and Independent Axiomatizability

In the present article, we continue to study the complexity of the lattice of quasivarieties of graphs. For every quasivariety K of graphs that contains a non-bipartite graph, we find a subquasivariety K′ ? K such that there exist 2^ω subquasivarieties K″ ∈ L_q(K′) without covers (hence, without independent bases for their quasi-identities in K′).     

On Ramanujan sums over the Gaussian integers

This note deals with Ramanujan sums c _m (n) over the ring ?[i], in particular with asymptotics for sums of c _m (n) taken over both variables m, n.     

Splitting in 2-computably enumerable degrees with avoiding cones

In this paper we show that for any pair of properly 2-c. e. degrees 0 < d < a such that there are no c. e. degrees between d and a, the degree a is splittable in the class of 2-c. e. degrees avoiding the upper cone of d. We also study the possibility to characterize such an isolation in terms of splitting.     

Fully discrete second-order backward difference method for Kelvin-Voigt fluid flow model

In this article, based on a second-order backward difference method, a completely discrete scheme is discussed for a Kelvin-Voigt viscoelastic fluid flow model with nonzero forcing function, which is either independent of time or in L ^∞ (L ²). After deriving some a priori bounds for the solution of a semidiscrete Galerkin finite element scheme, a second-order backward difference method is applied for temporal discretization. Then, a priori estimates in Dirichlet norm are derived, which are valid uniformly in time using a combination of discrete Gronwall’s lemma and Stolz-Cesaro’s classical result on sequences. Moreover, an existence of a discrete global attractor for the discrete problem is established. Further, optimal a priori error estimates are obtained, whose bounds may depend exponentially in time. Under uniqueness condition, these estimates are shown to be uniform in time. Finally, several numerical experiments are conducted to confirm our theoretical findings.     

On the homotopy type of (<Emphasis Type="Italic">n</Emphasis>-1)-connected (3<Emphasis Type="Italic">n</Emphasis>+1)-dimensional free chain Lie algebra

Let R be a subring ring of Q. We reserve the symbol p for the least prime which is not a unit in R; if R ?Q, then p=∞. Denote by DGL _n ^np , n≥1, the category of (n-1)-connected np-dimensional differential graded free Lie algebras over R. In [1] D. Anick has shown that there is a reasonable concept of homotopy in the category DGL _n ^np . In this work we intend to answer the following two questions: Given an object (L(V), ?) in DGL _n ³ⁿ⁺² and denote by S(L(V), ?) the class of objects homotopy equivalent to (L(V), ?). How we can characterize a free dgl to belong to S(L(V), ?)? Fix an object (L(V), ?) in DGL _n ³ⁿ⁺² . How many homotopy equivalence classes of objects (L(W), δ) in DGL _n ³ⁿ⁺² such that H _* (W, d′)?H _* (V, d) are there? Note that DGL _n ³ⁿ⁺² is a subcategory of DGL _n ^np when p>3. Our tool to address this problem is the exact sequence of Whitehead associated with a free dgl.     

Searching for a Best Least Absolute Deviations Solution of an Overdetermined System of Linear Equations Motivated by Searching for a Best Least Absolute Deviations Hyperplane on the Basis of Given Data

We consider the problem of searching for a best LAD-solution of an overdetermined system of linear equations Xa=z, X∈?^m×n, m≥n, \(\mathbf{a}\in \mathbb{R}^{n}, \mathbf {z}\in\mathbb{R}^{m}\). This problem is equivalent to the problem of determining a best LAD-hyperplane x?a ^T x, x∈? ⁿ on the basis of given data \((\mathbf{x}_{i},z_{i}), \mathbf{x}_{i}= (x_{1}^{(i)},\ldots,x_{n}^{(i)})^{T}\in \mathbb{R}^{n}, z_{i}\in\mathbb{R}, i=1,\ldots,m\), whereby the minimizing functional is of the form

$F(\mathbf{a})=\|\mathbf{z}-\mathbf{Xa}\|_1=\sum_{i=1}^m|z_i-\mathbf {a}^T\mathbf{x}_i|.$

An iterative procedure is constructed as a sequence of weighted median problems, which gives the solution in finitely many steps. A criterion of optimality follows from the fact that the minimizing functional F is convex, and therefore the point a ^?∈? ⁿ is the point of a global minimum of the functional F if and only if 0∈?F(a ^?).

Motivation for the construction of the algorithm was found in a geometrically visible algorithm for determining a best LAD-plane (x,y)?αx+βy, passing through the origin of the coordinate system, on the basis of the data (x _i ,y _i ,z _i ),i=1,…,m.     

ADMM for the SDP relaxation of the QAP

Semidefinite programming, SDP, relaxations have proven to be extremely strong for many hard discrete optimization problems. This is in particular true for the quadratic assignment problem, QAP, arguably one of the hardest NP-hard discrete optimization problems. There are several difficulties that arise in efficiently solving the SDP relaxation, e.g., increased dimension; inefficiency of the current primal–dual interior point solvers in terms of both time and accuracy; and difficulty and high expense in adding cutting plane constraints. We propose using the alternating direction method of multipliers ADMM in combination with facial reduction, FR, to solve the SDP relaxation. This first order approach allows for: inexpensive iterations, a method of cheaply obtaining low rank solutions; and a trivial way of exploiting the FR for adding cutting plane inequalities. In fact, we solve the doubly nonnegative, DNN, relaxation that includes both the SDP and all the nonnegativity constraints. When compared to current approaches and current best available bounds we obtain robustness, efficiency and improved bounds.