On the least squares generalized Hamiltonian solution of generalized coupled Sylvester-conjugate matrix equations
| Autor: | Bao-Hua Huang, Changfeng Ma |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
0209 industrial biotechnology
Generalized inverse Iterative method Mathematical analysis Linear system Generalized linear array model 010103 numerical & computational mathematics 02 engineering and technology 01 natural sciences Computational Mathematics symbols.namesake Matrix (mathematics) 020901 industrial engineering & automation Computational Theory and Mathematics Minimum norm Modeling and Simulation ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION symbols 0101 mathematics Hamiltonian (quantum mechanics) Conjugate transpose Mathematics |
| Zdroj: | Computers & Mathematics with Applications. 74:532-555 |
| ISSN: | 0898-1221 |
| Popis: | In this paper, we discuss the finite iterative algorithm to solve a class of generalized coupled Sylvester-conjugate matrix equations. We prove that if the system is consistent, an exact generalized Hamiltonian solution can be obtained within finite iterative steps in the absence of round-off errors for any initial matrices; if the system is inconsistent, the least squares generalized Hamiltonian solution can be obtained within finite iterative steps in the absence of round-off errors. Furthermore, we provide a method for choosing the initial matrices to obtain the minimum norm least squares generalized Hamiltonian solution of the system. Finally, numerical examples are presented to demonstrate the algorithm is efficient. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect