Numerical analysis
583 ideas in this subject. The map below lists the main ideas of the subject by area, in teaching order. 221 of its 240 ideas have a page so far.
Start here
- ConceptCondition number
A condition number measures how much the output of a problem can change, relative to the size of a small relative change in its input. For an invertible matrix and a matrix norm, it is . It bounds the relative error in the solution of caused by a relative error in . A problem with a large condition number is ill-conditioned: rounding errors in the data can be strongly amplified, whatever algorithm is used.
- ConceptNumerical analysis
Numerical analysis is the study of algorithms that compute approximate solutions to problems of continuous mathematics. It designs methods for tasks such as solving equations, computing integrals, finding eigenvalues and solving differential equations. It also proves how large the error of such a method can be, and how fast the method converges. Two typical sources of error are the truncation error of a finite method and the round-off error of floating-point arithmetic.
- ConceptFloating-point arithmetic
Floating-point arithmetic is the way computers represent real numbers and compute with them. A floating-point number is a fixed number of significant digits times a power of a base, such as . The result of each operation is rounded to a nearby floating-point number, so most computations carry a small round-off error. Its relative precision is measured by the machine epsilon, and the IEEE 754 standard fixes the formats used in practice.
- ConceptIEEE 754 standard
IEEE 754 is the technical standard for floating-point arithmetic used by almost all modern processors. It fixes the binary formats, such as single precision and double precision, and how their bits encode sign, exponent and significand. It requires the basic operations to be correctly rounded, and it defines special values: signed zeros, infinities, NaN and subnormal numbers. Because of it, the same floating-point program gives the same results on different machines, which makes error analysis portable.
- ConceptMachine epsilon
Machine epsilon measures the relative precision of a system of floating-point arithmetic. It is the gap between and the next larger floating-point number, or, in another common convention, half of this gap. The half-gap, called the unit roundoff, bounds the relative error of rounding a real number to the nearest floating-point number. Almost every error bound in numerical analysis is stated in terms of it.
- ConceptUnit in the last place
The unit in the last place, or ulp, of a floating-point number is the value of its last significant digit position. It is the spacing between neighbouring floating-point numbers at that size. Errors of computed results are often stated in ulps. For example, a result correctly rounded to nearest is within half an ulp of the exact value. The ulp of is the machine epsilon.
Map of the subject
Basic notions and error analysis 20 of 20
- Condition number definition
- Numerical analysis concept
- Floating-point arithmetic definition
- IEEE 754 standard definition
- Machine epsilon definition
- Unit in the last place definition
- Subnormal number definition
- Rounding concept
- Round-off error concept
- Truncation error concept
- Catastrophic cancellation concept
- Numerical stability concept
- Backward error analysis concept
- Propagation of uncertainty concept
- Kahan summation algorithm statement
- Pairwise summation statement
- Arbitrary-precision arithmetic concept
- Affine arithmetic concept
- Validated numerics concept
- Wilkinson's polynomial example
Nonlinear equations 23 of 27
- Newton's method statement
- fixed-point iteration statement
- Aitken's delta-squared process statement
- Shanks transformation statement
- Root-finding algorithm concept
- Bisection method statement
- Regula falsi statement
- Secant method statement
- Superlinear convergence of the secant method statement
- Quadratic convergence of Newton's method statement
- Halley's method statement
- Householder's method statement
- Steffensen's method statement
- Inverse quadratic interpolation statement
- Brent's method statement
- Ridders' method statement
- Muller's method statement
- Laguerre's method statement
- Durand–Kerner method statement
- Aberth method statement
- Jenkins–Traub algorithm statement
- Bairstow's method statement
- Graeffe's method statement
- Splitting circle method statement
- Broyden's method statement
- Numerical continuation concept
- Homotopy continuation for polynomial systems concept
Direct methods for linear systems 15 of 17
- Gaussian elimination statement
- LU decomposition statement
- Cholesky decomposition statement
- QR decomposition statement
- Pivot concept
- Householder transformation definition
- Givens rotation definition
- Tridiagonal matrix algorithm statement
- Iterative refinement statement
- Levinson recursion statement
- Bareiss algorithm statement
- Cuthill–McKee algorithm statement
- Minimum degree algorithm statement
- Nested dissection statement
- Incomplete Cholesky factorization definition
- Incomplete LU factorization definition
- Hierarchical matrix definition
Iterative methods for linear systems 25 of 25
- Iterative method concept
- Jacobi method statement
- Gauss–Seidel method statement
- Successive over-relaxation statement
- Symmetric successive over-relaxation statement
- Modified Richardson iteration statement
- Chebyshev iteration statement
- Kaczmarz method statement
- Krylov subspace definition
- Conjugate gradient method statement
- Derivation of the conjugate gradient method statement
- Preconditioner definition
- Arnoldi iteration statement
- Generalized minimal residual method statement
- Minimal residual method statement
- Conjugate residual method statement
- Biconjugate gradient method statement
- Biconjugate gradient stabilized method statement
- Multigrid method statement
- Domain decomposition methods concept
- Schwarz alternating method statement
- Additive Schwarz method statement
- Schur complement method statement
- Balancing domain decomposition statement
- Mortar methods concept
Eigenvalue computations 9 of 11
- power iteration statement
- QR algorithm statement
- Eigenvalue algorithm concept
- Inverse iteration statement
- Rayleigh quotient iteration statement
- Jacobi eigenvalue algorithm statement
- Divide-and-conquer eigenvalue algorithm statement
- Lanczos algorithm statement
- LOBPCG statement
- Bidiagonalization statement
- Pseudospectrum definition
Least squares and ill-posed problems 8 of 8
- Singular value decomposition statement
- Numerical methods for linear least squares concept
- Non-negative least squares problem
- Gauss–Newton algorithm statement
- Levenberg–Marquardt algorithm statement
- Regularization of ill-posed problems concept
- L-curve concept
- Landweber iteration statement
Interpolation, splines and geometric modeling 10 of 11
- Polynomial interpolation concept
- Lagrange interpolation polynomial definition
- Runge's phenomenon example
- Chebyshev nodes definition
- Spline definition
- Bilinear interpolation definition
- Bicubic interpolation definition
- Monotone cubic interpolation statement
- Subdivision surface concept
- Catmull–Clark subdivision surface statement
- Mesh generation concept
Numerical integration and differentiation 13 of 19
- Numerical integration concept
- trapezoidal rule statement
- Simpson's rule statement
- Newton–Cotes formulas statement
- Gaussian quadrature statement
- Gauss–Kronrod quadrature statement
- Richardson extrapolation statement
- Romberg's method statement
- Adaptive quadrature statement
- Gauss–Hermite quadrature statement
- Gauss–Laguerre quadrature statement
- Gauss–Jacobi quadrature statement
- Tanh-sinh quadrature statement
- Lebedev quadrature statement
- Boole's rule statement
- Numerical differentiation concept
- Finite difference coefficients definition
- Five-point stencil definition
- Automatic differentiation concept
Ordinary differential equations 26 of 29
- Euler method statement
- Runge–Kutta methods statement
- linear multistep method statement
- Stiff equation concept
- Numerical methods for ordinary differential equations concept
- Local truncation error definition
- Backward Euler method statement
- Midpoint method statement
- Heun's method statement
- Butcher tableau definition
- Butcher group object
- Runge–Kutta–Fehlberg method statement
- Dormand–Prince method statement
- Gauss–Legendre Runge–Kutta methods statement
- Adaptive step size concept
- Predictor–corrector method statement
- Bulirsch–Stoer algorithm statement
- Rosenbrock methods statement
- Exponential integrator statement
- Leapfrog integration statement
- Verlet integration statement
- Beeman's algorithm statement
- Geometric integrator concept
- Variational integrator concept
- Energy drift concept
- Strang splitting statement
- Parareal statement
- Milstein method statement
- Runge–Kutta method for stochastic differential equations statement
Time-dependent partial differential equations 19 of 19
- Finite difference method concept
- Crank–Nicolson method statement
- Courant–Friedrichs–Lewy condition statement
- Lax equivalence theorem statement
- von Neumann stability analysis statement
- Method of lines concept
- Alternating-direction implicit method statement
- Upwind scheme definition
- Lax–Wendroff method definition
- MacCormack method definition
- Numerical diffusion concept
- Godunov's theorem statement
- Total variation diminishing scheme definition
- Flux limiter definition
- MUSCL scheme definition
- Riemann solver concept
- Roe solver statement
- Level-set method concept
- Fast marching method statement
Boundary value problems and finite elements 21 of 22
- Finite element method concept
- Galerkin method statement
- Céa's lemma statement
- Bramble–Hilbert lemma statement
- Ladyzhenskaya–Babuška–Brezzi condition statement
- Petrov–Galerkin method statement
- Stiffness matrix definition
- Mixed finite element method concept
- Raviart–Thomas elements object
- Finite element exterior calculus concept
- hp-FEM concept
- Discontinuous Galerkin method concept
- Extended finite element method concept
- Isogeometric analysis concept
- Adaptive mesh refinement concept
- Finite volume method concept
- Spectral method concept
- Pseudo-spectral method concept
- Spectral element method concept
- Meshfree methods concept
- Method of fundamental solutions concept
- Immersed boundary method concept
Integral equations 1 of 1
- Nyström method statement
Fourier and transform methods 7 of 7
- Discrete Fourier transform definition
- Fast Fourier transform statement
- Cooley–Tukey FFT algorithm statement
- Non-uniform discrete Fourier transform definition
- Bluestein's FFT algorithm statement
- Rader's FFT algorithm statement
- Prime-factor FFT algorithm statement
Recurrences and evaluation of functions 2 of 2
- Clenshaw algorithm statement
- CORDIC statement
Monte Carlo and quasi-Monte Carlo methods 21 of 21
- Monte Carlo method concept
- Monte Carlo integration statement
- Pseudorandom number generator concept
- Linear congruential generator definition
- Mersenne Twister object
- Inverse transform sampling statement
- Rejection sampling statement
- Box–Muller transform statement
- Ziggurat algorithm statement
- Variance reduction concept
- Importance sampling statement
- Antithetic variates statement
- Control variates statement
- Multilevel Monte Carlo method statement
- Quasi-Monte Carlo method concept
- Low-discrepancy sequence definition
- Koksma–Hlawka inequality statement
- Halton sequence object
- Sobol sequence object
- Hamiltonian Monte Carlo statement
- Gibbs sampling statement
Complexity of numerical problems 1 of 1
- Information-based complexity concept
More ideas in this subject
Concepts 124
- Back substitution
- Computing the inverse by row reduction
- Gaussian elimination
- Gauss–Jordan elimination
- LU decomposition
- Curse of dimensionality
- Diagonally dominant matrix
- Interval arithmetic
- Lifting scheme
- Sparse grid
- Sparse matrix
- Trigonometric interpolation
- B-spline
- Band matrix
- Bézier curve
- Cascade algorithm
- Clenshaw–Curtis quadrature
- de Casteljau's algorithm
- Discrete Poisson equation
- Gauss–Legendre quadrature
- Hessenberg matrix
- Inverse problem
- Lanczos sigma factor
- Lax–Friedrichs method
- Neville's algorithm
- Overdetermined system
- Romberg's method
- Scaling function and refinement equation
- Simplex algorithm
- Sparse approximation
- Spline interpolation
- Tridiagonal matrix
- Walsh–Hadamard transform
- Wavelet
- Wavelet packet decomposition
- Backward differentiation formula
- Bernstein–Bézier form
- Biorthogonal wavelet
- Birkhoff interpolation
- Cubic Hermite spline
- Cubic spline
- Direct collocation
- Discrete wavelet transform
- Divided differences
- Dodgson condensation
- Fast wavelet transform
- Gaussian quadrature
- Gauss–Kronrod quadrature formula
- Inverse distance weighting
- Laguerre series expansion of the Laplace transform
- Lebesgue constant
- Matrix norm
- Moving least squares
- Multiresolution analysis
- Newton polynomial
- Newton–Cotes formulas
- Non-uniform rational B-spline
- Radial basis function
- Rate of convergence
- Simpson's rule
- Tensor decomposition
- Trapezoidal rule
- Unisolvent point set
- Vanishing moments of a wavelet
- Collectively compact operator approximation
- de Boor's algorithm
- Glimm scheme
- Godunov's scheme
- Hermite interpolation
- Lagrange basis polynomials
- Newton's method
- Numerical linear algebra
- Power iteration
- Projection method for integral equations
- Pseudospectral optimal control
- Radial basis function interpolation
- Richardson extrapolation
- Strassen algorithm
- Sylvester equation
- Tikhonov regularization
- Euler transform
- Lagrange polynomial
- Multivariate interpolation
- Prony's method
- Series acceleration
- Van Wijngaarden transformation
- Aitken's delta-squared process
- Filtered back-projection
- Remez algorithm
- Ill-posedness of real Laplace inversion
- Lagrange interpolation
- Least squares approximation
- Levin-type transformations
- Rayleigh–Ritz method
- Shooting method
- Gram–Schmidt process
- Quadrature rule
- Eigenvalue perturbation
- Euler method
- Degree of exactness of a quadrature rule
- Euler–Boole summation
- Box spline
- Indirect method by shooting
- Runge–Kutta methods
- Symplectic integrator
- Linear multistep method
- Euler–Maruyama method
- Central difference
- Minimax approximation
- Shanks transformation
- Wynn's epsilon algorithm
- Least squares
- QR algorithm
- Differential-algebraic system of equations
- Smoothing spline
- Adjoint state method
- Fixed-point iteration
- Particle filter
- Coupling from the past
- Metropolis–Hastings algorithm
- Chudnovsky algorithm
- Markov chain Monte Carlo
- Expectation–maximization algorithm
- Galerkin method
Theorems and results 23
- Abel–Plana formula
- Cox–de Boor recursion
- Dahlquist barriers
- Arithmetic–geometric mean and elliptic integrals
- Curry–Schoenberg theorem
- Newton–Gregory forward formula
- Thiele's interpolation formula
- Barycentric interpolation formula
- Bauer–Fike theorem
- Chebyshev–Markov–Stieltjes inequalities
- Convergence of approximations for second-kind equations
- Hermite–Genocchi formula
- Gram–Schmidt vectors are orthogonal
- Euler–Maclaurin formula
- Newton–Kantorovich theorem
- Orthogonal projection is the closest point
- Eckart–Young theorem
- Interpolation error formula
- Mean value theorem for divided differences
- Minimal curvature property of natural cubic splines
- Error bound for the trapezoidal rule
- Peano kernel theorem
- Ramanujan's series for 1/pi
Examples 7
Problems 4
Definitions 206
- Pseudorandom number generator
- Adaptive mesh refinement
- Butcher tableau
- Curse of dimensionality
- Diagonally dominant matrix
- Interval arithmetic
- Lifting scheme
- Machine epsilon
- Non-uniform discrete Fourier transform
- Sparse grid
- Sparse matrix
- Subnormal number
- Trigonometric interpolation
- Adaptive step size
- Affine arithmetic
- Arbitrary-precision arithmetic
- B-spline
- Backward error analysis
- Band matrix
- Bilinear interpolation
- Bézier curve
- Cascade algorithm
- Catastrophic cancellation
- Clenshaw–Curtis quadrature
- de Casteljau's algorithm
- Discrete Fourier transform
- Discrete Poisson equation
- Energy drift
- Floating-point arithmetic
- Gauss–Legendre quadrature
- Hessenberg matrix
- Information-based complexity
- Inverse problem
- Lanczos sigma factor
- Lax–Friedrichs method
- Low-discrepancy sequence
- Mesh generation
- Neville's algorithm
- Numerical analysis
- Overdetermined system
- Romberg's method
- Rounding
- Scaling function and refinement equation
- Simplex algorithm
- Sparse approximation
- Spline interpolation
- Subdivision surface
- Tridiagonal matrix
- Unit in the last place
- Walsh–Hadamard transform
- Wavelet
- Wavelet packet decomposition
- Backward differentiation formula
- Bernstein–Bézier form
- Bicubic interpolation
- Biorthogonal wavelet
- Birkhoff interpolation
- Cubic Hermite spline
- Cubic spline
- Direct collocation
- Discrete wavelet transform
- Divided differences
- Dodgson condensation
- Eigenvalue algorithm
- Fast wavelet transform
- Gaussian quadrature
- Gauss–Kronrod quadrature formula
- Geometric integrator
- Hierarchical matrix
- hp-FEM
- IEEE 754 standard
- Inverse distance weighting
- Laguerre series expansion of the Laplace transform
- Lebesgue constant
- Linear congruential generator
- MacCormack method
- Matrix norm
- Monte Carlo method
- Mortar methods
- Moving least squares
- Multiresolution analysis
- Newton polynomial
- Newton–Cotes formulas
- Non-uniform rational B-spline
- Numerical differentiation
- Numerical methods for ordinary differential equations
- Quasi-Monte Carlo method
- Radial basis function
- Rate of convergence
- Round-off error
- Simpson's rule
- Spline
- Tensor decomposition
- Trapezoidal rule
- Truncation error
- Unisolvent point set
- Upwind scheme
- Validated numerics
- Vanishing moments of a wavelet
- Variance reduction
- Collectively compact operator approximation
- Condition number
- de Boor's algorithm
- Discontinuous Galerkin method
- Flux limiter
- Glimm scheme
- Godunov's scheme
- Hermite interpolation
- Isogeometric analysis
- Lagrange basis polynomials
- Lax–Wendroff method
- Local truncation error
- Meshfree methods
- MUSCL scheme
- Numerical linear algebra
- Numerical stability
- Power iteration
- Projection method for integral equations
- Pseudospectral optimal control
- Radial basis function interpolation
- Richardson extrapolation
- Riemann solver
- Root-finding algorithm
- Spectral method
- Stiffness matrix
- Strassen algorithm
- Sylvester equation
- Tikhonov regularization
- Total variation diminishing scheme
- Euler transform
- Finite difference method
- Finite element method
- Incomplete LU factorization
- Krylov subspace
- Lagrange polynomial
- Multivariate interpolation
- Numerical diffusion
- Preconditioner
- Prony's method
- Pseudospectrum
- Regularization of ill-posed problems
- Series acceleration
- Van Wijngaarden transformation
- Aitken's delta-squared process
- Extended finite element method
- Filtered back-projection
- Immersed boundary method
- Iterative method
- Remez algorithm
- Spectral element method
- Automatic differentiation
- Domain decomposition methods
- Finite element exterior calculus
- Givens rotation
- Ill-posedness of real Laplace inversion
- Lagrange interpolation
- Least squares approximation
- Levin-type transformations
- Rayleigh–Ritz method
- Shooting method
- Variational integrator
- Finite volume method
- Quadrature rule
- Eigenvalue perturbation
- Propagation of uncertainty
- Chebyshev nodes
- Degree of exactness of a quadrature rule
- Euler–Boole summation
- Finite difference coefficients
- Numerical integration
- Box spline
- Indirect method by shooting
- Runge–Kutta methods
- Symplectic integrator
- Five-point stencil
- Linear multistep method
- Mixed finite element method
- Euler–Maruyama method
- Incomplete Cholesky factorization
- Central difference
- Level-set method
- Method of lines
- Minimax approximation
- Shanks transformation
- Wynn's epsilon algorithm
- Stiff equation
- Method of fundamental solutions
- Pseudo-spectral method
- Householder transformation
- Polynomial interpolation
- L-curve
- QR algorithm
- Differential-algebraic system of equations
- Homotopy continuation for polynomial systems
- Numerical continuation
- Smoothing spline
- Adjoint state method
- Fixed-point iteration
- Numerical methods for linear least squares
- Particle filter
- Coupling from the past
- Metropolis–Hastings algorithm
- Chudnovsky algorithm
- Markov chain Monte Carlo
- Expectation–maximization algorithm
- Galerkin method