Jeremy L. Marzuola

Jianfeng Lu, Jeremy L. Marzuola

We study the Strang splitting scheme for quasilinear Schrödinger equations. We establish the convergence of the scheme for solutions with small initial data. We analyze the linear instability of the numerical scheme, which explains the numerical blow-up of large data solutions and connects to analytical breakdown of regularity of solutions to quasilinear Schrödinger equations. Numerical tests are performed for a modified version of the superfluid thin film equation.

Jeremy L. Marzuola, Gideon Simpson

In this work, we study the spectral properties of matrix Hamiltonians generated by linearizing the nonlinear Schrödinger equation about soliton solutions. By a numerically assisted proof, we show that there are no embedded eigenvalues for the three dimensional cubic equation. Though we focus on a proof of the 3d cubic problem, this work presents a new algorithm for verifying certain spectral properties needed to study soliton stability. Source code for verification of our comptuations, and for further experimentation, are available at http://www.math.toronto.edu/simpson/files/spec_prop_code.tgz.

Zachary M. Boyd, Nicolas Fraiman, Jeremy L. Marzuola et al.

The shortest-path, commute time, and diffusion distances on undirected graphs have been widely employed in applications such as dimensionality reduction, link prediction, and trip planning. Increasingly, there is interest in using asymmetric structure of data derived from Markov chains and directed graphs, but few metrics are specifically adapted to this task. We introduce a metric on the state space of any ergodic, finite-state, time-homogeneous Markov chain and, in particular, on any Markov chain derived from a directed graph. Our construction is based on hitting probabilities, with nearness in the metric space related to the transfer of random walkers from one node to another at stationarity. Notably, our metric is insensitive to shortest and average walk distances, thus giving new information compared to existing metrics. We use possible degeneracies in the metric to develop an interesting structural theory of directed graphs and explore a related quotienting procedure. Our metric can be computed in $O(n^3)$ time, where $n$ is the number of states, and in examples we scale up to $n=10,000$ nodes and $\approx 38M$ edges on a desktop computer. In several examples, we explore the nature of the metric, compare it to alternative methods, and demonstrate its utility for weak recovery of community structure in dense graphs, visualization, structure recovering, dynamics exploration, and multiscale cluster detection.

Ludwig Gauckler, Jianfeng Lu, Jeremy L. Marzuola et al.

Trigonometric time integrators are introduced as a class of explicit numerical methods for quasilinear wave equations. Second-order convergence for the semi-discretization in time with these integrators is shown for a sufficiently regular exact solution. The time integrators are also combined with a Fourier spectral method into a fully discrete scheme, for which error bounds are provided without requiring any CFL-type coupling of the discretization parameters. The proofs of the error bounds are based on energy techniques and on the semiclassical Gårding inequality.