A binary powering Schur algorithm for computing primary matrix roots

ISSN： 1017-1398

Source： Numerical Algorithms, Vol.55, Iss.1, 2010-09, pp. : 59-78

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

On an unknown algorithm for computing square roots

By Eisenberg T.

International Journal of Mathematical Education in Science and Technology, Vol. 34, Iss. 1, 2003-01 ,pp. : 153-158

Taylor & Francis Ltd

Access to resources Recommend Favorite

An efficient algorithm for computing the roots of general quadratic, cubic and quartic equations

By Mahmood Munir Hammad Sali Mahmood Ibtihal

International Journal of Mathematical Education in Science and Technology, Vol. 45, Iss. 7, 2014-10 ,pp. : 1095-1103

Taylor & Francis Ltd

Access to resources Recommend Favorite

An optimal algorithm for computing the max-min transitive closure of a fuzzy similarity matrix

By Lee H.-S.

Fuzzy Sets and Systems, Vol. 123, Iss. 1, 2001-10 ,pp. : 129-136

Elsevier

Access to resources Recommend Favorite

A new framework for implicit restarting of the Krylov–Schur algorithm

NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS (ELECTRONIC), Vol. 22, Iss. 2, 2015-03 ,pp. : 220-232

John Wiley & Sons Inc

Access to resources Recommend Favorite

An algorithm for computing positive definite solutions of the nonlinear matrix equation X + A * X -1 A = I

By El-Sayed S.

International Journal of Computer Mathematics, Vol. 80, Iss. 12, 2003-12 ,pp. : 1527-1534

Taylor & Francis Ltd

Access to resources Recommend Favorite