Hostname: page-component-78c5997874-4rdpn Total loading time: 0 Render date: 2024-11-11T08:08:59.570Z Has data issue: false hasContentIssue false
  • English
  • Français

On square-rooting matrices

Published online by Cambridge University Press:  01 August 2016

Nigel H. Scott
Nigel H. Scott*
Affiliation:
School of Mathematics, University of East Anglia, Norwich NR4 7TJ
Get access Rights & Permissions [Opens in a new window]

Extract

Following on from Nick MacKinnon’s work in the June 1989 Gazette concerning four different methods of square-rooting 2 × 2 matrices, we may ask if it is possible to compute all the square roots of any given 2 × 2 matrix, and if so, how? From now on by a “matrix” we mean a real or complex 2 ×2 matrix. We know that every non-zero number has precisely two square roots, but the situation is rather more complicated for matrices. In fact we shall see that the zero matrix and any other multiple of the identity matrix has an infinite number of square roots. All other matrices have only a finite number of square roots, with some (rather surprisingly) having none at all! Our method of enquiry is based on Nick MacKinnon's first method, namely matrix diagonalisation.

Type
Research Article
Information
The Mathematical Gazette , Volume 74 , Issue 468 , June 1990 , pp. 111 - 114
Copyright
Copyright © The Mathematical Association 1990

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)