In this paper we consider the problem of solving a sequence of linear systems with coefficient matrix A(alpha) = I + alpha A (or A(alpha) = alpha I + A), where a is a real paramater and A is skew-symmetric matrix. We propose to solve this problem exploiting the structure of the Schur decomposition of the skew-symmetric matrix and computing the Singular Value Decomposition of a bidiagonal matrix of halved size
AbstractLet R∈Cn×n be a nontrivial involution; i.e., R=R−1≠±I. We say that A∈Cn×n is R-symmetric (R-...
We propose a two-level iterative scheme for solving general sparse linear systems. The proposed sche...
AbstractLet R∈Cm×m and S∈Cn×n be nontrivial involution matrices; i.e. R=R−1≠±I and S=S−1≠±I. An m×n ...
In this paper we consider the problem of solving a sequence of linear systems with coefficient matri...
We are concerned with iterative solvers for large and sparse skew-symmetric linear systems. First we...
AbstractThe symmetric solutions of linear matrix equations like AX = B have been considered using th...
AbstractA matrix S∈C2m×2m is symplectic if SJS∗=J, whereJ=0Im−Im0.Symplectic matrices play an import...
AbstractIn this paper, an iterative method is constructed to solve the linear matrix equation AXB=C ...
We derive the necessary and sufficient conditions of and the expressions for the orthogonal solution...
AbstractBy transforming nonsymmetric linear systems to the extended skew-symmetric ones, we present ...
In this paper we consider numerical methods for computing functions of matrices being Hamiltonian an...
AbstractIn this paper, two efficient iterative methods are presented to solve the symmetric and skew...
In this paper, we introduce and analyze a modification of the Hermitian and skew-Hermitian splitting...
AbstractIt is known that any matrix can be decomposed into a diagonalizable part and a nilpotent par...
Abstract. In this paper a nonlinear matrix equation is considered which has the form P (X) = A0X m ...
AbstractLet R∈Cn×n be a nontrivial involution; i.e., R=R−1≠±I. We say that A∈Cn×n is R-symmetric (R-...
We propose a two-level iterative scheme for solving general sparse linear systems. The proposed sche...
AbstractLet R∈Cm×m and S∈Cn×n be nontrivial involution matrices; i.e. R=R−1≠±I and S=S−1≠±I. An m×n ...
In this paper we consider the problem of solving a sequence of linear systems with coefficient matri...
We are concerned with iterative solvers for large and sparse skew-symmetric linear systems. First we...
AbstractThe symmetric solutions of linear matrix equations like AX = B have been considered using th...
AbstractA matrix S∈C2m×2m is symplectic if SJS∗=J, whereJ=0Im−Im0.Symplectic matrices play an import...
AbstractIn this paper, an iterative method is constructed to solve the linear matrix equation AXB=C ...
We derive the necessary and sufficient conditions of and the expressions for the orthogonal solution...
AbstractBy transforming nonsymmetric linear systems to the extended skew-symmetric ones, we present ...
In this paper we consider numerical methods for computing functions of matrices being Hamiltonian an...
AbstractIn this paper, two efficient iterative methods are presented to solve the symmetric and skew...
In this paper, we introduce and analyze a modification of the Hermitian and skew-Hermitian splitting...
AbstractIt is known that any matrix can be decomposed into a diagonalizable part and a nilpotent par...
Abstract. In this paper a nonlinear matrix equation is considered which has the form P (X) = A0X m ...
AbstractLet R∈Cn×n be a nontrivial involution; i.e., R=R−1≠±I. We say that A∈Cn×n is R-symmetric (R-...
We propose a two-level iterative scheme for solving general sparse linear systems. The proposed sche...
AbstractLet R∈Cm×m and S∈Cn×n be nontrivial involution matrices; i.e. R=R−1≠±I and S=S−1≠±I. An m×n ...