The nearness problems for symmetric centrosymmetric with a special submatrix constraint

ISSN： 1017-1398

Source： Numerical Algorithms, Vol.55, Iss.1, 2010-09, pp. : 39-57

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

The coupled Sylvester-transpose matrix equations over generalized centro-symmetric matrices

By Beik Fatemeh Panjeh Ali

International Journal of Computer Mathematics, Vol. 90, Iss. 7, 2013-07 ,pp. : 1546-1566

Taylor & Francis Ltd

Access to resources Recommend Favorite

Interval-valued soft constraint problems

By Gelain Mirco

Annals of Mathematics and Artificial Intelligence, Vol. 58, Iss. 3-4, 2010-04 ,pp. : 261-298

Springer Publishing Company

Access to resources Recommend Favorite

An efficient algorithm for the generalized centro-symmetric solution of matrix equation A X B = C

By Liang Mao-lin You Chuan-hua Dai Li-fang

Numerical Algorithms, Vol. 44, Iss. 2, 2007-02 ,pp. : 173-184

Springer Publishing Company

Access to resources Recommend Favorite

Resemblance is a nearness

By Janis V.

Fuzzy Sets and Systems, Vol. 133, Iss. 2, 2003-01 ,pp. : 171-173

Elsevier

Access to resources Recommend Favorite

A note on block diagonal and constraint preconditioners for non-symmetric indefinite linear systems

By Cao Zhi-Hao

International Journal of Computer Mathematics, Vol. 83, Iss. 4, 2006-04 ,pp. : 383-395

Taylor & Francis Ltd

Access to resources Recommend Favorite