Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1709212 | Applied Mathematics Letters | 2011 | 12 Pages |
Abstract
The generalized singular value decomposition (GSVD) and the lifting technique combined with the Kronecker product are exploited to find reflexive and anti-reflexive (with respect to a generalized {k+1}{k+1}-reflection matrix PP) solutions of the matrix equation AXB=CAXB=C. The computational cost of the presented algorithm is studied and several numerical examples are presented.
Keywords
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
A. Herrero, N. Thome,