Math 2.0

Subjects

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

Map of the subject

Basic notions and error analysis 20 of 20

  1. Condition number definition
  2. Numerical analysis concept
  3. Floating-point arithmetic definition
  4. IEEE 754 standard definition
  5. Machine epsilon definition
  6. Unit in the last place definition
  7. Subnormal number definition
  8. Rounding concept
  9. Round-off error concept
  10. Truncation error concept
  11. Catastrophic cancellation concept
  12. Numerical stability concept
  13. Backward error analysis concept
  14. Propagation of uncertainty concept
  15. Kahan summation algorithm statement
  16. Pairwise summation statement
  17. Arbitrary-precision arithmetic concept
  18. Affine arithmetic concept
  19. Validated numerics concept
  20. Wilkinson's polynomial example

Nonlinear equations 23 of 27

  1. Newton's method statement
  2. fixed-point iteration statement
  3. Aitken's delta-squared process statement
  4. Shanks transformation statement
  5. Root-finding algorithm concept
  6. Bisection method statement
  7. Regula falsi statement
  8. Secant method statement
  9. Superlinear convergence of the secant method statement
  10. Quadratic convergence of Newton's method statement
  11. Halley's method statement
  12. Householder's method statement
  13. Steffensen's method statement
  14. Inverse quadratic interpolation statement
  15. Brent's method statement
  16. Ridders' method statement
  17. Muller's method statement
  18. Laguerre's method statement
  19. Durand–Kerner method statement
  20. Aberth method statement
  21. Jenkins–Traub algorithm statement
  22. Bairstow's method statement
  23. Graeffe's method statement
  24. Splitting circle method statement
  25. Broyden's method statement
  26. Numerical continuation concept
  27. Homotopy continuation for polynomial systems concept

Direct methods for linear systems 15 of 17

  1. Gaussian elimination statement
  2. LU decomposition statement
  3. Cholesky decomposition statement
  4. QR decomposition statement
  5. Pivot concept
  6. Householder transformation definition
  7. Givens rotation definition
  8. Tridiagonal matrix algorithm statement
  9. Iterative refinement statement
  10. Levinson recursion statement
  11. Bareiss algorithm statement
  12. Cuthill–McKee algorithm statement
  13. Minimum degree algorithm statement
  14. Nested dissection statement
  15. Incomplete Cholesky factorization definition
  16. Incomplete LU factorization definition
  17. Hierarchical matrix definition

Iterative methods for linear systems 25 of 25

  1. Iterative method concept
  2. Jacobi method statement
  3. Gauss–Seidel method statement
  4. Successive over-relaxation statement
  5. Symmetric successive over-relaxation statement
  6. Modified Richardson iteration statement
  7. Chebyshev iteration statement
  8. Kaczmarz method statement
  9. Krylov subspace definition
  10. Conjugate gradient method statement
  11. Derivation of the conjugate gradient method statement
  12. Preconditioner definition
  13. Arnoldi iteration statement
  14. Generalized minimal residual method statement
  15. Minimal residual method statement
  16. Conjugate residual method statement
  17. Biconjugate gradient method statement
  18. Biconjugate gradient stabilized method statement
  19. Multigrid method statement
  20. Domain decomposition methods concept
  21. Schwarz alternating method statement
  22. Additive Schwarz method statement
  23. Schur complement method statement
  24. Balancing domain decomposition statement
  25. Mortar methods concept

Eigenvalue computations 9 of 11

  1. power iteration statement
  2. QR algorithm statement
  3. Eigenvalue algorithm concept
  4. Inverse iteration statement
  5. Rayleigh quotient iteration statement
  6. Jacobi eigenvalue algorithm statement
  7. Divide-and-conquer eigenvalue algorithm statement
  8. Lanczos algorithm statement
  9. LOBPCG statement
  10. Bidiagonalization statement
  11. Pseudospectrum definition

Least squares and ill-posed problems 8 of 8

  1. Singular value decomposition statement
  2. Numerical methods for linear least squares concept
  3. Non-negative least squares problem
  4. Gauss–Newton algorithm statement
  5. Levenberg–Marquardt algorithm statement
  6. Regularization of ill-posed problems concept
  7. L-curve concept
  8. Landweber iteration statement

Interpolation, splines and geometric modeling 10 of 11

  1. Polynomial interpolation concept
  2. Lagrange interpolation polynomial definition
  3. Runge's phenomenon example
  4. Chebyshev nodes definition
  5. Spline definition
  6. Bilinear interpolation definition
  7. Bicubic interpolation definition
  8. Monotone cubic interpolation statement
  9. Subdivision surface concept
  10. Catmull–Clark subdivision surface statement
  11. Mesh generation concept

Numerical integration and differentiation 13 of 19

  1. Numerical integration concept
  2. trapezoidal rule statement
  3. Simpson's rule statement
  4. Newton–Cotes formulas statement
  5. Gaussian quadrature statement
  6. Gauss–Kronrod quadrature statement
  7. Richardson extrapolation statement
  8. Romberg's method statement
  9. Adaptive quadrature statement
  10. Gauss–Hermite quadrature statement
  11. Gauss–Laguerre quadrature statement
  12. Gauss–Jacobi quadrature statement
  13. Tanh-sinh quadrature statement
  14. Lebedev quadrature statement
  15. Boole's rule statement
  16. Numerical differentiation concept
  17. Finite difference coefficients definition
  18. Five-point stencil definition
  19. Automatic differentiation concept

Ordinary differential equations 26 of 29

  1. Euler method statement
  2. Runge–Kutta methods statement
  3. linear multistep method statement
  4. Stiff equation concept
  5. Numerical methods for ordinary differential equations concept
  6. Local truncation error definition
  7. Backward Euler method statement
  8. Midpoint method statement
  9. Heun's method statement
  10. Butcher tableau definition
  11. Butcher group object
  12. Runge–Kutta–Fehlberg method statement
  13. Dormand–Prince method statement
  14. Gauss–Legendre Runge–Kutta methods statement
  15. Adaptive step size concept
  16. Predictor–corrector method statement
  17. Bulirsch–Stoer algorithm statement
  18. Rosenbrock methods statement
  19. Exponential integrator statement
  20. Leapfrog integration statement
  21. Verlet integration statement
  22. Beeman's algorithm statement
  23. Geometric integrator concept
  24. Variational integrator concept
  25. Energy drift concept
  26. Strang splitting statement
  27. Parareal statement
  28. Milstein method statement
  29. Runge–Kutta method for stochastic differential equations statement

Time-dependent partial differential equations 19 of 19

  1. Finite difference method concept
  2. Crank–Nicolson method statement
  3. Courant–Friedrichs–Lewy condition statement
  4. Lax equivalence theorem statement
  5. von Neumann stability analysis statement
  6. Method of lines concept
  7. Alternating-direction implicit method statement
  8. Upwind scheme definition
  9. Lax–Wendroff method definition
  10. MacCormack method definition
  11. Numerical diffusion concept
  12. Godunov's theorem statement
  13. Total variation diminishing scheme definition
  14. Flux limiter definition
  15. MUSCL scheme definition
  16. Riemann solver concept
  17. Roe solver statement
  18. Level-set method concept
  19. Fast marching method statement

Boundary value problems and finite elements 21 of 22

  1. Finite element method concept
  2. Galerkin method statement
  3. Céa's lemma statement
  4. Bramble–Hilbert lemma statement
  5. Ladyzhenskaya–Babuška–Brezzi condition statement
  6. Petrov–Galerkin method statement
  7. Stiffness matrix definition
  8. Mixed finite element method concept
  9. Raviart–Thomas elements object
  10. Finite element exterior calculus concept
  11. hp-FEM concept
  12. Discontinuous Galerkin method concept
  13. Extended finite element method concept
  14. Isogeometric analysis concept
  15. Adaptive mesh refinement concept
  16. Finite volume method concept
  17. Spectral method concept
  18. Pseudo-spectral method concept
  19. Spectral element method concept
  20. Meshfree methods concept
  21. Method of fundamental solutions concept
  22. Immersed boundary method concept

Integral equations 1 of 1

  1. Nyström method statement

Fourier and transform methods 7 of 7

  1. Discrete Fourier transform definition
  2. Fast Fourier transform statement
  3. Cooley–Tukey FFT algorithm statement
  4. Non-uniform discrete Fourier transform definition
  5. Bluestein's FFT algorithm statement
  6. Rader's FFT algorithm statement
  7. Prime-factor FFT algorithm statement

Recurrences and evaluation of functions 2 of 2

  1. Clenshaw algorithm statement
  2. CORDIC statement

Monte Carlo and quasi-Monte Carlo methods 21 of 21

  1. Monte Carlo method concept
  2. Monte Carlo integration statement
  3. Pseudorandom number generator concept
  4. Linear congruential generator definition
  5. Mersenne Twister object
  6. Inverse transform sampling statement
  7. Rejection sampling statement
  8. Box–Muller transform statement
  9. Ziggurat algorithm statement
  10. Variance reduction concept
  11. Importance sampling statement
  12. Antithetic variates statement
  13. Control variates statement
  14. Multilevel Monte Carlo method statement
  15. Quasi-Monte Carlo method concept
  16. Low-discrepancy sequence definition
  17. Koksma–Hlawka inequality statement
  18. Halton sequence object
  19. Sobol sequence object
  20. Hamiltonian Monte Carlo statement
  21. Gibbs sampling statement

Complexity of numerical problems 1 of 1

  1. Information-based complexity concept

More ideas in this subject

Concepts 124

Theorems and results 23

Examples 7

Problems 4

Definitions 206