X-Nico

unusual facts about Linear algebra


Canyon Crest Academy

In addition to AP Calculus AB and AP Calculus BC, CCA offers Calculus III and Linear algebra on campus through San Diego State University's College of Extended Studies.


Bard High School Early College

BHSEC's college program offers classes that are more specialized than in the high school program, such as Linear Algebra, Reason and Politics, Novels of Dostoyevsky, Philosophy of Religion, Physics of Sound and Music, The Social Contract and Its Critics, and Culture and History of Food.

Coppersmith–Winograd algorithm

In linear algebra, the Coppersmith–Winograd algorithm, named after Don Coppersmith and Shmuel Winograd, was the asymptotically fastest known algorithm for square matrix multiplication until 2010.

Lewis Carroll identity

In linear algebra, the Lewis Carroll identity is an identity involving minors of a square matrix proved by Charles Lutwidge Dodgson (better known by his pseudonym Lewis Carroll), who used it in a method of numerical evaluation of matrix determinants called the Dodgson condensation.

Moore method

Professor David W. Cohen of Smith College implemented a modified Moore method for courses in Infinite-dimensional Linear Algebra and Real Analysis.

Norman Arthur Wiegmann

Norman Arthur Wiegmann (13 April 1920–14 November 2001) was a mathematician specializing in modern algebra, in particular linear algebra and matrix theory, who spent a major part of his career teaching at the George Washington University and other universities.

Numerical Recipes

The Numerical Recipes books cover a range of topics that include both classical numerical analysis (interpolation, integration, linear algebra, differential equations, and so on), signal processing (Fourier methods, filtering), statistical treatment of data, and a few topics in machine learning (hidden Markov models, support vector machines).

Rouché–Capelli theorem

RouchéCapelli theorem is the theorem in linear algebra that allows computing the number of solutions in a system of linear equations given the ranks of its augmented matrix and coefficient matrix.

Stéphane Mallat

Specifically, he collaborated with Yves Meyer to develop the Multiresolution Analysis (MRA) construction for compactly supported wavelets, which made the implementation of wavelets practical for engineering applications by demonstrating the equivalence of wavelet bases and conjugate mirror filters used in discrete, multirate filter banks in signal processing.

Toeplitz matrix

In linear algebra, a Toeplitz matrix or diagonal-constant matrix, named after Otto Toeplitz, is a matrix in which each descending diagonal from left to right is constant.

Zorn's lemma

It occurs in the proofs of several theorems of crucial importance, for instance the Hahn–Banach theorem in functional analysis, the theorem that every vector space has a basis, Tychonoff's theorem in topology stating that every product of compact spaces is compact, and the theorems in abstract algebra that every nonzero ring has a maximal ideal and that every field has an algebraic closure.


see also

Alan Edelman

He has received numerous awards, among them the Gordon Bell Prize and Householder Prize (1990), the Chauvenet Prize (1998), the Edgerly Science Partnership Award (1999), the SIAM Activity Group on Linear Algebra Prize (2000), and the Lester R. Ford Award, (2005, with Gilbert Strang).

Garrett Birkhoff

Birkhoff's research and consulting work (notably for General Motors) developed computational methods besides numerical linear algebra, notably the representation of smooth curves via cubic splines.

Miloš Zahradník

He is also known for the book We Grow Linear Algebra (in Czech) that he wrote with Luboš Motl.

Multilateration

There are many robust linear algebra methods that can solve for the values of (x,y,z), such as Gaussian Elimination.