SMScott MacLachlan

Scott MacLachlan

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Scott MacLachlan has a total of 155 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Space-Time Waveform Relaxation Multigrid for Navier–Stokes

    by James Jackaman, Scott MacLachlan

    Space-time finite-element discretizations are well-developed in many areas of science and engineering, but much work remains within the development of specialized solvers for the resulting linear and nonlinear systems. In this work, we consider the all-at-once solution of the discretized Navier–Stokes equations over a space-time domain using waveform relaxation multigrid methods. In particular, we show how to extend the efficient spatial multigrid relaxation methods from Rafiei and MacLachlan [preprint, arXiv:2502.01130] to a waveform relaxation method, and provide a proof-of-concept of the algorithmic efficiency of the resulting monolithic Newton–Krylov-multigrid solver. Numerical results demonstrate the scalability of the solver for varying discretization order and physical parameters. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SISC and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://github.com/JamesJackaman/RelaxNavierStokes/tree/main and in the supplementary materials ( RelaxNavierStokes-main.zip [37.1KB]). [Formula: see text]

  • Optimized Sparse Matrix Operations for Reverse Mode Automatic Differentiation

    by Nicolas Nytko, Ali Taghibakhshi, Tareq Uz Zaman, Scott MacLachlan, Luke N. Olson, Matthew West

    Sparse matrices are ubiquitous in computational science, enabling significant reductions in both compute time and memory overhead for problems with local connectivity. Simultaneously, recent work in automatic differentiation has lead to explosive growth in the adoption of accessible frameworks, such as PyTorch, TensorFlow, and JAX, which allow for the rapid development of optimization problems in computational settings. However, these existing tools lack support for sparse linear algebra, severely limiting their use in settings such as scientific machine-learning (SciML) and numerical PDEs, where the use of sparsity is often a necessity for achieving efficient algorithms. In this paper, we develop a set of performant kernels that allow for efficient automatic differentiation of expressions with sparse matrix values; fine-grained parallelism is exploited and performance is highlighted on massively-parallel graphics processing units (GPUs). We also present several applications that are enhanced by the use of these kernels, such as computing optimal transmission conditions for optimized Schwarz methods or finding sparse preconditioners for conjugate gradients. The use of backpropagation with these sparse operations results in massive speed gains when compared to their dense counterparts, with speedups ranging from [Formula: see text] to [Formula: see text] (or more), and enabling computation on larger problems than is possible using dense operations. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as recognition that the authors have followed reproducibility principles valued by SISC and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://github.com/nicknytko/numml/tree/main and in the supplementary materials ( numml-main.zip [85.0KB]). [Formula: see text]


  • Open Access

    Extending Irksome : Improvements in Automated Runge–Kutta Time Stepping for Finite Element Methods

    by Robert C. Kirby, Scott P. MacLachlan

    Irksome is a library based on the Unified Form Language (UFL) that enables automated generation of Runge–Kutta methods for time-stepping finite element spatial discretizations of Partial Differential Equations (PDEs). Allowing users to express semidiscrete forms of PDEs, it generates UFL representations for the stage-coupled variational problems to be solved at each timestep. The Firedrake package then generates efficient code for evaluating these variational problems and allows users a wide range of options to deploy efficient algebraic solvers in PETSc. In this article, we describe several recent advances in Irksome . These include alternate formulations of the Runge–Kutta time-stepping methods and optimized support for diagonally implicit (DIRK) methods. Additionally, we present new and improved tools for building preconditioners for the resulting linear and linearized systems, demonstrating that these can lead to efficient approaches for solving fully implicit Runge–Kutta discretizations. The new features are demonstrated through a sequence of computational examples demonstrating the high-level interface and obtained solver performance.


  • Monolithic Multigrid Preconditioners for High-Order Discretizations of Stokes Equations

    by Alexey Voronin, Graham Harper, Scott MacLachlan, Luke N. Olson, Raymond S. Tuminaro

    This work introduces and assesses the efficiency of a monolithic [Formula: see text]MG multigrid framework designed for high-order discretizations of stationary Stokes systems using Taylor–Hood and Scott–Vogelius elements. The proposed approach integrates coarsening in both approximation order ([Formula: see text]) and mesh resolution ([Formula: see text]) to address the computational and memory efficiency challenges that are often encountered in conventional high-order numerical simulations. Our numerical results reveal that [Formula: see text]MG offers significant improvements over traditional spatial-coarsening-only multigrid ([Formula: see text]MG) techniques for problems discretized with Taylor–Hood elements across a variety of problem sizes and discretization orders. In particular, the [Formula: see text]MG method exhibits superior performance in reducing setup and solve times, particularly when dealing with higher discretization orders and unstructured problem domains. For Scott–Vogelius discretizations, while monolithic [Formula: see text]MG delivers low iteration counts and competitive solve phase timings, it exhibits a discernibly slower setup phase when compared to a multilevel (nonmonolithic) full-block-factorization (FBF) preconditioner where [Formula: see text]MG is employed only for the velocity unknowns. This is primarily due to the setup costs of the larger mixed-field relaxation patches with monolithic [Formula: see text]MG versus the patch setup costs with a single unknown type for FBF. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SISC and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://github.com/Alexey-Voronin/HighOrderStokesMG and in the supplementary materials ( HighOrderStokesMG-main.zip [2.02MB]). [Formula: see text]


  • Achieving h‐ and p‐Robust Monolithic Multigrid Solvers for the Stokes Equations

    by Amin Rafiei, Scott MacLachlan

    The numerical analysis of higher order mixed finite‐element discretizations for saddle‐point problems, such as the Stokes equations, has been well‐studied in recent years. While the theory and practice of such discretizations is now well‐understood, the same cannot be said for efficient preconditioners for solving the resulting linear (or linearized) systems of equations. In this work, we propose and study variants of the well‐known Vanka relaxation scheme that lead to effective geometric multigrid preconditioners for both the conforming Taylor‐Hood discretizations and nonconforming ‐ discretizations of the Stokes equations. Numerical results demonstrate robust performance with respect to FGMRES iteration counts for increasing polynomial order for some of the considered discretizations and expose open questions about stopping tolerances for effectively preconditioned iterations at high polynomial order.


  • Monolithic Algebraic Multigrid Preconditioners for the Stokes Equations

    by Alexey Voronin, Scott MacLachlan, Luke N. Olson, Raymond S. Tuminaro

    We investigate a novel monolithic algebraic multigrid (AMG) preconditioner for the Taylor–Hood ([Formula: see text]) and Scott–Vogelius ([Formula: see text]) discretizations of the Stokes equations. The algorithm is based on the use of the lower-order [Formula: see text] operator within a defect-correction setting, in combination with AMG construction of interpolation operators for velocities and pressures. The preconditioning framework is primarily algebraic, though the [Formula: see text] operator must be provided. We investigate two relaxation strategies in this setting. Specifically, a novel block factorization approach is devised for Vanka patch systems, which significantly reduces storage requirements and computational overhead, and a Chebyshev adaptation of the LSC-DGS relaxation from [ 54 ] is developed to improve parallelism. The preconditioner demonstrates robust performance across a variety of two-dimensional and three-dimensional Stokes problems, often matching or exceeding the effectiveness of an inexact block triangular (or Uzawa) preconditioner, especially in challenging scenarios such as elongated-domain problems. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SISC and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://github.com/Alexey-Voronin/Monolithic_AMG_For_Stokes and in the supplementary materials ( Monolithic_AMG_For_Stokes-main.zip [1.85MB]). [Formula: see text]


  • Multigrid Reduction‐In‐Time Convergence for Advection Problems: A Fourier Analysis Perspective

    by H. De Sterck, S. Friedhoff, O. A. Krzysik, S. P. MacLachlan

    A long‐standing issue in the parallel‐in‐time community is the poor convergence of standard iterative parallel‐in‐time methods for hyperbolic partial differential equations (PDEs), and for advection‐dominated PDEs more broadly. Here, a local Fourier analysis (LFA) convergence theory is derived for the two‐level variant of the iterative parallel‐in‐time method of multigrid reduction‐in‐time (MGRIT). This closed‐form theory allows for new insights into the poor convergence of MGRIT for advection‐dominated PDEs when using the standard approach of rediscretizing the fine‐grid problem on the coarse grid. Specifically, we show that this poor convergence arises, at least in part, from inadequate coarse‐grid correction of certain smooth Fourier modes known as characteristic components, which was previously identified as causing poor convergence of classical spatial multigrid on steady‐state advection‐dominated PDEs. We apply this convergence theory to show that, for certain semi‐Lagrangian discretizations of advection problems, MGRIT convergence using rediscretized coarse‐grid operators cannot be robust with respect to CFL number or coarsening factor. A consequence of this analysis is that techniques developed for improving convergence in the spatial multigrid context can be re‐purposed in the MGRIT context to develop more robust parallel‐in‐time solvers. This strategy has been used in recent work to great effect; here, we provide further theoretical evidence supporting the effectiveness of this approach.


  • Multigrid Preconditioning for Regularized Least-Squares Problems

    by Matthias Bolten, Misha E. Kilmer, Scott MacLachlan

    In this paper, we are concerned with efficiently solving the sequences of regularized linear least-squares problems associated with employing Tikhonov-type regularization with regularization operators designed to enforce edge recovery. An optimal regularization parameter, which balances the fidelity to the data with the edge-enforcing constraint term, is typically not known a priori. This adds to the total number of regularized linear least-squares problems that must be solved before the final image can be recovered. Therefore, in this paper, we determine effective multigrid preconditioners for these sequences of systems. We focus our approach on the sequences that arise as a result of the edge-preserving method introduced in [S. Gazzola et al., Inverse Problems, 36 (2020), 124004], where we can exploit an interpretation of the regularization term as a diffusion operator; however, our methods are also applicable in other edge-preserving settings, such as iteratively reweighted least-squares problems. Particular attention is paid to the selection of components of the multigrid preconditioner in order to achieve robustness for different ranges of the regularization parameter value. In addition, we present a parameter trimming approach that, when used with the L-curve heuristic, reduces the total number of solves required. We demonstrate our preconditioning and parameter trimming routines on examples in computed tomography and image deblurring.


  • Generalizing Lloyd’s Algorithm for Graph Clustering

    by Tareq Zaman, Nicolas Nytko, Ali Taghibakhshi, Scott MacLachlan, Luke Olson, Matthew West

    Clustering is a commonplace problem in many areas of data science, with applications in biology and bioinformatics, understanding chemical structure, image segmentation, building recommen...