# Computational mathematics

There have been 4 topic suggestions tagged with computational mathematics.

## Talk Suggestions

### Complexity of Matrix Multiplication

Volker Strassen showed that $n^3$ matrix multiplication was not optimal in 1969. Since then, new algorithms such as Coppersmith-Winograd have further improved the time complexity of matrix multiplication. It is conjectured that matrix multiplication is possible in $O(n^{2+ɛ})$ for any $ɛ>0$, however small. This is one of the few remaining open problems in finite-dimensional linear algebra.

Possible reference materials for this topic include

Quick links: Google search, arXiv.org search, propose to present a talk

### Gillespie Algorithm

The Gillespie Algorithm for stochastic equations is used heavily in a number of fields of applied mathematics, in particular computational systems biology.

Possible reference materials for this topic include

Quick links: Google search, arXiv.org search, propose to present a talk

### IEEE 754-2008: Floating Point Arithmetic

Most programming languages provide a floating-point type. What is floating point, and how does it work? What caveats should programmers be aware of?

Possible reference materials for this topic include

Quick links: Google search, arXiv.org search, propose to present a talk

### Sparse Matrices

Sparse matrices are frequently used in scientific and numerical computation. How do they work? What new findings have there been? Speakers are encouraged to specialize this broad topic to a particular subfield of interest.

Possible reference materials for this topic include

Quick links: Google search, arXiv.org search, propose to present a talk