Related papers: A note on Sylvester-type equations
We consider generalizations of the Sylvester matrix equation, consisting of the sum of a Sylvester operator and a linear operator $\Pi$ with a particular structure. More precisely, the commutator of the matrix coefficients of the operator…
This paper solves the Sylvester equation in the form of AX+XB=C in a distributed way, and proposes three distributed continuous-time algorithms for three cases. We start with the basic algorithm for solving a least squares solution of the…
In this paper we propose and analyze a class of simple Nystr\"om discretizations of the hypersingular integral equation for the Helmholtz problem on domains of the plane with smooth parametrizable boundary. The method depends on a parameter…
This study establishes consistency conditions and a general solution for a coupled system that consists of five two-sided Sylvester-like tensor equations in ten quaternion variables throughout the Einstein tensor product. Certain specific…
Consider a symmetric matrix $A(v)\in\RR^{n\times n}$ depending on a vector $v\in\RR^n$ and satisfying the property $A(\alpha v)=A(v)$ for any $\alpha\in\RR\backslash{0}$. We will here study the problem of finding $(\lambda,v)\in\RR\times…
In this paper, we present and analyze methods for solving a system of linear equations over idempotent semifields. The first method is based on the pseudo-inverse of the system matrix. We then present a specific version of Cramer's rule…
This paper provides the spectral decomposition of $(\star,\epsilon)$-palindromic quadratic matrix polynomial $P(\lambda)$ by a standard pair and a parameter matrix. When $J$ is assumed to be a block diagonal matrix, the parameter matrix…
This paper investigates the necessary and sufficient algebraic conditions to a constrained system of Sylvester-type quaternion tensor equations. An explicit formula of the general solution regarding the Moore-Penrose inverses of some block…
Krylov subspace methods, such as the Conjugate Gradient (CG) and BiCGSTAB methods, are widely used in scientific computing for solving linear systems. In this study, we propose a new framework for solving large Sylvester equations in a…
Generalized eigenvalue problems involving a singular pencil may be very challenging to solve, both with respect to accuracy and efficiency. While Part I presented a rank-completing addition to a singular pencil, we now develop two…
We introduce an eigenvalue-preserving transformation algorithm from the generalized eigenvalue problem by matrix pencil of the upper and the lower bidiagonal matrices into a standard eigenvalue problem while preserving sparsity, using the…
In this paper explicit necessary and sufficient conditions for the constrained Sylvester-observer equation are established, in order to have a solution over the field of real numbers. Furthermore, a procedure is given for the computation of…
In this paper, we propose a decomposition approach for eigenvalue problems with spatial symmetries, including the formulation, discretization as well as implementation. This approach can handle eigenvalue problems with either Abelian or…
In this paper, we first formalize the problem to be solved, i.e., the Scatter Problem (SP). We then show that SP cannot be deterministically solved. Next, we propose a randomized algorithm for this problem. The proposed solution is…
In this paper, we prove a conjecture which was presented in a recent paper [Linear Algebra Appl. 2016; 496: 549--593]. We derive some practical necessary and sufficient conditions for the existence of a solution to a system of coupled…
Implementation of many statistical methods for large, multivariate data sets requires one to solve a linear system that, depending on the method, is of the dimension of the number of observations or each individual data vector. This is…
The solution of large scale Sylvester matrix equation plays an important role in control and large scientific computations. A popular approach is to use the global GMRES algorithm. In this work, we first consider the global GMRES algorithm…
Recently, we used the Sinc collocation method with the double exponential transformation to compute eigenvalues for singular Sturm-Liouville problems. In this work, we show that the computation complexity of the eigenvalues of such a…
We consider the convolution equation $F*X=B$, where $F\in\mathbb{R}^{3\times 3}$ and $B\in\mathbb{R}^{m\times n}$ are given, and $X\in\mathbb{R}^{m\times n}$ is to be determined. The convolution equation can be regarded as a linear system…
A super-stable matching, which was introduced by Irving, is a solution concept in a variant of the stable matching problem in which the preferences may contain ties. Irving proposed a polynomial-time algorithm for the problem of finding a…