Related papers: Multipreconditioned GMRES for Shifted Systems
Shifted Laplacian multigrid preconditioner has become a tool du jour for solving highly indefinite Helmholtz equations. The idea is to add a complex damping to the original Helmholtz operator and then apply a multigrid processing to the…
We introduce a new general purpose multiresolution preconditioner for symmetric linear systems. Most existing multiresolution preconditioners use some standard wavelet basis that relies on knowledge of the geometry of the underlying domain.…
We propose a preconditioner to accelerate the convergence of the GMRES iterative method for solving the system of linear equations obtained from discretize-then-optimize approach applied to optimal control problems constrained by a partial…
A class of preconditioners is introduced to enhance geometry optimisation and transition state search of molecular systems. We start from the Hessian of molecular mechanical terms, decompose it and retain only its positive definite part to…
A technique for computing an ILU preconditioner based on the FAPINV algorithm is presented. We show that this algorithm is well-defined for H-matrices. Moreover, when used in conjunction with Krylov-subspace-based iterative solvers such as…
We present a modified version of the PRESB preconditioner for two-by-two block system of linear equations with the coefficient matrix $$\textbf{A}=\left(\begin{array}{cc} F & -G^* G & F \end{array}\right),$$ where $F\in\mathbb{C}^{n\times…
{In [X. L. Lin, M. K. Ng, and Y. Zhi. {\it J. Comput. Phys.}, 434 (2021), pp. 110221] and [Y. L. Zhao, J. Wu, X. M. Gu, and H. Li. {\it Comput. Math. Appl.}, 148(2023), pp. 200--210]}, two-sided preconditioning techniques are proposed for…
The generalized minimal residual (GMRES) algorithm is applied to image reconstruction using linear computed tomography (CT) models. The GMRES algorithm iteratively solves square, non-symmetric linear systems and it has practical application…
We propose using greedy and randomized Kaczmarz inner-iterations as preconditioners for the right-preconditioned flexible GMRES method to solve consistent linear systems, with a parameter tuning strategy for adjusting the number of inner…
This paper introduces inexact versions of several block-splitting preconditioners for solving the three-by-three block linear systems arising from a special class of indefinite least squares problems. We first establish the convergence…
A Crank-Nicolson finite volume approximation for three-dimensional conservative space-fractional diffusion equation results in large and dense three-level Toeplitz discrete linear systems. Preconditioned Krylov subspace methods with sine…
We develop a parallel-in-time multigrid preconditioner for augmented systems. These saddle-point systems are foundational to numerical optimization. Our preconditioner, when paired with a suitable optimization method, accelerates the…
Support for lower precision computation is becoming more common in accelerator hardware due to lower power usage, reduced data movement and increased computational performance. However, computational science and engineering (CSE) problems…
A linearly implicit conservative difference scheme is applied to discretize the attractive coupled nonlinear Schr\"odinger equations with fractional Laplacian. Complex symmetric linear systems can be obtained, and the system matrices are…
Analogues of the conjugate gradient method, MINRES, and GMRES are derived for solving boundary value problems (BVPs) involving second-order differential operators. Two challenges arise: imposing the boundary conditions on the solution while…
We consider using the preconditioned-Krylov subspace method to solve the system of linear equations with a three-by-three block structure. By making use of the three-by-three block structure, eight inexact block factorization…
In this paper, we study the restarted Krylov subspace method, which is typically represented by the GMRES(m) method. Our work mainly focused on the amount of change in the iterative solution of GMRES(m) at each restart. We propose an…
The discretization of the double-layer potential integral equation for the interior Dirichlet Laplace problem in a domain with smooth boundary results in a linear system that has a bounded condition number. Thus, the number of iterations…
The discontinuous Petrov-Galerkin (DPG) methodology of Demkowicz and Gopalakrishnan [15,17] guarantees the optimality of the solution in an energy norm, and provides several features facilitating adaptive schemes. A key question that has…
We introduce a new class of preconditioners to enable flexible GMRES to find a least-squares solution, and potentially the pseudoinverse solution, of large-scale sparse, asymmetric, singular, and potentially inconsistent systems. We develop…