Dubrulle Creates A Faster Tridiagonal QR Algorithm
- Category:
- Algorithms,
- History,
- Matrices,
- Numerical Analysis,
- People
This is the second of a multi-part series about the MATLAB random number generators. If you ask for help rng, you will get lots of information, including the fact that there are three modern generators.... read more >>
This is the first of a multi-part series about the MATLAB random number generators.... read more >>
Single and double precision are combined to facilitate a triple precision accumulated inner product.... read more >>
Iterative refinement is a technique introduced by Wilkinson for reducing the roundoff error produced during the solution of simultaneous linear equations. Higher precision arithmetic is required for the calculation of the residuals.... read more >>
This is the second in a series of three posts about the Finite Fourier Transform. This post is about the fast FFT algorithm itself. A recursive divide and conquer algorithm is implemented in an elegant MATLAB function named ffttx.... read more >>
Complex step differentiation is a technique that employs complex arithmetic to obtain the numerical value of the first derivative of a real valued analytic function of a real variable, avoiding the loss of precision inherent in traditional finite differences.... read more >>
The Lambert W function deserves to be better known. It pops up in all sorts of places. And our MATLAB function for evaluating the function is a beautiful use of the Halley method.... read more >>