Related papers: On Petviashvili type methods for traveling wave co…
This paper studies a finite element discretization of the regularized Bingham equations that describe viscoplastic flow. An efficient nonlinear solver for the discrete model is then proposed and analyzed. The solver is based on Anderson…
We investigate a family of approximate multi-step proximal point methods, accelerated by implicit linear discretizations of gradient flow. The resulting methods are multi-step proximal point methods, with similar computational cost in each…
Anderson Acceleration (AA) is a popular acceleration technique to enhance the convergence of fixed-point iterations. The analysis of AA approaches typically focuses on the convergence behavior of a corresponding fixed-point residual, while…
In this paper we present the applications of methods from wavelet analysis to polynomial approximations for a number of accelerator physics problems. In the general case we have the solution as a multiresolution expansion in the base of…
We study waves in a chain of dispersively coupled phase oscillators. Two approaches -- a quasi-continuous approximation and an iterative numerical solution of the lattice equation -- allow us to characterize different types of traveling…
The proximal bundle method (PBM) is a fundamental and computationally effective algorithm for solving nonsmooth optimization problems. In this paper, we present the first variant of the PBM for smooth objectives, achieving an accelerated…
We investigate a model of solid propellant combustion involving surface pyrolysis coupled to finite activation energy gas phase combustion. Existence and uniqueness of a travelling wave solution are established by extending dynamical system…
We develop a theory of optimal transport for stationary random measures with a focus on stationary point processes and construct a family of distances on the set of stationary random measures. These induce a natural notion of interpolation…
Alternating direction multiplication is a powerful technique for solving convex optimisation problems. When challenging subproblems are encountered in the real world, it is useful to solve them by introducing neighbourhood terms. When the…
This paper is concerned with the existence of traveling wave solutions for diffusive two-species Lotka-Volterra systems with delay in both the reaction and diffusion terms without monotonicity. We extend the partial or cross monotone…
The discretization of convection-diffusion equations by implicit or semi-implicit methods leads to a sequence of linear systems usually solved by iterative linear solvers such as GMRES. Many techniques bearing the name of \emph{recycling…
We present a unified convergence analysis for first order convex optimization methods using the concept of strong Lyapunov conditions. Combining this with suitable time scaling factors, we are able to handle both convex and strong convex…
In this series of eight papers we present the applications of methods from wavelet analysis to polynomial approximations for a number of accelerator physics problems. In this part we consider orbital motion in transverse plane for a single…
I expand on the results of a recent work in which a novel weighting algorithm was shown to substantially increase the accuracy of an old, non-Bayesian computational approach for inferring the source direction of a gravitational wave from…
We consider estimation procedures which are recursive in the sense that each successive estimator is obtained from the previous one by a simple adjustment. We propose a wide class of recursive estimation procedures for the general…
This paper introduces a simple variant of the power method. It is shown analytically and numerically to accelerate convergence to the dominant eigenvalue/eigenvector pair; and, it is particularly effective for problems featuring a small…
In several recent works \cite{Causley2013a}, \cite{Causley2013}, we developed a new second order, A-stable approach to wave propagation problems based on the method of lines transpose (MOL$^T$) formulation combined with alternating…
A lift-and-permute scheme of alternating direction method of multipliers (ADMM) is proposed for linearly constrained convex programming. It contains not only the newly developed balanced augmented Lagrangian method and its dual-primal…
Many algorithms have been developed for enumerating various combinatorial objects in time exponentially less than the number of objects. Two common classes of algorithms are dynamic programming and the transfer matrix method. This paper…
This paper presents a family of new methods for locating/fitting hyperplanes with respect to a given set of points. We introduce a general framework for a family of aggregation criteria of different distance-based errors. The most popular…