OKOliver A. Krzysik

Oliver A. Krzysik

*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


Oliver A. Krzysik has a total of 26 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Optimal Transfer Operators in Algebraic Two-Level Methods for Nonsymmetric and Indefinite Problems

    by Oliver A. Krzysik, Ben S. Southworth, Golo A. Wimmer, Ahsan Ali, James Brannick, Karsten Kahl

    Consider an algebraic two-level method applied to the [Formula: see text]-dimensional linear system [Formula: see text] using fine-space preconditioner (i.e., “relaxation” or “smoother”) [Formula: see text], with [Formula: see text], restriction and interpolation [Formula: see text] and [Formula: see text], and algebraic coarse-space operator [Formula: see text]. Then, what are the best possible transfer operators [Formula: see text] and [Formula: see text] of a given dimension [Formula: see text]? Brannick et al. [ 12 ] showed that when [Formula: see text] and [Formula: see text] are Hermitian positive definite (HPD), the optimal interpolation is such that its range contains the [Formula: see text] smallest generalized eigenvectors of the matrix pencil [Formula: see text]. Recently, in Ali et al. [ 5 ] we generalized this framework to the non-HPD setting, by considering both right (interpolation) and left (restriction) generalized eigenvectors of [Formula: see text] and defining corresponding nonsymmetric transfer operators [Formula: see text]. Tight convergence bounds for [Formula: see text] are derived in spectral radius, as well as a proof of pseudo-optimality. Note, [Formula: see text] are typically complex valued, which is not practical for real-valued problems. Here we build on [ 5 ], first characterizing all inner products in which the coarse-space correction defined by [Formula: see text] is orthogonal. We then develop tight two-level convergence bounds in these norms, and prove that the underlying transfer operators [Formula: see text] are genuinely optimal. As a special case, our theory both recovers and extends the HPD results from [ 12 ]. Finally, we show how to construct optimal, real-valued transfer operators in the case of that [Formula: see text] and [Formula: see text] are real valued, but are not HPD. Numerical examples arising from a discretized advection-reaction equation, wave-equation, and Stokes equations are used to verify and illustrate the theory.

  • Overlapping Schwarz Methods Are Not Anisotropy‐Robust Multigrid Smoothers

    by Oliver A. Krzysik, Ben S. Southworth, Bobby Philip

    We analyze overlapping multiplicative Schwarz methods as smoothers in the geometric multigrid solution of two‐dimensional anisotropic diffusion problems. For diffusion equations, it is well known that the smoothing properties of point‐wise smoothers, such as Gauss Seidel, rapidly deteriorate as the strength of anisotropy increases. On the other hand, global smoothers based on line smoothing are known to generally provide good smoothing for diffusion problems, independent of the anisotropy strength. A natural question is whether global methods are really necessary to achieve good smoothing in such problems, or whether it can be obtained with locally overlapping block smoothers using sufficiently large blocks and overlap. Through local Fourier analysis and careful numerical experimentation, we show that global methods are indeed necessary to achieve anisotropy‐robust smoothing. Specifically, for any fixed block size bounded sufficiently far away from the global domain size, we find that the smoothing properties of overlapping multiplicative Schwarz rapidly deteriorate with increasing anisotropy, irrespective of the amount of overlap between blocks. Moreover, our results indicate that anisotropy‐robust smoothing requires blocks of diameter for anisotropy ratio .


  • Parallel-in-Time Solution of Scalar Nonlinear Conservation Laws

    by O. A. Krzysik, H. De Sterck, R. D. Falgout, J. B. Schroder

    We consider the parallel-in-time solution of scalar nonlinear conservation laws in one spatial dimension. The equations are discretized in space with a conservative finite-volume method using weighted essentially nonoscillatory (WENO) reconstructions, and in time with high-order explicit Runge–Kutta methods. The solution of the global, discretized space-time problem is sought via a nonlinear iteration that uses a novel linearization strategy in cases of nondifferentiable equations. Under certain choices of discretization and algorithmic parameters, the nonlinear iteration coincides with Newton’s method, although, more generally, it is a preconditioned residual correction scheme. At each nonlinear iteration, the linearized problem takes the form of a certain discretization of a linear conservation law over the space-time domain in question. An approximate parallel-in-time solution of the linearized problem is computed with a single multigrid reduction-in-time (MGRIT) iteration; however, any other effective parallel-in-time method could be used in its place. The MGRIT iteration employs a novel coarse-grid operator that is a modified conservative semi-Lagrangian discretization and generalizes those we have developed previously for nonconservative scalar linear hyperbolic problems. Numerical tests are performed for the inviscid Burgers and Buckley–Leverett equations. For many test problems, the solver converges in just a handful of iterations with a convergence rate independent of mesh resolution, including problems with (interacting) shocks and rarefactions. 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/okrzysik/pit-nonlinear-hyperbolic-github and in the supplementary materials ( pit-nonlinear-hyperbolic-master.zip [35.6MB], M163026_SM_1.pdf [12.3MB]). [Formula: see text]


  • Parallel-in-Time Solution of Hyperbolic PDE Systems via Characteristic-Variable Block Preconditioning

    by O. A. Krzysik, H. De Sterck, R. D. Falgout, J. B. Schroder

    We consider the parallel-in-time solution of both linear and nonlinear hyperbolic partial differential equation (PDE) systems in one spatial dimension. In the nonlinear setting, the discretized equations are solved with a preconditioned residual iteration based on a global linearization. The linear(ized) equation systems are approximately solved parallel-in-time using a block preconditioner applied in the characteristic variables of the underlying linear(ized) hyperbolic PDE. This change of variables is motivated by the observation that intervariable coupling between characteristic variables is weak, at least locally where spatio-temporal variations in the eigenvectors of the associated flux Jacobian are sufficiently small, while that between the original variables is not. For an [Formula: see text]-dimensional system of PDEs, applying the preconditioner consists of solving a sequence of [Formula: see text] scalar linear(ized)-advection-like problems, each associated with a different characteristic wave-speed in the underlying linear(ized) PDE. We approximately solve these linear advection problems using multigrid reduction-in-time (MGRIT); however, any other suitable parallel-in-time method could be used. Numerical examples are shown for the (linear) acoustics equations in heterogeneous media and for the (nonlinear) shallow water equations and Euler equations of gas dynamics with shocks and rarefactions. For many test problems, the solver converges in just a handful of iterations and with mesh-independent convergence rates. 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/okrzysik/pit-nonlinear-hyperbolic and in the supplementary materials ( M167331_SM.pdf [1.52MB], pit-nonlinear-hyperbolic-master.zip [35.6MB]). [Formula: see text]


  • Asymptotic Convergence of Restarted Anderson Acceleration for Certain Normal Linear Systems

    by Oliver A. Krzysik, Hans De Sterck, Adam Smith

    Anderson acceleration (AA) is widely used for accelerating the convergence of an underlying fixed-point iteration [Formula: see text], [Formula: see text], with [Formula: see text], [Formula: see text]. Despite AA’s widespread use, relatively little is understood theoretically about the extent to which it may accelerate the underlying fixed-point iteration. To this end, we analyze a restarted variant of AA with a restart size of one, a method closely related to GMRES(1). We consider the case of [Formula: see text] with matrix [Formula: see text] either symmetric or skew-symmetric. For both classes of [Formula: see text] we compute the worst-case root-average asymptotic convergence factor of the AA method, partially relying on conjecture in the symmetric setting, proving that it is strictly smaller than that of the underlying fixed-point iteration. For symmetric [Formula: see text], we show that the AA residual iteration corresponds to a fixed-point iteration for solving an eigenvector-dependent nonlinear eigenvalue problem (NEPv), and we show how this can result in the convergence factor strongly depending on the initial iterate, which we quantify exactly in certain special cases. Conversely, for skew-symmetric [Formula: see text] we show that the AA residual iteration is closely related to a power iteration for [Formula: see text], and how this results in the convergence factor being independent of the initial iterate. Supporting numerical results are given, which also indicate the theory is applicable to the more general setting of nonlinear [Formula: see text] with Jacobian at the fixed point that is symmetric or skew-symmetric. 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/okrzysik/rAA1-paper-code and in the supplementary material ( M167226_SM.pdf [2.60MB], M167226_SM.zip [8.22MB]). [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.


  • Constrained Local Approximate Ideal Restriction for Advection-Diffusion Problems

    by Ahsan Ali, James J. Brannick, Karsten Kahl, Oliver A. Krzysik, Jacob B. Schroder, Ben S. Southworth

    This paper focuses on developing a reduction-based algebraic multigrid (AMG) method that is suitable for solving general (non)symmetric linear systems and is naturally robust from pure advection to pure diffusion. Initial motivation comes from a new reduction-based AMG approach, [Formula: see text] (local approximate ideal restriction), that was developed for solving advection-dominated problems. Though this new solver is very effective in the advection-dominated regime, its performance degrades in cases where diffusion becomes dominant. This is consistent with the fact that in general, reduction-based AMG methods tend to suffer from growth in complexity and/or convergence rates as the problem size is increased, especially for diffusion-dominated problems in two or three dimensions. Motivated by the success of [Formula: see text] in the advective regime, our aim in this paper is to generalize the AIR framework with the goal of improving the performance of the solver in diffusion-dominated regimes. To do so, we propose a novel way to combine mode constraints as used commonly in energy-minimization AMG methods with the local approximation of ideal operators used in [Formula: see text]. The resulting constrained [Formula: see text] algorithm is able to achieve fast scalable convergence on advective and diffusive problems. In addition, it is able to achieve standard low complexity hierarchies in the diffusive regime through aggressive coarsening, something that was previously difficult for reduction-based methods.


  • Open Access

    First-order PDES for Graph Neural Networks: Advection And Burgers Equation Models

    by Yifan Qu, Oliver Krzysik, Hans De Sterck, Omer Ege Kara

    Graph Neural Networks (GNNs) have established themselves as the preferred methodology in a multitude of domains, ranging from computer vision to computational biology, especially in contexts where data inherently conform to graph structures. While many existing methods have endeavored to model GNNs using various techniques, a prevalent challenge they grapple with is the issue of over-smoothing. This paper presents new Graph Neural Network models that incorporate two first-order Partial Differential Equations (PDEs). These models do not increase complexity but effectively mitigate the over-smoothing problem. Our experimental findings highlight the capacity of our new PDE model to achieve comparable results with higher-order PDE models and fix the over-smoothing problem up to 64 layers. These results underscore the adaptability and versatility of GNNs, indicating that unconventional approaches can yield outcomes on par with established techniques.