Finding a fixed point to a nonexpansive operator, i.e., x = Tx, abstracts many problems in numerical linear algebra, optimization, and other areas of data sciences. To solve xed- point problems, we propose ARock, an algorithmic framework in which multiple agents (machines, processors, or cores) update x in an asynchronous parallel fashion. Asynchrony is crucial to parallel computing since it reduces synchronization wait, relaxes communication bottleneck, and thus speeds up computing significantly. At each step of ARock, an agent updates a randomly selected coordinate xi based on possibly out-of-date information on x. The agents share x through either global memory or communication. If writing xi is atomic, the agents can read and write x without memory locks. We prove that if the nonexpansive operator T has a fixed point, then with probability one, ARock generates a sequence that converges to a fixed point of T. Our conditions on T and step sizes are weaker than comparable work. Linear convergence is obtained under suitable assumptions. We propose special cases of ARock for linear systems, convex optimization, machine learning, as well as distributed and decentralized consensus problems. Numerical experiments of solving sparse logistic regression problems are presented.

Mirror symmetry conjecture identifies the complex geometry of a Calabi $ Yau manifold with the symplectic geometry of its mirror Calabi $ Yau man $ ifold. Using the SYZ mirror transform, we argue that (i) the mirror of an elliptic Calabi $ Yau manifold admits a twin Lagrangian fibration structure and (ii) the mirror of the Fourier $ Mukai transform for dual elliptic fibra $ tions is a symplectic Fourier $ Mukai transform for dual twin Lagrangian fibrations, which is essentially an identity transformation in this case.

No abstract uploaded!

We develop mathematical models describing the evolution of stochastic age-structured populations. After reviewing existing approaches, we formulate a complete kinetic framework for age-structured interacting populations undergoing birth, death and fission processes in spatially dependent environments. We define the full probability density for the population-size age chart and find results under specific conditions. Connections with more classical models are also explicitly derived. In particular, we show that factorial moments for non-interacting processes are described by a natural generalization of the McKendrick-von Foerster equation, which describes mean-field deterministic behavior. Our approach utilizes mixed-type, multidimensional probability distributions similar to those employed in the study of gas kinetics and with terms that satisfy BBGKY-like equation hierarchies.

We present an efficient null space free Jacobi–Davidson method to compute the positive eigenvalues of time harmonic Maxwell’s equations. We focus on a class of spatial discretizations that guarantee the existence of discrete vector potentials, such as Yee’s scheme and the edge elements. During the Jacobi–Davidson iteration, the correction process is applied to the vector potential instead. The correction equation is solved approximately as in the standard Jacobi–Davidson approach. The computational cost of the transformation from the vector potential to the corrector is negligible. As a consequence, the expanding subspace automatically stays out of the null space and no extra projection step is needed. Numerical evidence confirms that the proposed scheme indeed outperforms the standard and projection-based Jacobi–Davidson methods by a significant margin.