Efficient visualizations of computational algorithms are important tools for students, educators, and researchers. In this article, we point out an innovative visualization technique for matrix multiplication. This method differs from the standard, formal approach by using block matrices to make computations more visual. We find this method a…

In this paper, we reconstruct matrices from their minors, and give explicit formulas for the reconstruction of matrices of orders 2 × 3, 2 × 4, 2 × n, 3 × 6 and m × n. We also formulate the Plücker relations, which are the conditions of the existence of a matrix related to its given minors.

Usually a student learns to solve a system of linear equations in two ways: "substitution" and "elimination." While the two methods will of course lead to the same answer they are considered different because the thinking process is different. In this paper the author solves a system in these two ways to demonstrate the…

This study is part of ongoing research in undergraduate mathematics education. The study was guided by the belief that understanding the mental constructions the pre-service teachers make when learning matrix algebra concepts leads to improved instructional methods. In this preliminary study the data was collected from 85 pre-service teachers…

In large-scale educational surveys, a latent regression model is used to compensate for the shortage of cognitive information. Conventionally, the covariates in the latent regression model are principal components extracted from background data. This operational method has several important disadvantages, such as the handling of missing data and…

This thesis investigates and develops a few acceleration techniques for the search engine algorithms used in PageRank and HITS computations. PageRank and HITS methods are two highly successful applications of modern Linear Algebra in computer science and engineering. They constitute the essential technologies accounted for the immense growth and…

The Hill cipher is the simplest example of a "block cipher," which takes a block of plaintext as input, and returns a block of ciphertext as output. Although it is insecure by modern standards, its simplicity means that it is well suited for the teaching of such concepts as encryption modes, and properties of cryptographic hash functions. Although…

Second-order latent growth curve models (S. C. Duncan & Duncan, 1996; McArdle, 1988) can be used to study group differences in change in latent constructs. We give exact formulas for the covariance matrix of the parameter estimates and an algebraic expression for the estimation of slope differences. Formulas for calculations of the required sample…

In this paper "Derive" functions are provided for the computation of the Moore-Penrose inverse of a matrix, as well as for solving systems of linear equations by means of the Moore-Penrose inverse. Making it possible to compute the Moore-Penrose inverse easily with one of the most commonly used Computer Algebra Systems--and to have the blueprint…

Benford's law of the "first digits" states that in spite of intuitively expected equal frequency of 1/9 of the decimal digits r = 1, ... , 9 appearance on the first place of any number, various empirical studies show another pattern of these frequencies distribution, which is log[subscript 10](1 + 1/r). The article considers this law and other…

In this article we provide two detailed examples of how we incorporate biological examples into two mathematics courses: Linear Algebra and Ordinary Differential Equations. We use Leslie matrix models to demonstrate the biological properties of eigenvalues and eigenvectors. For Ordinary Differential Equations, we show how using a logistic growth…

The matrix diagonalization method is used to solve a limit problem.

A lively example to use in a first course in linear algebra to clarify vector space notions is the space of square matrices of fixed order with its subspaces of affine, coaffine, doubly affine, and magic squares. In this note, the projection theorem is illustrated by explicitly constructing the orthogonal projections (in closed forms) of any…

Presents two papers commenting on previous published articles. Discusses formulas related to the determinants of sums and tests the formulas using some examples. Provides three special cases of the determinants of sums. (YP)

Chio's method of evaluating determinants by successive reduction of size is explained. (MN)