Related papers: Krylov subspace methods for the solution of linear…
In this work, we propose a class of novel preconditioned Krylov subspace methods for solving an optimal control problem of parabolic equations. Namely, we develop a family of block $\omega$-circulant based preconditioners for the…
In this research, to solve the large indefinite least squares problem, we firstly transform its normal equation into a sparse block three-by-three linear systems, then use GMRES method with an accelerated preconditioner to solve it. The…
Poroelasticity problems play an important role in various engineering, geophysical, and biological applications. Their full discretization results in a large-scale saddle-point system at each time step that is becoming singular for locking…
We consider the iterative solution of regularized saddle-point systems. When the leading block is symmetric and positive semi-definite on an appropriate subspace, Dollar, Gould, Schilders, and Wathen (2006) describe how to apply the…
A block lower triangular Toeplitz system arising from time-space fractional diffusion equation is discussed. For efficient solutions of such the linear system, the preconditioned biconjugate gradient stabilized method and flexible general…
Radial basis functions provide highly useful and flexible interpolants to multivariate functions. Further, they are beginning to be used in the numerical solution of partial differential equations. Unfortunately, their construction requires…
In this paper, we analyze the spectra of the preconditioned matrices arising from discretized multi-dimensional Riesz spatial fractional diffusion equations. The finite difference method is employed to approximate the multi-dimensional…
This work proposes a new class of preconditioners for the low rank Generalized Minimal Residual Method (GMRES) for multiterm matrix equations arising from implicit timestepping of linear matrix differential equations. We are interested in…
This paper presents a couple of preconditioning techniques that can be used to enhance the performance of iterative regularization methods applied to image deblurring problems with a variety of point spread functions (PSFs) and boundary…
Use of the stochastic Galerkin finite element methods leads to large systems of linear equations obtained by the discretization of tensor product solution spaces along their spatial and stochastic dimensions. These systems are typically…
In this paper we want to propose practical numerical methods to solve a class of initial-boundary problem of space-time fractional advection-diffusion equations. To start with, an implicit method based on two-sided Gr\"unwald formulae is…
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…
The solution of Hermitian positive definite random Toeplitz systems $Ax=b$ by the preconditioned conjugate gradient method for the Strang circulant preconditioner is studied. We established the foundation for this method by extending the…
We develop a simple algorithmic framework to solve large-scale symmetric positive definite linear systems. At its core, the framework relies on two components: (1) a norm-convergent iterative method (i.e. smoother) and (2) a preconditioner.…
When a linear system Ax = y is solved by means of iterative methods (mainly CG and GMRES) and the convergence rate is slow, one may consider a preconditioner P. The use of such preconditioner changes the spectrum of the matrix defining the…
Preconditioned Krylov subspace (KSP) methods are widely used for solving large-scale sparse linear systems arising from numerical solutions of partial differential equations (PDEs). These linear systems are often nonsymmetric due to the…
In this paper we study fast iterative solvers for the large sparse linear systems resulting from the stochastic Galerkin discretization of stochastic partial differential equations. A block triangular preconditioner is introduced and…
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…
This work considers the iterative solution of large-scale problems subject to non-symmetric matrices or operators arising in discretizations of (port-)Hamiltonian partial differential equations. We consider problems governed by an operator…
Large linear systems are ubiquitous in modern computational science and engineering. The main recipe for solving them is the use of Krylov subspace iterative methods with well-designed preconditioners. Recently, GNNs have been shown to be a…