A second course in linear algebra that goes beyond the traditional lower-level curriculum is increasingly important for students of the mathematical sciences. Although many applications involve only real numbers, a solid understanding of complex arithmetic often sheds significant light. Many instructors are unaware of the opportunities afforded by…

An involutory matrix is a matrix that is its own inverse. Such matrices are of great importance in matrix theory and algebraic cryptography. In this note, we extend this involution to rhotrices and present their properties. We have also provided a method of constructing involutory rhotrices.

This note explains how Emil Artin's proof that row rank equals column rank for a matrix with entries in a field leads naturally to the formula for the nullity of a matrix and also to an algorithm for solving any system of linear equations in any number of variables. This material could be used in any course on matrix theory or linear algebra.

In this article, we derive one-parameter family of Schroder's method based on Gupta et al.'s (K.C. Gupta, V. Kanwar, and S. Kumar, "A family of ellipse methods for solving non-linear equations", Int. J. Math. Educ. Sci. Technol. 40 (2009), pp. 571-575) family of ellipse methods for the solution of nonlinear equations. Further, we introduce new…

We will prove a well-known theorem in Linear Algebra, that is, for any "m x n" matrix the dimension of row space and column space are the same. The proof is based on the subject of "elementary matrices" and "reduced row-echelon" form of a matrix.

Computing the mean and covariance matrix of some multivariate distributions, in particular, multivariate normal distribution and Wishart distribution are considered in this article. It involves a matrix transformation of the normal random vector into a random vector whose components are independent normal random variables, and then integrating…

The aim of this article is to characterize the 2 x 2 matrices "X" satisfying X[superscript 2] = X + I and obtain some new identities concerning with Fibonacci and Lucas numbers. The recommendations regarding the teaching of the identities given in this article can be presented in two cases. The first is related to the pedagogical aspect. The…

In this note, a method of converting a rhotrix to a special form of matrix termed a "coupled matrix" is proposed. The special matrix can be used to solve various problems involving n x n and (n - 1) x (n - 1) matrices simultaneously.

Using the elementary tools of matrix theory, we show that the product of two rotations in the three-dimensional Euclidean space is a rotation again. For this purpose, three types of rotation matrices are identified which are of simple structure. One of them is the identity matrix, and each of the other two types can be uniquely characterized by…

Synthetic division is viewed as a change of basis for polynomials written under the Newton form. Then, the transition matrices obtained from a sequence of changes of basis are used to factorize the inverse of a bidiagonal matrix or a block bidiagonal matrix.

The problem of estimating the cross-product of two mean vectors in three-dimensional Euclidian space is considered. Two "natural" estimators are developed, both of which turn out to be biased. A third, unbiased estimator, resulting from a jackknife procedure, is also investigated. It is shown that, under normality, the latter is best among all the…

Hill ciphers are linear codes that use as input a "plaintext" vector [p-right arrow above] of size n, which is encrypted with an invertible n x n matrix E to produce a "ciphertext" vector [c-right arrow above] = E [middle dot] [p-right arrow above]. Informally, a near-field is a triple [left angle bracket]N; +, *[right angle bracket] that…

Characteristic polynomials are used to determine when magic squares have magic inverses. A resulting method constructs arbitrary examples of such squares.

Several authors have found many Pythagorean triple preserving matrices in recent years. The purpose of this note is to show that all these matrices, and in particular the results published in Deshpande's 2001 paper are special cases of the earlier results obtained by Palmer, Ahuja and Tikoo.

An easy way to present the uniqueness of the square root of a positive semidefinite matrix is given.