MARATTO

preprint

The use of a gradient-based iterative technique to solve the generalized coupled Sylvester matrix equations over generalized centro-symmetric matrices

Abstract

In this paper, the generalized coupled Sylvester matrix equations are solved using a gradient-based iterative technique over the generalized centro-symmetric matrices ( . In the case that our investigated matrix equations are consistent, with chosen initial generalized centro-symmetric matrices and , a generalized centro-symmetric solution ( can be found in a finite number of iterations in the absence of round-off errors. Numerical examples are presented in order to support the theoretical results of this paper.

Research topics

  • Matrix Theory and Algorithms
  • Advanced Optimization Algorithms Research
  • Mathematics and Applications

Read the original research

This page summarises published work. The authoritative version sits with the publisher.

DOI: 10.22541/au.170669366.61537839/v1

Is something wrong with this record? Report it or request removal.

Discussion

Discuss this research

Have you built on this work, tried to replicate it, or seen it applied in practice? Share what you know. Verified researchers and MARATTO™ domain experts can open a discussion, and any member can reply. Contributions are reviewed before they appear.

No discussion yet. Open the first thread.