Repository logo
Communities & Collections
Research Outputs
Fundings & Projects
People
Statistics
New user? Click here to register.Have you forgotten your password?
  1. Home
  2. KMITL
  3. Publication
  4. Conjugate gradient algorithm for consistent generalized Sylvester-transpose matrix equations
Loading...
Thumbnail Image

Conjugate gradient algorithm for consistent generalized Sylvester-transpose matrix equations

Author(s)
Tansri, Kanjanaporn
Choomklang, Sarawanee
Chansangiam, Pattrawut
Date Issued
January 1, 2022
Type
Article
DOI
10.3934/math.2022299
Abstract
We develop an effective algorithm to find a well-approximate solution of a generalized Sylvester-transpose matrix equation where all coefficient matrices and an unknown matrix are rectangular. The algorithm aims to construct a finite sequence of approximated solutions from any given initial matrix. It turns out that the associated residual matrices are orthogonal, and thus, the desire solution comes out in the final step with a satisfactory error. We provide numerical experiments to show the capability and performance of the algorithm.
Citation
Aims Mathematics, 7(4), 5386-5407, 2022
Subjects

Conjugate gradient ag...

Generalized Sylvester...

Kronecker product

Matrix norm

Orthogonality

Metrics
Get Involved!
  • Source Code
  • Documentation
  • Slack Channel
Make it your own

DSpace-CRIS can be extensively configured to meet your needs. Decide which information need to be collected and available with fine-grained security. Start updating the theme to match your Institution's web identity.

Need professional help?

The original creators of DSpace-CRIS at 4Science can take your project to the next level, get in touch!

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Accessibility settings
  • Privacy policy
  • End User Agreement
  • Send Feedback