A new method for the bisymmetric minimum norm solution of the consistent matrix equations \(A_1XB_1 = C_1\), \(A_2XB_2 = C_2\) (Q2375407): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1155/2013/125687 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2051918761 / rank | |||
Normal rank | |||
Revision as of 00:58, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new method for the bisymmetric minimum norm solution of the consistent matrix equations \(A_1XB_1 = C_1\), \(A_2XB_2 = C_2\) |
scientific article |
Statements
A new method for the bisymmetric minimum norm solution of the consistent matrix equations \(A_1XB_1 = C_1\), \(A_2XB_2 = C_2\) (English)
0 references
14 June 2013
0 references
Summary: We propose a new iterative method to find the bisymmetric minimum norm solution of a pair of consistent matrix equations \(A_1XB_1 = C_1\), \(A_2XB_2 = C_2\). The algorithm can obtain the bisymmetric solution with minimum Frobenius norm in finite iteration steps in the absence of round-off errors. Our algorithm is faster and more stable than Algorithm 2.1 by \textit{J. Cai} et al. [Int. J. Comput. Math. 87, No. 12, 2706--2715 (2010; Zbl 1202.65052)].
0 references
