In application-oriented mathematics, particularly in the context of nonlinear system analysis, phase plane analysis through SageMath offers a visual display of the qualitative behaviour of solutions to differential equations without inundating students with cumbersome calculations of the plane-phase. A variety of examples is usually given to…

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…

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 numerical range, easy to understand but often tedious to compute, provides useful information about a matrix. Here we describe the numerical range of a 3 x 3 magic square. Applying our results to one of the most famous of those squares, the Luoshu, it turns out that its numerical range is a piece of cake--almost.

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…

We examine a generalization of the one-dimensional Ising model involving interactions among neighbourhoods of "k" adjacent spins. The model is solved by exploiting a connection to an interesting computational problem that we call ""k"-SAT on a ring", and is shown to be equivalent to the nearest-neighbour Ising model in the absence of an external…

A continuous representation of a hybrid method with three "off-step" points is developed via interpolation and collocation procedures, and used to obtain initial value methods (IVMs) for solving initial value problems. The IVMs are assembled into a single block matrix equation which is convergent and A-stable. We note that accuracy is improved by…

This article is concerned with how computer science, and more exactly computational complexity theory, can inform cognitive science. In particular, we suggest factors to be taken into account when investigating how people deal with computational hardness. This discussion will address the two upper levels of Marr's Level Theory: the computational…

The Lithuanian Informatics Olympiad is a problem solving contest for high school students. The work of each contestant is evaluated in terms of several criteria, where each criterion is measured according to its own scale (but the same scale for each contestant). Several jury members are involved in the evaluation. This paper analyses the problem…

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…

Charles Dodgson (Lewis Carroll) discovered a "curious" method for computing determinants. It is an iterative process that uses determinants of 2 x 2 submatrices of a matrix to obtain a smaller matrix. When the process ends, the result is the determinant of the original matrix. This article discusses both the algorithm and what may have led Dodgson…

This article describes the sequence alignment problem in bioinformatics. Through examples, we formulate sequence alignment as an optimization problem and show how to compute the optimal alignment with dynamic programming. The examples and sample exercises have been used by the author in a specialized course in bioinformatics, but could be adapted…

This article shows how to use six parameters describing the International Space Station's orbit to predict when and in what part of the sky observers can look for the station as it passes over their location. The method requires only a good background in trigonometry and some familiarity with elementary vector and matrix operations. An included…

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

A game is presented in which computation by a stepping-stone method is used to solve minimax problems. An additional application of this game is used for finding the Pearson correlation coefficient by non-parametric techniques. The game provides considerable computational practice as well as a motivational problem solving situation. (JP)