**Commenced**in January 2007

**Frequency:**Monthly

**Edition:**International

**Paper Count:**1965

# Search results for: matrix equation

##### 1965 Iterative solutions to the linear matrix equation AXB + CXTD = E

**Authors:**
Yongxin Yuan,
Jiashang Jiang

**Abstract:**

**Keywords:**
matrix equation,
iterative algorithm,
parameter estimation,
minimum norm solution.

##### 1964 On the Positive Definite Solutions of Nonlinear Matrix Equation

**Authors:**
Tian Baoguang,
Liang Chunyan,
Chen Nan

**Abstract:**

In this paper, the nonlinear matrix equation is investigated. Based on the fixed-point theory, the boundary and the existence of the solution with the case r>-δ_{i} are discussed. An algorithm that avoids matrix inversion with the case -1<-δ_{i}<0 is proposed.

**Keywords:**
Nonlinear matrix equation,
Positive definite solution,
The maximal-minimal solution,
Iterative method,
Free-inversion

##### 1963 The BGMRES Method for Generalized Sylvester Matrix Equation AXB − X = C and Preconditioning

**Authors:**
Azita Tajaddini,
Ramleh Shamsi

**Abstract:**

**Keywords:**
Linear matrix equation,
Block GMRES,
matrix Krylov
subspace,
polynomial preconditioner.

##### 1962 Algebraic Riccati Matrix Equation for Eigen- Decomposition of Special Structured Matrices; Applications in Structural Mechanics

**Authors:**
Mahdi Nouri

**Abstract:**

In this paper Algebraic Riccati matrix equation is used for Eigen-decomposition of special structured matrices. This is achieved by similarity transformation and then using algebraic riccati matrix equation to triangulation of matrices. The process is decomposition of matrices into small and specially structured submatrices with low dimensions for fast and easy finding of Eigenpairs. Numerical and structural examples included showing the efficiency of present method.

**Keywords:**
Riccati,
matrix equation,
eigenvalue problem,
symmetric,
bisymmetric,
persymmetric,
decomposition,
canonical
forms,
Graphs theory,
adjacency and Laplacian matrices.

##### 1961 Conjugate Gradient Algorithm for the Symmetric Arrowhead Solution of Matrix Equation AXB=C

**Authors:**
Minghui Wang,
Luping Xu,
Juntao Zhang

**Abstract:**

*AXB=C*and the associate optimal approximation problem are considered for the symmetric arrowhead matrix solutions in the premise of consistency. The convergence results of the method are presented. At last, a numerical example is given to illustrate the efficiency of this method.

**Keywords:**
Iterative method,
symmetric arrowhead matrix,
conjugate gradient algorithm.

##### 1960 Two Iterative Algorithms to Compute the Bisymmetric Solution of the Matrix Equation A1X1B1 + A2X2B2 + ... + AlXlBl = C

**Authors:**
A.Tajaddini

**Abstract:**

In this paper, two matrix iterative methods are presented to solve the matrix equation A1X1B1 + A2X2B2 + ... + AlXlBl = C the minimum residual problem l i=1 AiXiBi−CF = minXi∈BRni×ni l i=1 AiXiBi−CF and the matrix nearness problem [X1, X2, ..., Xl] = min[X1,X2,...,Xl]∈SE [X1,X2, ...,Xl] − [X1, X2, ..., Xl]F , where BRni×ni is the set of bisymmetric matrices, and SE is the solution set of above matrix equation or minimum residual problem. These matrix iterative methods have faster convergence rate and higher accuracy than former methods. Paige’s algorithms are used as the frame method for deriving these matrix iterative methods. The numerical example is used to illustrate the efficiency of these new methods.

**Keywords:**
Bisymmetric matrices,
Paige’s algorithms,
Least
square.

##### 1959 An Iterative Method for the Symmetric Arrowhead Solution of Matrix Equation

**Authors:**
Minghui Wang,
Luping Xu,
Juntao Zhang

**Abstract:**

**Keywords:**
Symmetric arrowhead matrix,
iterative method,
like-minimum norm,
minimum norm,
Algorithm LSQR.

##### 1958 A Fast Cyclic Reduction Algorithm for A Quadratic Matrix Equation Arising from Overdamped Systems

**Abstract:**

**Keywords:**
Fast algorithm,
Cyclic reduction,
Overdampedquadratic matrix equation,
Structure-preserving doubling algorithm

##### 1957 Mathematical Modelling of Transport Phenomena in Radioactive Waste-Cement-Bentonite Matrix

**Authors:**
Ilija Plecas,
Uranija Kozmidis-Luburic,
Radojica Pesic

**Abstract:**

The leaching rate of 137Cs from spent mix bead (anion and cation) exchange resins in a cement-bentonite matrix has been studied. Transport phenomena involved in the leaching of a radioactive material from a cement-bentonite matrix are investigated using three methods based on theoretical equations. These are: the diffusion equation for a plane source an equation for diffusion coupled to a firstorder equation and an empirical method employing a polynomial equation. The results presented in this paper are from a 25-year mortar and concrete testing project that will influence the design choices for radioactive waste packaging for a future Serbian radioactive waste disposal center.

**Keywords:**
bentonite,
cement ,
radioactive waste,
composite,
disposal,
diffusion

##### 1956 Iterative Solutions to Some Linear Matrix Equations

**Authors:**
Jiashang Jiang,
Hao Liu,
Yongxin Yuan

**Abstract:**

In this paper the gradient based iterative algorithms are presented to solve the following four types linear matrix equations: (a) AXB = F; (b) AXB = F, CXD = G; (c) AXB = F s. t. X = XT ; (d) AXB+CYD = F, where X and Y are unknown matrices, A,B,C,D, F,G are the given constant matrices. It is proved that if the equation considered has a solution, then the unique minimum norm solution can be obtained by choosing a special kind of initial matrices. The numerical results show that the proposed method is reliable and attractive.

**Keywords:**
Matrix equation,
iterative algorithm,
parameter estimation,
minimum norm solution.

##### 1955 Solving Linear Matrix Equations by Matrix Decompositions

**Authors:**
Yongxin Yuan,
Kezheng Zuo

**Abstract:**

In this paper, a system of linear matrix equations is considered. A new necessary and sufficient condition for the consistency of the equations is derived by means of the generalized singular-value decomposition, and the explicit representation of the general solution is provided.

**Keywords:**
Matrix equation,
Generalized inverse,
Generalized
singular-value decomposition.

##### 1954 Extending Global Full Orthogonalization method for Solving the Matrix Equation AXB=F

**Authors:**
Fatemeh Panjeh Ali Beik

**Abstract:**

**Keywords:**
Matrix equations,
Iterative methods,
Block Krylovsubspace methods.

##### 1953 A Novel System of Two Coupled Equations for the Longitudinal Components of the Electromagnetic Field in a Waveguide

**Authors:**
Arti Vaish,
Harish Parthasarathy

**Abstract:**

**Keywords:**
Electromagnetism,
Maxwell's Equations,
Anisotropic permittivity,
Wave equation,
Matrix Equation,
Permittivity tensor.

##### 1952 On Positive Definite Solutions of Quaternionic Matrix Equations

**Authors:**
Minghui Wang

**Abstract:**

**Keywords:**
Matrix equation,
Quaternionic matrix,
Real representation,
positive (semi)definite solutions.

##### 1951 Note to the Global GMRES for Solving the Matrix Equation AXB = F

**Authors:**
Fatemeh Panjeh Ali Beik

**Abstract:**

In the present work, we propose a new projection method for solving the matrix equation AXB = F. For implementing our new method, generalized forms of block Krylov subspace and global Arnoldi process are presented. The new method can be considered as an extended form of the well-known global generalized minimum residual (Gl-GMRES) method for solving multiple linear systems and it will be called as the extended Gl-GMRES (EGl- GMRES). Some new theoretical results have been established for proposed method by employing Schur complement. Finally, some numerical results are given to illustrate the efficiency of our new method.

**Keywords:**
Matrix equation,
Iterative method,
linear systems,
block Krylov subspace method,
global generalized minimum residual (Gl-GMRES).

##### 1950 Frequency Transformation with Pascal Matrix Equations

**Authors:**
Phuoc Si Nguyen

**Abstract:**

**Keywords:**
Frequency transformation,
Bilinear z-transformation,
Pre-warping frequency,
Digital filters,
Analog filters,
Pascal’s
triangle.

##### 1949 A New Inversion-free Method for Hermitian Positive Definite Solution of Matrix Equation

**Authors:**
Minghui Wang,
Juntao Zhang

**Abstract:**

An inversion-free iterative algorithm is presented for solving nonlinear matrix equation with a stepsize parameter t. The existence of the maximal solution is discussed in detail, and the method for finding it is proposed. Finally, two numerical examples are reported that show the efficiency of the method.

**Keywords:**
Inversion-free method,
Hermitian positive definite solution,
Maximal solution,
Convergence.

##### 1948 Delay-independent Stabilization of Linear Systems with Multiple Time-delays

**Authors:**
Ping He,
Heng-You Lan,
Gong-Quan Tan

**Abstract:**

**Keywords:**
Linear system,
Delay-independent stabilization,
Lyapunovfunctional,
Riccati algebra matrix equation.

##### 1947 On Generalized New Class of Matrix Polynomial Set

**Authors:**
Ghazi S. Kahmmash

**Abstract:**

New generalization of the new class matrix polynomial set have been obtained. An explicit representation and an expansion of the matrix exponential in a series of these matrix are given for these matrix polynomials.

**Keywords:**
Generating functions,
Recurrences relation and Generalization of the new class matrix polynomial set.

##### 1946 A Projection Method Based on Extended Krylov Subspaces for Solving Sylvester Equations

**Authors:**
Yiqin Lin,
Liang Bao,
Yimin Wei

**Abstract:**

In this paper we study numerical methods for solving Sylvester matrix equations of the form AX +XBT +CDT = 0. A new projection method is proposed. The union of Krylov subspaces in A and its inverse and the union of Krylov subspaces in B and its inverse are used as the right and left projection subspaces, respectively. The Arnoldi-like process for constructing the orthonormal basis of the projection subspaces is outlined. We show that the approximate solution is an exact solution of a perturbed Sylvester matrix equation. Moreover, exact expression for the norm of residual is derived and results on finite termination and convergence are presented. Some numerical examples are presented to illustrate the effectiveness of the proposed method.

**Keywords:**
Arnoldi process,
Krylov subspace,
Iterative method,
Sylvester equation,
Dissipative matrix.

##### 1945 Approximate Solutions to Large Stein Matrix Equations

**Authors:**
Khalide Jbilou

**Abstract:**

In the present paper, we propose numerical methods for solving the Stein equation AXC - X - D = 0 where the matrix A is large and sparse. Such problems appear in discrete-time control problems, filtering and image restoration. We consider the case where the matrix D is of full rank and the case where D is factored as a product of two matrices. The proposed methods are Krylov subspace methods based on the block Arnoldi algorithm. We give theoretical results and we report some numerical experiments.

**Keywords:**
IEEEtran,
journal,
LATEX,
paper,
template.

##### 1944 On the Integer Solutions of the Pell Equation x2 - dy2 = 2t

**Authors:**
Ahmet Tekcan,
Betül Gezer,
Osman Bizim

**Abstract:**

Let k ≥ 1 and t ≥ 0 be two integers and let d = k2 + k be a positive non-square integer. In this paper, we consider the integer solutions of Pell equation x2 - dy2 = 2t. Further we derive a recurrence relation on the solutions of this equation.

**Keywords:**
Pell equation,
Diophantine equation.

##### 1943 The Partial Non-combinatorially Symmetric N10 -Matrix Completion Problem

**Authors:**
Gu-Fang Mou,
Ting-Zhu Huang

**Abstract:**

An n×n matrix is called an N1 0 -matrix if all principal minors are non-positive and each entry is non-positive. In this paper, we study the partial non-combinatorially symmetric N1 0 -matrix completion problems if the graph of its specified entries is a transitive tournament or a double cycle. In general, these digraphs do not have N1 0 -completion. Therefore, we have given sufficient conditions that guarantee the existence of the N1 0 -completion for these digraphs.

**Keywords:**
Matrix completion,
matrix completion,
N10 -matrix,
non-combinatorially symmetric,
cycle,
digraph.

##### 1942 Fuzzy Adjacency Matrix in Graphs

**Authors:**
Mahdi Taheri,
Mehrana Niroumand

**Abstract:**

**Keywords:**
Graph,
adjacency matrix,
fuzzy numbers

##### 1941 Matrix Valued Difference Equations with Spectral Singularities

**Authors:**
Serifenur Cebesoy,
Yelda Aygar,
Elgiz Bairamov

**Abstract:**

In this study, we examine some spectral properties of non-selfadjoint matrix-valued difference equations consisting of a polynomial-type Jost solution. The aim of this study is to investigate the eigenvalues and spectral singularities of the difference operator L which is expressed by the above-mentioned difference equation. Firstly, thanks to the representation of polynomial type Jost solution of this equation, we obtain asymptotics and some analytical properties. Then, using the uniqueness theorems of analytic functions, we guarantee that the operator L has a finite number of eigenvalues and spectral singularities.

**Keywords:**
Difference Equations,
Jost Functions,
Asymptotics,
Eigenvalues,
Continuous Spectrum,
Spectral Singularities.

##### 1940 State Dependent Riccati Equation Based Roll Autopilot for 122mm Artillery Rocket

**Authors:**
Muhammad Kashif Siddiq,
Fang Jian Cheng,
Yu Wen Bo

**Abstract:**

**Keywords:**
Fin stabilized 122mm artillery rocket,
Roll
Autopilot,
Six degree of freedom trajectory model,
State-dependent
Riccati equation.

##### 1939 Numerical Solution of a Laminar Viscous Flow Boundary Layer Equation Using Uniform Haar Wavelet Quasi-linearization Method

**Authors:**
Harpreet Kaur,
Vinod Mishra,
R. C. Mittal

**Abstract:**

In this paper, we have proposed a Haar wavelet quasilinearization method to solve the well known Blasius equation. The method is based on the uniform Haar wavelet operational matrix defined over the interval [0, 1]. In this method, we have proposed the transformation for converting the problem on a fixed computational domain. The Blasius equation arises in the various boundary layer problems of hydrodynamics and in fluid mechanics of laminar viscous flows. Quasi-linearization is iterative process but our proposed technique gives excellent numerical results with quasilinearization for solving nonlinear differential equations without any iteration on selecting collocation points by Haar wavelets. We have solved Blasius equation for 1≤α ≤ 2 and the numerical results are compared with the available results in literature. Finally, we conclude that proposed method is a promising tool for solving the well known nonlinear Blasius equation.

**Keywords:**
Boundary layer Blasius equation,
collocation points,
quasi-linearization process,
uniform haar wavelets.

##### 1938 The Proof of Two Conjectures Related to Pell-s Equation x2 −Dy2 = ± 4

**Authors:**
Armend Sh. Shabani

**Abstract:**

**Keywords:**
Pell's equation,
solutions of Pell's equation.

##### 1937 Inverse Matrix in the Theory of Dynamic Systems

**Authors:**
R. Masarova,
M. Juhas,
B. Juhasova,
Z. Sutova

**Abstract:**

**Keywords:**
Dynamic system,
transfer matrix,
inverse matrix,
modeling.

##### 1936 Numerical Solution of Riccati Differential Equations by Using Hybrid Functions and Tau Method

**Authors:**
Changqing Yang,
Jianhua Hou,
Beibo Qin

**Abstract:**

A numerical method for Riccati equation is presented in this work. The method is based on the replacement of unknown functions through a truncated series of hybrid of block-pulse functions and Chebyshev polynomials. The operational matrices of derivative and product of hybrid functions are presented. These matrices together with the tau method are then utilized to transform the differential equation into a system of algebraic equations. Corresponding numerical examples are presented to demonstrate the accuracy of the proposed method.

**Keywords:**
Hybrid functions,
Riccati differential equation,
Blockpulse,
Chebyshev polynomials,
Tau method,
operational matrix.