Global Krylov subspace methods are the most efficient and robust methods to solve generalized coupled Sylvester matrix equation. In this paper, we propose the nested splitting conjugate gradient process for solving this equation. This method has inner and outer iterations, which employs the generalized conjugate gradient method as an inner iteration to approximate each outer iterate, while each...

Two algorithms for constructing a class of compactly supported complex tight wavelet frames with conjugate symmetry are provided. Firstly, based on a given complex refinable function φ, an explicit formula for constructing complex tight wavelet frames is presented. If the given complex refinable function φ is compactly supported conjugate symmetric, then we prove that there exists a compactly s...

in this paper, we show that a matrix a in mn(c) that has n coneigenvectors, where coneigenvaluesassociated with them are distinct, is condiagonalizable. and also show that if allconeigenvalues of conjugate-normal matrix a be real, then it is symmetric.

In this paper, we show that a matrix A in Mn(C) that has n coneigenvectors, where coneigenvaluesassociated with them are distinct, is condiagonalizable. And also show that if allconeigenvalues of conjugate-normal matrix A be real, then it is symmetric.  

In this paper, we introduced and investigated starlike and convex functions of order α with respect to 2(j,k)-symmetric conjugate points and coefficient inequality for function belonging to these classes are provided . Also we obtain some convolution condition for functions belonging to this class.

—Conjugate symmetry is an entirely new approach to symmetric Boolean functions that can be used to extend existing methods for handling symmetric functions to a much wider class of functions. These are functions that currently appear to have no symmetries of any kind. Such symmetries occur widely in practice. In fact, we show that even the simplest circuits exhibit conjugate symmetry. To demons...

In this preliminary work, left and right conjugate vectors are deened for nonsymmetric, nonsin-gular matrices A and some properties of these vectors are studied. A left conjugate direction (LCD) method for solving nonsymmetric systems of linear equations is proposed. The method reduces to the usual conjugate gradient method when A is symmetric positive deenite. A nite termination property of th...

In the eld of computational electrodynamics the discretization of Maxwell's equations using the Finite Integration Theory (FIT) yields very large, sparse, complex symmetric linear systems of equations. For this class of complex non-Hermitian systems a number of conjugate gradient-type algorithms is considered. The complex version of the biconjugate gradient (BiCG) method by Jacobs can be extend...