An iterative method for the least squares symmetric solution of the linear matrix equation \(AXB = C\) (Q2572054): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 07:36, 5 March 2024

scientific article
Language Label Description Also known as
English
An iterative method for the least squares symmetric solution of the linear matrix equation \(AXB = C\)
scientific article

    Statements

    An iterative method for the least squares symmetric solution of the linear matrix equation \(AXB = C\) (English)
    0 references
    0 references
    14 November 2005
    0 references
    A new iteration method is proposed to solve the minimum Frobenius norm residual problem: \(\min\| AXB- C\|\) with unknown symmetric matrix \(X\). The algorithm is finite with any initial symmetric matrix, and the solution with least norm can be obtained with special selection of the initial symmetric matrix. The algorithm is also used to find the optimal approximation solution to a given matrix. Numerical examples illustrate the methodology.
    0 references
    least-norm solutions
    0 references
    matrix nearness problem
    0 references
    iteration method
    0 references
    minimum Frobenius norm residual problem
    0 references
    algorithm
    0 references
    numerical examples
    0 references

    Identifiers