On the Existence of Linearly Oscillating Galaxies

We consider two classes of steady states of the three-dimensional, gravitational Vlasov-Poisson system: the spherically symmetric Antonov-stable steady states (including the polytropes and the King model) and their plane symmetric analogues. We completely describe the essential spectrum of the self-adjoint operator governing the linearized dynamics in the neighborhood of these steady states. We also show that for the steady states under consideration, there exists a gap in the spectrum. We then use a version of the Birman-Schwinger principle first used by Mathur to derive a general criterion for the existence of an eigenvalue inside the first gap of the essential spectrum, which corresponds to linear oscillations about the steady state. It follows in particular that no linear Landau damping can occur in the neighborhood of steady states satisfying our criterion. Verification of this criterion requires a good understanding of the so-called period function associated with each steady state. In the plane symmetric case we verify the criterion rigorously, while in the spherically symmetric case we do so under a natural monotonicity assumption for the associated period function. Our results explain the pulsating behavior triggered by perturbing such steady states, which has been observed numerically.

Traveling Waves Solutions for Delayed Temporally Discrete Non-Local Reaction-Diffusion Equation

This paper deals with the existence of traveling wave solutions to a delayed temporally discrete non-local reaction diffusion equation model, which has been derived recently for a single species with age structure. When the birth function satisfies monotonic condition, we obtained the traveling wavefront by using upper and lower solution methods together with monotonic iteration techniques. Otherwise, without the monotonicity assumption for birth function, we constructed two auxiliary equations. By means of the traveling wavefronts of the auxiliary equations, using the Schauder’ fixed point theorem, we proved the existence of a traveling wave solution to the equation under consideration with speed c>c*, where c*>0 is some constant. We found that the delayed temporally discrete non-local reaction diffusion equation possesses the dynamical consistency with its time continuous counterpart at least in the sense of the existence of traveling wave solutions.

A Generalized Ky Fan Minimax Inequality on Finite-Dimensional Spaces

An existence result for a generalized inequality over a possible unbounded domain in a finite-dimensional space is established. The proof technique allows to avoid any monotonicity assumption. We adapt a weak coercivity condition introduced in Castellani and Giuli (J Glob Optim 75:163–176, 2019) for a generalized game which extends an older one proposed by Konnov and Dyabilkin (J Glob Optim 49:575–577, 2011) for equilibrium problems. Our main result encompasses and generalizes several existence results for equilibrium, quasiequilibrium and fixed-point problems.

Reaction-diffusion systems with supercritical nonlinearities revisited

We give a comprehensive study of the analytic properties and long-time behavior of solutions of a reaction-diffusion system in a bounded domain in the case where the nonlinearity satisfies the standard monotonicity assumption. We pay the main attention to the supercritical case, where the nonlinearity is not subordinated to the linear part of the equation trying to put as small as possible amount of extra restrictions on this nonlinearity. The properties of such systems in the supercritical case may be very different in comparison with the standard case of subordinated nonlinearities. We examine the global existence and uniqueness of weak and strong solutions, various types of smoothing properties, asymptotic compactness and the existence of global and exponential attractors.

A Modified Scaled Spectral-Conjugate Gradient-Based Algorithm for Solving Monotone Operator Equations

This paper proposes a modified scaled spectral-conjugate-based algorithm for finding solutions to monotone operator equations. The algorithm is a modification of the work of Li and Zheng in the sense that the uniformly monotone assumption on the operator is relaxed to just monotone. Furthermore, unlike the work of Li and Zheng, the search directions of the proposed algorithm are shown to be descent and bounded independent of the monotonicity assumption. Moreover, the global convergence is established under some appropriate assumptions. Finally, numerical examples on some test problems are provided to show the efficiency of the proposed algorithm compared to that of Li and Zheng.

New Inertial Projection Methods for Solving Multivalued Variational Inequality Problems Beyond Monotonicity

In this paper, we present two new inertial projection-type methods for solving multivalued variational inequality problems in finite-dimensional spaces. We establish the convergence of the sequence generated by these methods when the multivalued mapping associated with the problem is only required to be locally bounded without any monotonicity assumption. Furthermore, the inertial techniques that we employ in this paper are quite different from the ones used in most papers. Moreover, based on the weaker assumptions on the inertial factor in our methods, we derive several special cases of our methods. Finally, we present some experimental results to illustrate the profits that we gain by introducing the inertial extrapolation steps.

Dataset Sensitive Autotuning of Multi-versioned Code Based on Monotonic Properties

Functional languages allow rewrite-rule systems that aggressively generate a multitude of semantically-equivalent but differently-optimized code versions. In the context of GPGPU execution, this paper addresses the important question of how to compose these code versions into a single program that (near-)optimally discriminates them across different datasets. Rather than aiming at a general autotuning framework reliant on stochastic search, we argue that in some cases, a more effective solution can be obtained by customizing the tuning strategy for the compiler transformation producing the code versions.We present a simple and highly-composable strategy which requires that the (dynamic) program property used to discriminate between code versions conforms with a certain monotonicity assumption. Assuming the monotonicity assumption holds, our strategy guarantees that if an optimal solution exists it will be found. If an optimal solution doesn’t exist, our strategy produces human tractable and deterministic results that provide insights into what went wrong and how it can be fixed.We apply our tuning strategy to the incremental-flattening transformation supported by the publicly-available Futhark compiler and compare with a previous black-box tuning solution that uses the popular OpenTuner library. We demonstrate the feasibility of our solution on a set of standard datasets of real-world applications and public benchmark suites, such as Rodinia and FinPar. We show that our approach shortens the tuning time by a factor of $$6\times $$ 6 × on average, and more importantly, in five out of eleven cases, it produces programs that are (as high as $$10\times $$ 10 × ) faster than the ones produced by the OpenTuner-based technique.

Local well-posedness of solutions to the boundary layer equations for compressible two-fluid flow

<p style='text-indent:20px;'>In this paper, we consider the two-dimensional (2D) two-fluid boundary layer system, which is a hyperbolic-degenerate parabolic-elliptic coupling system derived from the compressible isentropic two-fluid flow equations with nonslip boundary condition for the velocity. The local existence and uniqueness is established in weighted Sobolev spaces under the monotonicity assumption on tangential velocity along normal direction based on a nonlinear energy method by employing a nonlinear cancelation technic introduced in [R. Alexandre, Y.-G. Wang, C.-J. Xu and T. Yang, J. Amer. Math. Soc., 28 (2015), 745-784; N. Masmoudi and T.K. Wong, Comm. Pure Appl. Math., 68(2015), 1683-1741] and developed in [C.-J. Liu, F. Xie and T. Yang, Comm. Pure Appl. Math., 72(2019), 63-121].</p>

On the Monotonicity of a Nondifferentially Mismeasured Binary Confounder

Suppose that we are interested in the average causal effect of a binary treatment on an outcome when this relationship is confounded by a binary confounder. Suppose that the confounder is unobserved but a nondifferential proxy of it is observed. We show that, under certain monotonicity assumption that is empirically verifiable, adjusting for the proxy produces a measure of the effect that is between the unadjusted and the true measures.