Related papers: A general alternating direction implicit iteration…
In this paper, applying the Newton method, we transform the complex continuous-time algebraic Riccati matrix equation into a Lyapunov equation. Then, we introduce an efficient general alternating-direction implicit (GADI) method to solve…
This paper presents an effective low-rank generalized alternating direction implicit iteration (R-GADI) method for solving large-scale sparse and stable Lyapunov matrix equations and continuous-time algebraic Riccati matrix equations. The…
In this article, we introduce a three-precision formulation of the General Alternating-Direction Implicit method (GADI) designed to accelerate the solution of large-scale sparse linear systems $Ax=b$. GADI is a framework that can represent…
This paper proposes an efficient general alternating-direction implicit (GADI) framework for solving large sparse linear systems. The convergence property of the GADI framework is discussed. Most of the existing ADI methods can be viewed as…
The alternating direction implicit (ADI) methods are computationally efficient and numerically effective tools for computing low-rank solutions of large-scale linear matrix equations. It is known in the literature that the low-rank ADI…
Alternating Directions Implicit (ADI) integration is an operator splitting approach to solve parabolic and elliptic partial differential equations in multiple dimensions based on solving sequentially a set of related one-dimensional…
This study presents a novel mixed-precision iterative refinement algorithm, GADI-IR, within the general alternating-direction implicit (GADI) framework, designed for efficiently solving large-scale sparse linear systems. By employing…
We derive the alternating-directions implicit (ADI) method based on a commuting operator split and apply the results in detail to the continuous time algebraic Lyapunov equation with low-rank constant term and approximate solution, giving…
A new version of the alternating directions implicit (ADI) iteration for the solution of large-scale Lyapunov equations is introduced. It generalizes the hitherto existing iteration, by incorporating tangential directions in the way they…
In this paper, we propose an RADI-type method for large-scale stochastic continuous-time algebraic Riccati equations with sparse and low-rank matrices. This new variant of RADI-type methods is developed by integrating the core concept of…
The low-rank alternating direction implicit (ADI) method is an efficient and effective solver for large-scale standard continuous-time algebraic Riccati equations that admit low-rank solutions. However, the existing low-rank ADI algorithm…
Continuous-time algebraic Riccati equations can be found in many disciplines in different forms. In the case of small-scale dense coefficient matrices, stabilizing solutions can be computed to all possible formulations of the Riccati…
In this paper, we establish results fully addressing two open problems proposed recently by I. Ivanov, see Nonlinear Analysis 69 (2008) 4012--4024, with respect to the convergence of the accelerated Riccati iteration method for solving the…
Two approaches for approximating the solution of large-scale Lyapunov equations are considered: the alternating direction implicit (ADI) iteration and projective methods by Krylov subspaces. A link between them is presented by showing that…
This paper considers large-scale nonsymmetric continuous-time algebraic Riccati equations (NAREs) that admit low-rank solutions. Low-rank alternating direction implicit (ADI) methods have proven to be an efficient approach for solving…
In this study, the Riccati equation is resolved using the generalized recursive integrating factor method. By applying a non-linear transformation to the dependent variable $y(x)$ of the Riccati equation, a second-order linear differential…
We are concerned with the efficient implementation of symplectic implicit Runge-Kutta (IRK) methods applied to systems of (non-necessarily Hamiltonian) ordinary differential equations by means of Newton-like iterations. We pay particular…
We consider the low-rank alternating directions implicit (ADI) iteration for approximately solving large-scale algebraic Sylvester equations. Inside every iteration step of this iterative process a pair of linear systems of equations has to…
Recently Ahmadi et al. (2021) and Tagliaferro (2022) proposed some iterative methods for the numerical solution of linear systems which, under the classical hypothesis of strict diagonal dominance, typically converge faster than the Jacobi…
This paper is devoted to studying the global and finite convergence of the semi-smooth Newton method for solving a piecewise linear system that arises in cone-constrained quadratic programming problems and absolute value equations. We first…