An inversion-free method for finding positive definite solution of a rational matrix equation
A new iterative scheme has been constructed for finding minimal solution of a rational matrix equation of the form X + A * X-1 A = I. The new method is inversion-free per computing step. The convergence of the method has been studied and tested via numerical experiments.
Main Authors: | Soleymani, Fazlollah, Sharifi, Mahdi, Vanani, Solat Karimi, Haghani, Farhad Khaksar, Kilicman, Adem |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Publishing Corporation
2014
|
Online Access: | http://psasir.upm.edu.my/id/eprint/36422/1/An%20inversion.pdf |
Similar Items
-
Efficient iterative methods with and without memory possessing high efficiency indices
by: Lotfi, Taher, et al.
Published: (2014) -
Robustness of operational matrices of differentiation for solving state-space analysis and optimal control problems
by: Tohidi, Emran, et al.
Published: (2013) -
On convergents infinite products and some generalized inverses of matrix sequences
by: Kilicman, Adem, et al.
Published: (2011) -
Asymptotic and boundedness behaviour of a rational difference equation
by: Dilip, Devadanam Suseela, et al.
Published: (2019) -
Computing new solutions of algebro-geometric equation using the discrete inverse Sumudu transform
by: Kilicman, Adem, et al.
Published: (2018)