Shengkun Li, Ting‐Zhu Huang
Abstract
Here, two matrix iterative methods are proposed to solve general coupled matrix equations, based on Paige's algorithms as the framework. By these new iterative methods, we can get the minimum Frobenius norm constrained solutions, such as symmetric, generalized bisymmetric and (R, S)-symmetric solutions.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Here, two matrix iterative methods are proposed to solve general coupled matrix equations, based on Paige's algorithms as the framework. By these new iterative methods, we can get the minimum Frobenius norm constrained solutions, such as symmetric, generalized bisymmetric and (R, S)-symmetric solutions.
Key concepts: Matrix-free methods, Iterative method, Matrix splitting, Matrix (chemical analysis), Symmetric matrix, Matrix norm, Convergent matrix, Applied mathematics