*Note: This course discription is only applicable to the Computer Science Post-Baccalaureate program. Additionally, students must always refer to course syllabus for the most up to date information.

We consider a class of iterative algorithms for solving systems of linear equations where the coefficient matrix is nonsymmetric with positive-definite symmetric part. The algorithms are modelled ...

It’s the sort of easy maths problem that you can work out in a few minutes using pencil and paper, but physicists in China, Canada and Singapore have now solved pairs of linear equations like this one ...

*Please note this will be a 0 credit 3-week course during the weeks of May 1-17. This course does not fulfill the Technical Elective area.

Introduces ordinary differential equations, systems of linear equations, matrices, determinants, vector spaces, linear transformations, and systems of linear differential equations. Prereq., APPM 1360 ...

The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the literature of a ...

Elementary set theory and solution sets of systems of linear equations. An introduction to proofs and the axiomatic methods through a study of the vector space axioms. Linear analytic geometry. Linear ...