Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.

A New Method for the Bisymmetric Minimum Norm Solution of the Consistent Matrix Equations A1XB1=C1, A2XB2=C2

Abstract

We propose a new iterative method to find the bisymmetric minimum norm solution of a pair of consistent matrix equations A1XB1=C1, A2XB2=C2. 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 Cai et al. (2010)

Similar works

Full text

thumbnail-image

Directory of Open Access Journals

redirect
Last time updated on 17/12/2014

This paper was published in Directory of Open Access Journals.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.