‎the global fom and gmres algorithms are among the effective‎ ‎methods to solve sylvester matrix equations‎. ‎in this paper‎, ‎we‎ ‎study these algorithms in the case that the coefficient matrices‎ ‎are real symmetric (real symmetric positive definite) and extract‎ ‎two cg-type algorithms for solving generalized sylvester matrix‎ ‎equations‎. ‎the proposed methods are iterative projection metho...

let ? be an open connected subset of the complex plane c and let t be a bounded linear operator on a hilbert space h. for ? in ? let e the orthogonal projection onto the null-space of t-?i . we discuss the necessary and sufficient conditions for the map ?? to b e continuous on ?. a generalized gram- schmidt process is also given.

This article is devoted to the numerical solution of large-scale quadratic eigenvalue problems. Such problems arise in a wide variety of applications, such as the dynamic analysis of structural mechanical systems, acoustic systems, fluid mechanics, and signal processing. We first introduce a generalized second-order Krylov subspace based on a pair of square matrices and two initial vectors and ...

Abstract The complex kernel adaptive filter (CKAF) has been widely applied to the complex-valued nonlinear problem in signal processing and machine learning. However, most of CKAF applications involve least mean square (CKLMS) algorithms, which work a pure or complexified reproducing Hilbert space (RKHS). In this paper, we propose generalized affine projection (GCKAP) algorithms linear RKHS (WL...