Numerical Analysis
Discretization, stability, and convergence of numerical methods.
Numerical Analysis. Discretization, stability, and convergence of numerical methods. The literature on numerical analysis divides naturally along several axes: the foundational structures that organise the subject, the techniques that drive proofs and computations, the questions about classification or representation that animate current research, and the bridges to neighbouring areas of mathematics and science. The references below trace those axes through the canonical textbook treatments and recent technical contributions.
Foundations and canonical references
The standard treatments of numerical analysis approach the subject from complementary angles. Burden, Numerical Analysis (2015) is the anchor reference for the subject and lays out the core definitions, theorems, and worked examples that practitioners return to. Suli, An Introduction to Numerical Analysis (2003) gives a parallel, more proof-oriented exposition of the same material and is widely used as a graduate text. Press, Numerical Recipes: The Art of Scientific Computing (2007) offers an alternative presentation that complements the primary references and is useful for triangulating definitions and proof techniques.
Open methodological questions for numerical analysis include sharpening the bridges between foundational theory and computational practice, extending classical results to broader or more structured settings, and integrating the techniques surveyed above with adjacent mathematical disciplines. The references listed in this page are the entry points that current work builds on.
Prerequisites
Sources
- textbook · primary · 2015Numerical Analysisburden-2015, faires-2015
- textbook · primary · 2003An Introduction to Numerical Analysissuli-2003, mayers-2003
- textbook · supporting · 2007Numerical Recipes: The Art of Scientific Computingpress-2007, teukolsky-2007, vetterling-2007, flannery-2007
In context
Where this topic sits in the prerequisite graph. Click any node to jump.
Explore
- 01
Finite Element Methods
Galerkin formulation, mixed methods, and a-posteriori error estimation.
- 02
Finite Volume and Finite Difference Methods
Conservation-law discretizations and structured-grid solvers.
- 03
Spectral and Pseudospectral Methods
Fourier and Chebyshev expansions for PDE.
- 04
Multigrid and Iterative Solvers
Krylov subspace methods, preconditioning, and multigrid hierarchies.
- 05
Structure-Preserving Integrators
Symplectic, energy-preserving, and Lie-group integrators.
- 06
Isogeometric Analysis
NURBS-based finite element methods bridging CAD and simulation.
- 07
Discontinuous Galerkin Methods
DG methods for hyperbolic and convection-dominated problems.
- 08
Quadrature and Cubature
Gaussian, sparse-grid, and Quasi-Monte Carlo integration.
- 09
Randomized Numerical Methods
Monte Carlo PDE solvers and randomized iterative methods.
Review this topic
This page was drafted by an agent and is waiting on expert review. Spotted a wrong prerequisite, a missing concept, a misattributed source, or a factual slip? Tell us — your review opens a tracked issue maintainers act on.