# Cleve’s Corner: Cleve Moler on Mathematics and ComputingScientific computing, math & more

Posts 11 - 20 of 43

# Three-Term Recurrence Relations and Bessel Functions

Three-term recurrence relations are the basis for computing Bessel functions. Contents A Familiar Three-Term Recurrence Friedrich Bessel Bessel Functions Miller's Algorithm ... 更多内容 >>

# Morse Code, Binary Trees and Graphs6

A binary tree is an elegant way to represent and process Morse code. The new MATLAB graph object provides an elegant way to manipulate binary trees. A new app, morse_tree, based on this approach, is now available in version 2.40 of Cleve's Laboratory.... 更多内容 >>

# Patience Chinese Rings Puzzle

MIT's Professor Daniel Frey recently introduced me to an ancient mechanical puzzle known as "Chinese Rings", "Patience", or "Baguenaudier." I have modified Daniel's simulator to produce a new app. The state space of the puzzle forms a hypercube.... 更多内容 >>

# Ulps Plots Reveal Math Function Accuracy2

"ULP" stands for "unit in the last place." An ulps plot samples a fundamental math function such as $\sin{x}$, or a more esoteric function like a Bessel function. The samples are compared with more accurate values obtained from a higher precision computation. A plot of the accuracy, measured in ulps, reveals valuable information about the underlying algorithms.... 更多内容 >>

# Fitting and Extrapolating US Census Data

A headline in the New York Times at the end of 2016 said "Growth of U.S. Population Is at Slowest Pace Since 1937". This prompted me to revisit an old chestnut about fitting and extrapolating census data. In the process I have added a couple of nonlinear fits, namely the logistic curve and the double exponential Gompertz model.... 更多内容 >>

# Apologies to Gram-Schmidt

This is a follow-up to my previous follow-up, posted several days ago. A very careful reader, Bruno Bazzano, contributed a comment pointing out what he called "a small typo" in my code for the classic Gram-Schmidt algorithm. It is more than a small typo, it is a serious blunder. I must correct the code, then do more careful experiments and reword my conclusions.... 更多内容 >>

# Compare Gram-Schmidt and Householder Orthogonalization Algorithms4

This is a follow-up to my previous post. Classical Gram-Schmidt and Modified Gram-Schmidt are two algorithms for orthogonalizing a set of vectors. Householder elementary reflectors can be used for the same task. The three algorithms have very different roundoff error properties.... 更多内容 >>

# Householder Reflections and the QR Decomposition1

The QR decomposition is often the first step in algorithms for solving many different matrix problems, including linear systems, eigenvalues, and singular values. Householder reflections are the preferred tool for computing the QR decomposition.... 更多内容 >>

# Compare Gram-Schmidt and Householder Orthogonalization Algorithms1

Classical Gram-Schmidt and Modified Gram-Schmidt are two algorithms for orthogonalizing a set of vectors. Householder elementary reflectors can be used for the same task. The three algorithms have very different roundoff error properties…. 更多内容 >>

# The Graeffe Root-Squaring Method for Computing the Zeros of a Polynomial1

At a minisymposium honoring Charlie Van Loan this week during the SIAM Annual Meeting, I will describe several dubious methods for computing the zeros of polynomials. One of the methods is the Graeffe Root-squaring method, which I will demonstrate using my favorite cubic, $x^3-2x-5$.... 更多内容 >>

Posts 11 - 20 of 43