This study proposes transformation functions and matrices between coefficients in the original and reparameterized parameter spaces for an existing linear-linear piecewise model to derive the interpretable coefficients directly related to the underlying change pattern. Additionally, the study extends the existing model to allow individual…

In this article, we show a "very" simple algorithm for the evaluation of the character tables applicable to all finite point groups. The method uses linear combinations of the symmetry operators associated with the point group's classes as the basis set. Eigenvectors of the resulting matrix of such representations are related to the…

Virtual resources team up to create a computational grid, which is used in computation-intensive problem solving. A majority of these problems require high performance resources to compute and generate results, making grid computation another type of high performance computing. The optimization in computational grids relates to resource…

In any procedural mathematical situation, there are multiple ways of achieving the same answer. Given this observation, we ask, why choose one procedural solution over another? We address this question here with data drawn from interviews conducted with university students engaged in row-reducing matrices. During their tasks, the students voiced a…

We present an algorithm for a matrix-based Enigma-type encoder based on a variation of the Hill Cipher as an application of 2 × 2 matrices. In particular, students will use vector addition and 2 × 2 matrix multiplication by column vectors to simulate a matrix version of the German Enigma Encoding Machine as a basic example of cryptography. The…

Given three planes in space, a complete characterization of their intersection is provided. Special attention is paid to the case when the intersection set does not exist of one point only. Besides the vector cross product, the tool of generalized inverse of a matrix is used extensively.

We present a short-term class project used in an introductory linear algebra course, designed to engage students in matrix algebra. In this activity, students responded to a survey of their pop culture tastes. Using the survey responses, they worked to design a series of matching algorithms, using matrices, with the goal of matching the students…

In recent years, substantial improvements were obtained in the effectiveness of data driven algorithms to validate the mapping of items to skills, or the Q-matrix. In the current study we use ensemble algorithms on top of existing Q-matrix refinement algorithms to improve their performance. We combine the boosting technique with a decision tree.…

This article aims to illustrate a process of making connections, not between mathematics and other activities, but within mathematics itself--between diverse parts of the subject. Novel connections are still possible in previously explored mathematics when the material happens to be unfamiliar, as may be the case for a learner at any career stage.…

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…

The aim of this paper is to describe the innovative teaching approach used in the Southern Federal University, Russia, to teach accounting via a form of matrix mathematics. It thereby contributes to disseminating the technique of teaching to solve accounting cases using mutual calculations to a worldwide audience. The approach taken in this course…

Rubin and Thayer ("Psychometrika," 47:69-76, 1982) proposed the EM algorithm for exploratory and confirmatory maximum likelihood factor analysis. In this paper, we prove the following fact: the EM algorithm always gives a proper solution with positive unique variances and factor correlations with absolute values that do not exceed one,…

Machine Learning methods for Performance Prediction in Intelligent Tutoring Systems (ITS) have proven their efficacy; specific methods, e.g. Matrix Factorization (MF), however suffer from the lack of available information about new tasks or new students. In this paper we show how this problem could be solved by applying Transfer Learning (TL),…

Slater type orbitals were used to construct the overlap and the Hamiltonian core matrices; we also found the values of the bi-electron repulsion integrals. The Hartree Fock Roothaan approximation process starts with setting an initial guess value for the elements of the density matrix; with these matrices we constructed the initial Fock matrix.…

In Ramsay curve item response theory (RC-IRT) modeling, the shape of the latent trait distribution is estimated simultaneously with the item parameters. In its original implementation, RC-IRT is estimated via Bock and Aitkin's EM algorithm, which yields maximum marginal likelihood estimates. This method, however, does not produce the…