Related papers: Multipreconditioned GMRES for Shifted Systems
It is tested whether machine learning methods can be used for preconditioning to increase the performance of the linear solver -- the backbone of the semi-implicit, grid-point model approach for weather and climate models. Embedding the…
In this study, the $\theta$-method is used for discretizing a class of evolutionary partial differential equations. Then, we transform the resultant all-at-once linear system and introduce a novel one-sided preconditioner, which can be fast…
This paper presents a method for building a preconditioner for a kernel ridge regression problem, where the preconditioner is not only effective in its ability to reduce the condition number substantially, but also efficient in its…
The GMRES method is used to solve sparse, non-symmetric systems of linear equations arising from many scientific applications. The solver performance within a single node is memory bound, due to the low arithmetic intensity of its…
Parallel multigrid is widely used as preconditioners in solving large-scale sparse linear systems. However, the current multigrid library still needs more satisfactory performance for structured grid problems regarding speed and…
The authors propose a recycling Krylov subspace method for the solution of a sequence of self-adjoint linear systems. Such problems appear, for example, in the Newton process for solving nonlinear equations. Ritz vectors are automatically…
A novel method to enable application of the Multiscale Restricted Smoothed Basis (MsRSB) method to non M-matrices is presented. The original MsRSB method is enhanced with a filtering strategy enforcing M-matrix properties to enable the…
In recent years, topology optimization has been developed sufficiently and many researchers have concentrated on enhancing to computationally numerical algorithms for computational effectiveness of this method. Along with the development of…
In this note, we consider preconditioned Krylov subspace methods for discrete fluid-structure interaction problems with a nonlinear hyperelastic material model and covering a large range of flows, e.g, water, blood, and air with highly…
GMRES is one of the most popular iterative methods for the solution of large linear systems of equations that arise from the discretization of linear well-posed problems, such as Dirichlet boundary value problems for elliptic partial…
We revisit gradient-based optimization for infinite projected entangled pair states (iPEPS), a tensor network ansatz for simulating many-body quantum systems. This approach is hindered by two major challenges: the high computational cost of…
Application of multigrid solvers in shifted linear systems is studied. We focus on accelerating the rational approximation needed for simulating single flavor operators. This is particularly useful, in the case of twisted mass fermions for…
In this work, we propose a simple yet generic preconditioned Krylov subspace method for a large class of nonsymmetric block Toeplitz all-at-once systems arising from discretizing evolutionary partial differential equations. Namely, our main…
We consider the problem of approximating the solution to $A(\mu) x(\mu) = b$ for many different values of the parameter $\mu$. Here we assume $A(\mu)$ is large, sparse, and nonsingular with a nonlinear dependence on $\mu$. Our method is…
The use of block Krylov subspace methods for computing the solution to a sequence of shifted linear systems using subspace recycling was first proposed in [Soodhalter, SISC 2016], where a recycled shifted block GMRES algorithm (rsbGMRES)…
In this work, the matrix-free solution of quasi-static phase-field fracture problems is further investigated. More specifically, we consider a quasi-monolithic formulation in which the irreversibility constraint is imposed with a…
The Shifted Boundary Method (SBM) trades some part of the burden of body-fitted meshing for increased algebraic complexity. While the resulting linear systems retain the standard $\mathcal{O}(h^{-2})$ conditioning of second-order operators,…
Linear systems in applications are typically well-posed, and yet the coefficient matrices may be nearly singular in that the condition number $\kappa(\boldsymbol{A})$ may be close to $1/\varepsilon_{w}$, where $\varepsilon_{w}$ denotes the…
We examine the use of a two-level deflation preconditioner combined with GMRES to locally solve the subdomain systems arising from applying domain decomposition methods to Helmholtz problems. Our results show that the direct solution method…
It is well-known that the convergence of Krylov subspace methods to solve linear system depends on the spectrum of the coefficient matrix, moreover, it is widely accepted that for both symmetric and unsymmetric systems Krylov subspace…