Accelerating the pace of engineering and science

Cleve's Corner Collection

Matters of mathematical curiosity discussed by MathWorks Co-Founder and Chief Scientist Cleve Moler.


Article Published
This article shows how Alan Turing’s work on the mathematics of cryptography and matrix computation became the theoretical basis for modern computers and a formative influence on MATLAB.
okt 2015
Using a matrix from the MATLAB Gallery collection as an example, this article discusses three variants of the QR algorithm available in MATLAB.
aug 2014
From 1961 to the present, the Gatlinburg and Householder symposia on numerical computing have played an important role in the history and development of MATLAB.
okt 2013
Cleve Moler presents MATLAB code for simulating basic strategy, and explains why simulating blackjack play in MATLAB is both an instructive programming exercise and a useful parallel computing benchmark.
okt 2012
MATLAB implementations of the three algorithms most widely used to compute hundreds or trillions of digits of π.
okt 2011
Cleve Moler demonstrates the MATLAB matrix computation underlying compressed sensing.
okt 2010
Cleve Moler discusses solving sudoku puzzles with MATLAB.
nov 2009
Free, online book for educators and high-school students looking for material that goes beyond the standard courses.
sep 2008
The proliferation of multicore systems and clusters sets the stage for parallel computing with MATLAB.
jun 2007
Dr. Gene Golub has made the singular value decomposition one of the most powerful and widely used tools in modern matrix computation.
okt 2006
Cleve Moler recounts milestones in MathWorks history and the development of MATLAB.
jan 2006
Cleve Moler describes his inspiration for authoring MATLAB.
dec 2004
New textbook available in electronic and print editions.
jun 2004
We hope you’ve seen it many times. It’s on the covers of our books. It’s on our business cards and stationery. It’s even on a “sponsor a highway” sign on Route 9 in Natick,Massachusetts. But, do you really know what the logo is?
nov 2003
Cleve Moler explains the mathematical underpinnings of the MathWorks logo, the L-shaped membrane.
nov 2003
Stiffness is a subtle, difficult, and important - concept in the numerical solution of ordinary differential equations.
mei 2003
Google's PageRank is an eigenvector of a matrix of order 2.7 billion.
okt 2002
MATLAB's special mathematical functions rely on skills from another era.
feb 2002
Ziggurat algorithm generates normally distributed random numbers.
mei 2001
We all use FFT s every day without even thinking about it.
jan 2001
Increasing the speed and capabilities of matrix computation.
jan 2000
Optimization Toolbox features new methods for large-scale problems.
jul 1999
Cleve Moler introduces MATLAB objects and two early examples of object use in MATLAB.
jan 1999
Cleve Moler explains inverse, complex, hyperbolic, floating-point trigonometric functions in MATLAB.
jul 1998
Supplement to the Cleve's Corner article, "Trigonometry is a Complex Subject."
jul 1998
Eigshow helps explain eigenvalues and singular values.
jan 1998
Cleve Moler describes the advantages that the new stopping functions, g-stops, have over tf values in the ordinary differential equation solvers available in MATLAB 5 and Simulink 2.
sep 1997
Cleve Moler explains the benefits and drawbacks of using floating-point numbers.
okt 1996
Cleve Moler explains how the MATLAB compiler can speed mathematical computations by compiling function M-files.
mrt 1996
Cleve Moler recounts the people and events that led to mainstream awareness of the Pentium FDIV bug, his own role in that process, and the mathematical basis for the problem.
dec 1995
Cleve Moler covers random number generation and explains why the rand function in MATLAB 5.0 was updated.
okt 1995
Cleve Moler explores the QR algorithm and its MATLAB implementation.
jul 1995
Cleve Moler explains why there was skepticism about the viability of running MATLAB on parallel computers in 1995.
mei 1995
Cleve Moler takes an early look at symbolic computation in MATLAB.
dec 1994
Cleve Moler discusses LINPACK and five other benchmarks used to gauge computational performance and megaflops in 1994.
aug 1994
Cleve Moler explores the Jordan Canonical Form (JCF) and its extreme sensitivity to perturbation.
mei 1994
Cleve Moler explains the relevance of magic squares in modern mathematics, using them to explain features of MATLAB and illustrate concepts from linear algebra.
dec 1993
Cleve Moler recalls the Fortran List Oriented Package (FLOP) symbolic mathematical computation system and recounts the origins of Symbolic Math Toolbox.
jul 1993
Cleve Moler explores the mathematics behind matrix exponential, matrix logarithm, and matrix square root functions and their inverses in MATLAB.
mei 1993
Cleve Moler explains the behavior of the finite Fourier transform and the fast finite Fourier transform algorithms implemented in MATLAB in 1992.
mei 1992
Cleve Moler explains why the roots1 function was removed from MATLAB.
mei 1991
Cleve Moler presents solutions to an ill-defined mathematical problem.
dec 1990
Cleve Moler explores the concepts of extended precision and double-rounding in numeric computations.
apr 1990

Cleve's Corner Blog

Numerical Computing with MATLAB

Learn more

Experiments with MATLAB

Learn more