Related papers: A class of multiplicative splitting iterations for…
In this paper, we study distributed methods for solving a Sylvester equation in the form of AX+XB=C for matrices A, B, C$\in R^{n\times n}$ with X being the unknown variable. The entries of A, B and C (called data) are partitioned into a…
This overview is devoted to splitting methods, a class of numerical integrators intended for differential equations that can be subdivided into different problems easier to solve than the original system. Closely connected with this class…
In this paper we present an extension of standard iterative splitting schemes to multiple splitting schemes for solving higher order differential equations. We are motivated by dynamical systems, which occur in dynamics of the electrons in…
We propose and analyze a second-order Strang splitting method for a class of stiff matrix differential equations with Sylvester-type structure. The method splits the dynamics into a stiff linear part, treated exactly via matrix…
We introduce a two-parameter version of the two-step scale-splitting iteration method, called TTSCSP, for solving a broad class of complex symmetric system of linear equations. We present some conditions for the convergence of the method.…
In this paper we present iterative and noniterative splitting methods, which are used to solve stochastic Burgers' equations. The non-iterative splitting methods are based on Lie-Trotter and Strang-splitting methods, while the iterative…
Iterative methods based on tensors have emerged as powerful tools for solving tensor equations, and have significantly advanced across multiple disciplines. In this study, we propose two-step tensor-based iterative methods to solve the…
A general asynchronous alternating iterative model is designed, for which convergence is theoretically ensured both under classical spectral radius bound and, then, for a classical class of matrix splittings for $\mathsf H$-matrices. The…
In earlier work we have studied a method for discretization in time of a parabolic problem which consists in representing the exact solution as an integral in the complex plane and then applying a quadrature formula to this integral. In…
In this paper, an iterative algorithm is presented for solving Sylvester tensor equation $\mathscr{A}*_M\mathscr{X}+\mathscr{X}*_N\mathscr{C}=\mathscr{D}$, where $\mathscr{A}$, $\mathscr{C}$ and $\mathscr{D}$ are given tensors with…
Recursive blocked algorithms have proven to be highly efficient at the numerical solution of the Sylvester matrix equation and its generalizations. In this work, we show that these algorithms extend in a seamless fashion to…
We analyze the preservation properties of a family of reversible splitting methods when they are applied to the numerical time integration of linear differential equations defined in the unitary group. The schemes involve complex…
Obtaining the inverse of a large symmetric positive definite matrix $\mathcal{A}\in\mathbb{R}^{p\times p}$ is a continual challenge across many mathematical disciplines. The computational complexity associated with direct methods can be…
In this paper we present a variant of the proximal forward-backward splitting iteration for solving nonsmooth optimization problems in Hilbert spaces, when the objective function is the sum of two nondifferentiable convex functions. The…
In this paper, a method via sparse-sparse iteration for computing a sparse incomplete factorization of the inverse of a symmetric positive definite matrix is proposed. The resulting factorized sparse approximate inverse is used as a…
In this article, we establish a class of new projected type iteration methods based on matrix spitting for solving the linear complementarity problem. Also, we provide a sufficient condition for the convergence analysis when the system…
Iterative methods based on matrix splittings are useful in solving large sparse linear systems. In this direction, proper splittings and its several extensions are used to deal with singular and rectangular linear systems. In this article,…
The object of this paper is to introduce a new and fascinating method of solving large linear equations, based on Cramer's rule or Gaussian elimination but employing Sylvester's determinant identity in its computation process. In addition,…
We present here a new splitting method to solve Lyapunov equations of the type $AP + PA^T=-BB^T$ in a Kronecker product form. Although that resulting matrix is of order $n^2$, each iteration of the method demands only two operations with…
We show that the discrete operator stemming from the time and space discretization of evolutionary partial differential equations can be represented in terms of a single Sylvester matrix equation. A novel solution strategy that combines…