List of numerical analysis topics
Elementary and special functions
Numerical linear algebra
Numerical linear algebra — study of numerical algorithms for linear algebra problems
Basic concepts
- Types of matrices appearing in numerical analysis:
- Algorithms for matrix multiplication:
- Matrix decompositions:
- Matrix splitting — expressing a given matrix as a sum or difference of matrices
Solving systems of linear equations
Eigenvalue algorithms
Eigenvalue algorithm — a numerical algorithm for locating the eigenvalues of a matrix
Other concepts and algorithms
Interpolation and approximation
Interpolation — construct a function going through some given data points
Optimization
Mathematical optimization — algorithm for finding maxima or minima of a given function
Linear programming
Linear programming (also treats integer programming) — objective function and constraints are linear
Nonlinear programming
Nonlinear programming — the most general optimization problem in the usual framework
- Special cases of nonlinear programming:
- General algorithms:
Uncertainty and randomness
Numerical methods for ordinary differential equations
Numerical methods for ordinary differential equations — the numerical solution of ordinary differential equations (ODEs)
- Euler method — the most basic method for solving an ODE
- Explicit and implicit methods — implicit methods need to solve an equation at every step
- Backward Euler method — implicit variant of the Euler method
- Trapezoidal rule — second-order implicit method
- Runge–Kutta methods — one of the two main classes of methods for initial-value problems
- Linear multistep method — the other main class of methods for initial-value problems
- General linear methods — a class of methods encapsulating linear multistep and Runge-Kutta methods
- Bulirsch–Stoer algorithm — combines the midpoint method with Richardson extrapolation to attain arbitrary order
- Exponential integrator — based on splitting ODE in a linear part, which is solved exactly, and a nonlinear part
- Methods designed for the solution of ODEs from classical physics:
- Geometric integrator — a method that preserves some geometric structure of the equation
- Symplectic integrator — a method for the solution of Hamilton's equations that preserves the symplectic structure
- Energy drift — phenomenon that energy, which should be conserved, drifts away due to numerical errors
- Other methods for initial value problems (IVPs):
- Methods for solving two-point boundary value problems (BVPs):
- Methods for solving differential-algebraic equations (DAEs), i.e., ODEs with constraints:
- Methods for solving stochastic differential equations (SDEs):
- Methods for solving integral equations:
- Analysis:
- Stiff equation — roughly, an ODE for which unstable methods need a very short step size, but stable methods do not
- L-stability — method is A-stable and stability function vanishes at infinity
- Adaptive stepsize — automatically changing the step size when that seems advantageous
- Parareal -- a parallel-in-time integration algorithm
Numerical methods for partial differential equations
Numerical partial differential equations — the numerical solution of partial differential equations (PDEs)
Finite difference methods
Finite difference method — based on approximating differential operators with difference operators
Techniques for improving these methods