Solution of the Matrix Equations $AX + XB = - Q$ and $S^T X + XS = - Q$

1970 ◽  
Vol 18 (3) ◽  
pp. 682-687 ◽  
Author(s):  
P. Chr. Müller
Keyword(s):  
Matrix Equations ◽  
The Matrix

scholarly journals A New Iterative Algorithm for Solving a Class of Matrix Nearness Problem

2012 ◽  
Vol 2012 ◽  
pp. 1-6
Author(s):  
Xuefeng Duan ◽  
Chunmei Li
Keyword(s):  
Iterative Algorithm ◽  
Projection Algorithm ◽  
Frobenius Norm ◽  
Matrix Equations ◽  
Von Neumann ◽  
Numerical Examples ◽  
Matrix Nearness Problem ◽  
Least Frobenius Norm Solution ◽  
Alternating Projection ◽  
The Matrix

Based on the alternating projection algorithm, which was proposed by Von Neumann to treat the problem of finding the projection of a given point onto the intersection of two closed subspaces, we propose a new iterative algorithm to solve the matrix nearness problem associated with the matrix equations AXB=E, CXD=F, which arises frequently in experimental design. If we choose the initial iterative matrix X0=0, the least Frobenius norm solution of these matrix equations is obtained. Numerical examples show that the new algorithm is feasible and effective.

scholarly journals An Iterative Algorithm for the Generalized Reflexive Solutions of the Generalized Coupled Sylvester Matrix Equations

2012 ◽  
Vol 2012 ◽  
pp. 1-28 ◽  
Author(s):  
Feng Yin ◽  
Guang-Xin Huang
Keyword(s):  
Iterative Algorithm ◽  
Special Kind ◽  
Frobenius Norm ◽  
Matrix Equations ◽  
Sylvester Matrix ◽  
Special Cases ◽  
The Matrix ◽  
Solution Pair ◽  
Sylvester Matrix Equations ◽  
Matrix Pair

An iterative algorithm is constructed to solve the generalized coupled Sylvester matrix equations(AXB-CYD,EXF-GYH)=(M,N), which includes Sylvester and Lyapunov matrix equations as special cases, over generalized reflexive matricesXandY. When the matrix equations are consistent, for any initial generalized reflexive matrix pair[X1,Y1], the generalized reflexive solutions can be obtained by the iterative algorithm within finite iterative steps in the absence of round-off errors, and the least Frobenius norm generalized reflexive solutions can be obtained by choosing a special kind of initial matrix pair. The unique optimal approximation generalized reflexive solution pair[X̂,Ŷ]to a given matrix pair[X0,Y0]in Frobenius norm can be derived by finding the least-norm generalized reflexive solution pair[X̃*,Ỹ*]of a new corresponding generalized coupled Sylvester matrix equation pair(AX̃B-CỸD,EX̃F-GỸH)=(M̃,Ñ), whereM̃=M-AX0B+CY0D,Ñ=N-EX0F+GY0H. Several numerical examples are given to show the effectiveness of the presented iterative algorithm.

scholarly journals A note on the Ritz method with an application to overtone stellar pulsation theory

1968 ◽  
Vol 8 (2) ◽  
pp. 275-286 ◽  
Author(s):  
A. L. Andrew
Keyword(s):  
Numerical Solution ◽  
Eigenvalue Problems ◽  
Ritz Method ◽  
Linear Operators ◽  
Matrix Equations ◽  
Infinite Dimensional ◽  
Stellar Pulsation ◽  
Finite Matrix ◽  
The Matrix ◽  
Matrix Eigenvalue Problems

The Ritz method reduces eigenvalue problems involving linear operators on infinite dimensional spaces to finite matrix eigenvalue problems. This paper shows that for a certain class of linear operators it is possible to choose the coordinate functions so that numerical solution of the matrix equations is considerably simplified, especially when the matrices are large. The method is applied to the problem of overtone pulsations of stars.

scholarly journals Numerical Solution of Duffing Equation by Using an Improved Taylor Matrix Method

2013 ◽  
Vol 2013 ◽  
pp. 1-6 ◽  
Author(s):  
Berna Bülbül ◽  
Mehmet Sezer
Keyword(s):  
Matrix Method ◽  
Numerical Approach ◽  
Duffing Equation ◽  
Matrix Equations ◽  
Algebraic Equations ◽  
Solution Function ◽  
Numerical Examples ◽  
Collocation Points ◽  
Nonlinear Algebraic Equations ◽  
The Matrix

We have suggested a numerical approach, which is based on an improved Taylor matrix method, for solving Duffing differential equations. The method is based on the approximation by the truncated Taylor series about center zero. Duffing equation and conditions are transformed into the matrix equations, which corresponds to a system of nonlinear algebraic equations with the unknown coefficients, via collocation points. Combining these matrix equations and then solving the system yield the unknown coefficients of the solution function. Numerical examples are included to demonstrate the validity and the applicability of the technique. The results show the efficiency and the accuracy of the present work. Also, the method can be easily applied to engineering and science problems.

On Solutions of Inverse Problem for Hermitian Generalized Hamiltonian Matrices

2013 ◽  
Vol 860-863 ◽  
pp. 2727-2731
Author(s):  
Kai Fu Liang ◽  
Ming Jun Li ◽  
Ze Lin Zhu
Keyword(s):  
Inverse Problem ◽  
Inverse Problems ◽  
Design Automation ◽  
Sufficient Conditions ◽  
Matrix Equations ◽  
Complex Matrix ◽  
Linear Quadratic ◽  
Real Representation ◽  
The Matrix ◽  
Necessary And Sufficient

Hamiltonian matrices have many applications to design automation and autocontrol, in particular in the linear-quadratic autocontrol problem. This paper studies the inverse problems of generalized Hamiltonian matrices for matrix equations. By real representation of complex matrix, we give the necessary and sufficient conditions for the existence of a Hermitian generalized Hamiltonian solutions to the matrix equations, and then derive the representation of the general solutions.

scholarly journals Solving higher order Fuchs type differential systems avoiding the increase of the problem dimension

1994 ◽  
Vol 17 (1) ◽  
pp. 91-102
Author(s):  
E. Navarro ◽  
L. Jódar ◽  
R. Company
Keyword(s):  
Homogeneous Problem ◽  
Higher Order ◽  
Closed Form Expression ◽  
Power Series Solution ◽  
Matrix Equations ◽  
Form Expression ◽  
Initial Value ◽  
Generalized Power Series ◽  
The Matrix ◽  
Problem Dimension

In this paper, we develop a Frobenius matrix method for solving higher order systems of differential equations of the Fuchs type. Generalized power series solution of the problem are constructed without increasing the problem dimension. Solving appropriate algebraic matrix equations a closed form expression for the matrix coefficient of the series are found. By means of the concept of ak-fundamental set of solutions of the homogeneous problem an explicit solution of initial value problems are given.

On solutions of the matrix equations and

2012 ◽  
Vol 350 (19-20) ◽  
pp. 903-906 ◽  
Author(s):  
Yongxin Yuan ◽  
Jiashang Jiang
Keyword(s):  
Matrix Equations ◽  
The Matrix

A new algorithm for the symmetric solution of the matrix equations $AXB=E$ and $CXD=F$

2018 ◽  
Vol 9 (1) ◽  
pp. 8-16
Author(s):  
Chunmei Li ◽  
Xuefeng Duan ◽  
Juan Li ◽  
Sitting Yu
Keyword(s):  
Symmetric Solution ◽  
Matrix Equations ◽  
The Matrix
Sign in / Sign up

Export Citation Format

Share Document