List of numerical analysis topics
From Free net encyclopedia
This is a list of numerical analysis topics, by Wikipedia page.
Contents |
[edit]
General
- Kahan summation algorithm
- Iterative method
- Richardson extrapolation
- Evaluation of polynomials:
- Evaluation of special functions:
- Level set method
- Abramowitz and Stegun
- Curse of dimensionality
- Superconvergence
- Termination
- Discretization
- Difference quotient
[edit]
Error
- Approximation
- Condition number
- Numerical stability
- Well-posed problem
- Significant figures
- Loss of significance
- Propagation of errors resulting from algebraic manipulations
- Precision (arithmetic)
- Hilbert matrix
- Floating point number
- Truncation
- Round-off error
- Discretization error
- Approximation error
- Percent error
[edit]
Numerical linear algebra
- Types of matrices appearing in numerical analysis:
- Algorithms for matrix multiplication:
- Solving a system of linear equations:
- Eigenvalue algorithms:
- Orthogonalization:
- QR decomposition
- Krylov subspace
[edit]
Interpolation
- Nearest Neighbor Interpolation
- Polynomial interpolation
- Linear interpolation
- Runge's phenomenon
- Vandermonde matrix
- Chebyshev polynomials
- Chebyshev nodes
- Lebesgue constant (interpolation)
- Different forms for the interpolant:
- Extensions to multiple dimensions:
- Hermite interpolation
- Birkhoff interpolation
- Spline interpolation
- Slerp
- Wavelet
- Inverse distance weighting
- Trigonometric interpolation
- Irrational base discrete weighted transform
- Pareto interpolation
- Extrapolation
- Regression analysis
- Approximation theory
- Orders of approximation
- Lebesgue's lemma
- Curve fitting
- Different approximations:
- Curve-fitting compaction
[edit]
Finding roots of equations
- General methods:
- Methods for polynomials:
- Methods for other special cases:
- Analysis:
[edit]
Optimization
- Concepts:
- Continuous optimization
- Linear programming (also treats integer programming)
- Quadratic programming
- Convex optimization
- Nonlinear programming
- Combinatorial optimization
- Stochastic programming
- Dynamic programming
- Global optimization:
- Random optimization algorithms:
- Simulated annealing
- Evolutionary algorithm
- Genetic algorithm, genetic programming
- Particle swarm optimization
- Stochastic tunneling
- see also the section Monte Carlo method
- Infinite-dimensional optimization
- Optimal substructure
- Theoretical aspects:
- Applications:
[edit]
Numerical integration
- Trapezium rule
- Simpson's rule
- Newton-Cotes formulas
- Gaussian quadrature
- Romberg's method
- Sparse grid
- Numerical differentiation
- Euler-Maclaurin formula
[edit]
Numerical ordinary differential equations
Numerical ordinary differential equations — the numerical solution of ordinary differential equations (ODEs)
- Euler integration — the most basic method for solving an ODE
- Explicit and implicit methods — implicit methods need to solve an equation at every step
- Runge-Kutta methods — one of the two main classes of methods for initial value problems
- Midpoint method — a second-order method with two stages
- Multistep method — the other main class of methods for initial value problems
- Methods designed for the solution of ODEs from classical physics:
- Newmark-beta method — based on the extended mean value theorem
- Verlet integration — a popular second-order method
- Beeman's algorithm — a two-step method extending the Verlet method
- 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
- Stiff equation — roughly, an ODE for which the unstable methods needs a very short step size, but stable methods do not.
- Shooting method — a method for the solution of boundary value problems
[edit]
Numerical partial differential equations
Numerical partial differential equations — the numerical solution of partial differential equations (PDEs)
- Methods for the solution of PDEs:
- Finite difference method — based on approximating differential operators with difference operators
- Discrete Laplace operator — finite-difference approximation of the Laplace operator
- Crank-Nicolson method — second-order method for heat and related PDEs
- Finite element method, finite element analysis — based on a discretization of the space of solutions
- Finite element method in structural mechanics — a physical approach to finite element methods
- Galerkin method — a finite element method in which the residual is orthogonal to the finite element space
- Rayleigh-Ritz method — a finite element method based on variational principles
- Direct stiffness method — a particular implementation of the finite element method, often used in structural analysis
- Spectral method — based on the Fourier transformation
- Boundary element method — based on transforming the PDE to an integral equation on the boundary of the domain
- Analytic element method — similar to the boundary element method, but the integral equation is evaluated analytically
- Finite volume method — based on dividing the domain in many small domains; popular in computational fluid dynamics
- Discrete element method — a method in which the elements can move freely relative to each other
- Uniform theory of diffraction — specifically designed for scatting problems in electromagnetics.
- Finite difference method — based on approximating differential operators with difference operators
- Techniques for improving these methods:
- Multigrid, multigrid method — uses a hierarchy of nested meshes to speed up the methods
- Domain decomposition method — divides the domain in a few subdomains and solves the PDE on these subdomains
- Adaptive mesh refinement — uses the computed solution to refine the mesh only where necessary
- Broad classes of methods:
- Mimetic methods — methods that respect in some sense the structure of the original problem
- Multiphysics — models consisting of various submodels with different physics
- Analysis:
- Courant–Friedrichs–Lewy condition — stability condition for hyperbolic PDEs
- Numerical diffusion — diffusion introduced by the numerical method, above to that which is naturally present
- Numerical resistivity — the same, with resistivity instead of diffusion
- Weak formulation — a functional-analytic reformulation of the PDE necessary for some methods
[edit]
Monte Carlo method
- Variants of the Monte Carlo method:
- Box-Muller transform
- Low-discrepancy sequence
- Parallel tempering
- Techniques for reducing the variance:
- Applications:
- Also see the list of statistics topics
[edit]
Applications
[edit]
Software
- See also: List of numerical analysis software
- Libraries:
- Languages:
- Programs: