Toggle navigation sidebar
Toggle in-page Table of Contents
Fundamentals of Numerical Computation
Home
Preface
Preface to the Julia edition
Preface to the original edition
Main text
1. Introduction
1.1. Floating-point numbers
1.2. Problems and conditioning
1.3. Algorithms
1.4. Stability
1.5. Next steps
2. Linear systems of equations
2.1. Polynomial interpolation
2.2. Computing with matrices
2.3. Linear systems
2.4. LU factorization
2.5. Efficiency of matrix computations
2.6. Row pivoting
2.7. Vector and matrix norms
2.8. Conditioning of linear systems
2.9. Exploiting matrix structure
2.10. Next steps
3. Overdetermined linear systems
3.1. Fitting functions to data
3.2. The normal equations
3.3. The QR factorization
3.4. Computing QR factorizations
3.5. Next steps
4. Roots of nonlinear equations
4.1. The rootfinding problem
4.2. Fixed-point iteration
4.3. Newton’s method
4.4. Interpolation-based methods
4.5. Newton for nonlinear systems
4.6. Quasi-Newton methods
4.7. Nonlinear least squares
4.8. Next steps
5. Piecewise interpolation
5.1. The interpolation problem
5.2. Piecewise linear interpolation
5.3. Cubic splines
5.4. Finite differences
5.5. Convergence of finite differences
5.6. Numerical integration
5.7. Adaptive integration
5.8. Next steps
6. Initial-value problems for ODEs
6.1. Basics of IVPs
6.2. Euler’s method
6.3. IVP systems
6.4. Runge–Kutta methods
6.5. Adaptive Runge–Kutta
6.6. Multistep methods
6.7. Implementation of multistep methods
6.8. Zero-stability of multistep methods
6.9. Next steps
7. Matrix analysis
7.1. From matrix to insight
7.2. Eigenvalue decomposition
7.3. Singular value decomposition
7.4. Symmetry and definiteness
7.5. Dimension reduction
7.6. Next steps
8. Krylov methods in linear algebra
8.1. Sparsity and structure
8.2. Power iteration
8.3. Inverse iteration
8.4. Krylov subspaces
8.5. GMRES
8.6. MINRES and conjugate gradients
8.7. Matrix-free iterations
8.8. Preconditioning
8.9. Next steps
9. Global function approximation
9.1. Polynomial interpolation
9.2. The barycentric formula
9.3. Stability of polynomial interpolation
9.4. Orthogonal polynomials
9.5. Trigonometric interpolation
9.6. Spectrally accurate integration
9.7. Improper integrals
9.8. Next steps
10. Boundary-value problems
10.1. Two-point BVP
10.2. Shooting
10.3. Differentiation matrices
10.4. Collocation for linear problems
10.5. Nonlinearity and boundary conditions
10.6. The Galerkin method
10.7. Next steps
11. Diffusion equations
11.1. Black–Scholes equation
11.2. The method of lines
11.3. Absolute stability
11.4. Stiffness
11.5. Boundaries
11.6. Next steps
12. Advection equations
12.1. Traffic flow
12.2. Upwinding and stability
12.3. Absolute stability
12.4. The wave equation
12.5. Next steps
13. Two-dimensional problems
13.1. Tensor-product discretizations
13.2. Two-dimensional diffusion and advection
13.3. Laplace and Poisson equations
13.4. Nonlinear elliptic PDEs
13.5. Next steps
Appendices
Review of linear algebra
Glossary
Julia cheatsheet
References
Index
Index
Index
A
|
B
|
C
|
D
|
E
|
F
|
G
|
H
|
I
|
J
|
K
|
L
|
M
|
N
|
O
|
P
|
Q
|
R
|
S
|
T
|
U
|
V
|
W
|
Y
|
Z
A
A-stability and A(α)-stability
absolute stability
accuracy (relative vs. absolute)
Adams--Bashforth formula
Adams--Moulton formula
adaptivity
in integration
in IVP solver
,
[1]
adjacency matrix
,
[1]
adjoint of a matrix
,
[1]
advection equation
,
[1]
advection-diffusion equation
,
[1]
,
[2]
,
[3]
Airy equation
algorithm
aliasing
Allen–Cahn equation
,
[1]
,
[2]
,
[3]
,
[4]
argmin
Arnoldi iteration
,
[1]
asymptotic notation
B
backward difference
backward differentiation formula for IVPs
backward error
,
[1]
,
[2]
in a linear system
backward substitution
banded matrix
,
[1]
bandwidth of a matrix
barycentric interpolation formula
barycentric weights
Bauer–Fike theorem
beam equation
Bessel equation
,
[1]
Black–Scholes equation
boundary conditions
inflow
numerical implementation of
,
[1]
,
[2]
,
[3]
periodic
Broyden update
Burgers equation
C
C3PO
,
[1]
cardinal function
,
[1]
,
[2]
,
[3]
Carrier equation
,
[1]
centered difference
CFL condition
characteristic polynomial
Chebyshev equation
Chebyshev points
first kind
second kind
,
[1]
Chebyshev polynomials
Clenshaw–Curtis integration
collocation
condition number
of a matrix
,
[1]
,
[2]
,
[3]
of a scalar function
of eigenvalues
of elementary functions
of initial-value problems
of interpolation
,
[1]
of linear least squares
of linear system
of normal equations
of rootfinding
conjugate gradients
conservation law
contraction mapping
convergence rate
algebraic
linear
,
[1]
,
[2]
,
[3]
quadratic
,
[1]
spectral
,
[1]
superlinear
Crank–Nicolson method
cubic spline
D
D'Alembert's solution
Dahlquist theorems
,
[1]
data fitting
by straight line
nonlinear
power law
degree matrix
diagonal matrix
,
[1]
,
[2]
diagonalizable matrix
differentiation matrix
,
[1]
,
[2]
,
[3]
diffusion equation
see heat equation
dimension reduction
,
[1]
Dirichlet boundary condition
,
[1]
Dirichlet boundary conditions
divide and conquer
domain of dependence
double exponential transformation
E
eigenvalue
,
[1]
conditioning of
dominant
,
[1]
eigenvalue decomposition
,
[1]
,
[2]
eigenvector
elliptic PDE
Euler's method
,
[1]
Euler–Maclaurin formula
evolutionary PDE
extrapolation
F
FFT (fast Fourier transform)
field of values
fill-in of sparse matrices
finite difference
for parabolic PDE
finite differences
,
[1]
,
[2]
for boundary value problems
for parabolic PDE
matrix
finite element method
Fisher equation
fixed-point iteration
fixed-point problem
floating-point numbers
,
[1]
flops
forward difference
forward substitution
Francis QR iteration
G
Galerkin conditions
Gaussian elimination
Gaussian integration
Gauss–Newton method
generating polynomials
Gibbs phenomenon
global error
GMRES
preconditioning in
relationship to MINRES
restarting
Gram matrix
graph
graph Laplacian matrix
Gregory integration formula
H
Han Solo
,
[1]
,
[2]
,
[3]
hat functions
heat equation
,
[1]
,
[2]
Helmholtz equation
,
[1]
Hermite equation
hermitian matrix
,
[1]
,
[2]
hermitian positive definite matrix
see symmetric positive definite matrix
Horner's algorithm
Householder reflector
hyperbolic PDE
I
identity matrix
,
[1]
IEEE 754
,
[1]
image (as a matrix)
,
[1]
,
[2]
implicit IVP solver
,
[1]
improper integral
,
[1]
initial-boundary-value problem
initial-value problem
one-step method for
inner product
of functions
of vectors
inner product space
interpolation
,
[1]
by piecewise linear polynomials
by piecewise polynomials
,
[1]
,
[2]
,
[3]
by polynomials
,
[1]
,
[2]
,
[3]
,
[4]
by trigonometric polynomials
inverse iteration
invertible matrix
J
Jacobian matrix
,
[1]
,
[2]
Julia
!
'
,
[1]
+=
.+
.-
:
,
[1]
@.
@animate
@sprintf
\
,
[1]
,
[2]
,
[3]
,
[4]
adjoint
,
[1]
annotate!
Boolean indexing
break
broadcasting
,
[1]
,
[2]
,
[3]
cg
cholesky
collect
comprehension
cond
,
[1]
destructuring
diag
,
[1]
diagm
,
[1]
,
[2]
DiagonalPreconditioner
eachindex
eigen
eigs
eigvals
eltype
end
enumerate
fft
fill
fit
FNC
for
,
[1]
functions
gmres
graphplot
I
ilu
Images
in-place function
indexing arrays
,
[1]
,
[2]
,
[3]
,
[4]
isinf
isodd
keyword function arguments
,
[1]
,
[2]
kron
length
,
[1]
LinearMap
maximum
minimum
minres
namespace
NaN
nlsolve
nnz
norm
,
[1]
normalize
,
[1]
ODEProblem
opnorm
Pair
plotting functions
push!
,
[1]
quadgk
range
,
[1]
Rational
reshape
return
scatter
scientific notation
size
solve
sortby
sortperm
sparse
spdiagm
splatting
Spline1D
string interpolation
subplots
sum
,
[1]
summarysize
svd
svdvals
ternary operator
transpose
tril
triu
using
vec operation
÷
K
Kronecker product
Krylov matrix
Krylov subspace
Kuramoto–Sivashinsky equation
L
Lagrange interpolation formula
Lagrange polynomial
Laguerre equation
Lanczos iteration
Laplace equation
Legendre equation
Legendre polynomials
Levenberg's method
linear combination
linear convergence
linear least-squares problem
,
[1]
,
[2]
linearization of an ODE
Lipschitz condition
logistic equation
,
[1]
LU factorization
,
[1]
,
[2]
incomplete
Luke Skywalker
M
machine epsilon
,
[1]
,
[2]
in double precision
mantissa
see significand
mass matrix
matrix factorization
Cholesky
EVD
LU
,
[1]
pivoted LU
QR
,
[1]
SVD
matrix inverse
,
[1]
Maxwell's equations
method of lines
,
[1]
,
[2]
,
[3]
MINRES
multistep method
,
[1]
implementation of
N
NaN
Neumann boundary condition
,
[1]
Newton's method
,
[1]
,
[2]
multidimensional
nonlinear least squares
norm
Frobenius
matrix
,
[1]
vector
,
[1]
normal equations
,
[1]
,
[2]
normal matrix
numerical integration
,
[1]
O
Obi-Wan Kenobi
,
[1]
ONC matrix
,
[1]
order of accuracy
of a finite-difference formula
,
[1]
of a one-step IVP method
of an approximation
of numerical integration
of the finite element method
Oregonator
orthogonal functions
orthogonal matrix
,
[1]
,
[2]
,
[3]
orthogonal polynomials
orthogonal vectors
orthonormal vectors
outer product
,
[1]
,
[2]
P
parabolic PDE
parameter continuation
pendulum
piecewise linear interpolant
pivoting
,
[1]
,
[2]
PLU factorization
Poisson equation
power iteration
preconditioning
predator–prey model
pseudoinverse
Q
quadratic convergence
quadrature
see numerical integration
quasi-Newton method
quasimatrix
R
Rayleigh quotient
residual
,
[1]
of a linear system
of rootfinding
Return of the Jedi
Robin boundary condition
rootfinding problem
,
[1]
,
[2]
multidimensional
roots
multiplicity of
,
[1]
Runge phenomenon
Runge–Kutta method
,
[1]
,
[2]
S
secant method
semidiscretization
see method of lines
shifted inverse iteration
see inverse iteration
shock wave
significand
significant digits
similarity transformation
Simpson's formula
,
[1]
sine integral function
sine–Gordon equation
singular matrix
singular value decomposition
,
[1]
thin form
soap film
sparse matrix
,
[1]
,
[2]
,
[3]
,
[4]
SPD matrix
see symmetric positive definite matrix
spline (cubic spline)
stability
,
[1]
of collocation
of IVP solvers
of multistep methods
of polynomial interpolation
stability region
Star Wars: A New Hope
,
[1]
,
[2]
,
[3]
,
[4]
,
[5]
,
[6]
steepest descent
stiff differential equation
,
[1]
,
[2]
stiffness matrix
subtractive cancellation
,
[1]
,
[2]
,
[3]
,
[4]
superlinear convergence
SVD
see singular value decomposition
Sylvester equation
symmetric matrix
,
[1]
,
[2]
,
[3]
symmetric positive definite matrix
,
[1]
,
[2]
T
tensor-product domain
The Empire Strikes Back
,
[1]
,
[2]
,
[3]
,
[4]
transpose
,
[1]
trapezoid formula
for an IVP
,
[1]
,
[2]
for integration
,
[1]
triangular matrix
,
[1]
tridiagonal matrix
trigonometric polynomial
truncation error
of a finite-difference formula
of a multistep IVP formula
of a numerical integration formula
of a one-step IVP solver
U
unit lower triangular matrix
unit roundoff
see: machine epsilon
unit vector
unitary matrix
,
[1]
,
[2]
,
[3]
unvec
upper Hessenberg matrix
upwind direction
V
van der Pol equation
Vandermonde matrix
,
[1]
vec
W
wave equation
,
[1]
weak solution
Wedge Antilles
Y
Yoda
,
[1]
,
[2]
Z
zero-stability