On computing complex square roots of real matrices
- Liu, Zhongyun
- Zhang, Yulin
- Santos, Jorge
- Ralha, Rui
DOIAbstract
AbstractWe present an idea for computing complex square roots of matrices using only real arithmetic
AbstractWe present an idea for computing complex square roots of matrices using only real arithmetic
AbstractBased on the generalized continued-fraction method for finding the nth roots of real numbers...
We know that square of a real number is always non-negative e.g. and . Therefore, square root of ...
We use the Cayley-Hamilton method to find all four square roots of a given 2 by 2 matrix
Abstract: We present an idea for computing complex square roots of matrices using only real arithmet...
Björck and Hammarling [1] describe a fast, stable Schur method for computing a square root X of a ma...
AbstractBjörck and Hammarling [1] describe a fast, stable Schur method for computing a square root X...
AbstractWe present an idea for computing complex square roots of matrices using only real arithmetic
AbstractIn this paper higher order convergent methods for computing square roots of nonsingular comp...
We show how complex number arithmetic can be performed using matrices for the complex numbers
AbstractAn algorithm for computing the roots of a matrix with real elements and the real part of the...
It is known that every polynomial with complex coefficients has a complex root. This is called “The ...
In this article, the author investigates the real 2 x 2 matrices which admit real square roots
This book is dedicated to descript the Complex Numbers Square-Rooting Unit. In this book a little-kn...
This thesis is based of the article entitled On Square-Rooting Matrices by Nigel H. Scott [14]. It i...
summary:The paper is devoted to an algorithm for computing matrices $A^r$ and $(A^r -I).(A-I)^{-1}$ ...
AbstractBased on the generalized continued-fraction method for finding the nth roots of real numbers...
We know that square of a real number is always non-negative e.g. and . Therefore, square root of ...
We use the Cayley-Hamilton method to find all four square roots of a given 2 by 2 matrix
Abstract: We present an idea for computing complex square roots of matrices using only real arithmet...
Björck and Hammarling [1] describe a fast, stable Schur method for computing a square root X of a ma...
AbstractBjörck and Hammarling [1] describe a fast, stable Schur method for computing a square root X...
AbstractWe present an idea for computing complex square roots of matrices using only real arithmetic
AbstractIn this paper higher order convergent methods for computing square roots of nonsingular comp...
We show how complex number arithmetic can be performed using matrices for the complex numbers
AbstractAn algorithm for computing the roots of a matrix with real elements and the real part of the...
It is known that every polynomial with complex coefficients has a complex root. This is called “The ...
In this article, the author investigates the real 2 x 2 matrices which admit real square roots
This book is dedicated to descript the Complex Numbers Square-Rooting Unit. In this book a little-kn...
This thesis is based of the article entitled On Square-Rooting Matrices by Nigel H. Scott [14]. It i...
summary:The paper is devoted to an algorithm for computing matrices $A^r$ and $(A^r -I).(A-I)^{-1}$ ...
AbstractBased on the generalized continued-fraction method for finding the nth roots of real numbers...
We know that square of a real number is always non-negative e.g. and . Therefore, square root of ...
We use the Cayley-Hamilton method to find all four square roots of a given 2 by 2 matrix
Add to ORKG