MATH3310
Computational and Applied Mathematics
Linear solvers and Newton's method, discrete Fourier transforms and the FFT, finite elements, conformal maps, numerical quadrature and Chebyshev approximation.
Your progress
0/ 25 sections marked complete
Next section: Linear systems, iteration, and Newton's method
Completion marks are saved in this browser.
This course in the web
In the MATH3310 notes
- Theorem cards
- 62
- Definitions
- 30
- Counterexamples
- 25
- Concept lenses
- 13
- Histories of ideas
- 0
- Proof X-rays
- 29
No concept lens from this course is recorded in the web yet.
Counts cover the 25 public sections of this course and what is written in them, not recorded connections. 0 of these sections are indexed into the web in detail so far.
In the webTheorem cards 62 · Definitions 30 · Counterexamples 25 · Concept lenses 13 · Proof X-rays 29
No concept lens from this course is recorded in the web yet.
Counts cover the 25 public sections of this course and what is written in them, not recorded connections. 0 of these sections are indexed into the web in detail so far.
Chapter 1 · 10 sections
Linear systems, iteration, and Newton's method
Factorization, conditioning, stationary iteration, and nonlinear equations.
Theorems 24 · Definitions 13Counterexamples 10Lenses 5Proof X-rays 13
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 1.1
Linear systems, iteration, and Newton's method
Factorization, conditioning, stationary iteration, and nonlinear equations.
- 1.2
Newton systems, Krylov spaces, and matrix equations
Local Newton convergence, iterative linear solvers, and matrix equations.
- 1.3
Arnoldi and GMRES: deriving residual minimization
Exact-arithmetic Krylov bases, reduced least squares, invariant-subspace termination, and a complete nonnormal example.
- 1.4
Partial pivoting, growth and error
Multiplier bounds, intermediate growth, residuals, conditioning and backward error.
- 1.5
Preconditioned conjugate gradients
The practical recurrence, transformed SPD geometry, and an energy-error bound.
- 1.6
Residual certificates for preconditioned systems
Energy-error bounds with residual and inner-solve defects.
- 1.7
Gauss–Seidel iteration and successive over-relaxation
Derive sequential updates and prove convergence for positive-definite systems.
- 1.8
Damped Newton iteration and line search
Globalize a Newton step with Armijo backtracking, prove a stationarity result under explicit assumptions, and understand when full steps return.
- 1.9
Initial-value problems: Euler methods and stability
Derive Euler methods and distinguish convergence under refinement from stability at a fixed step size.
- 1.10
Second-order Runge–Kutta methods
Derive midpoint and Heun updates, their convergence, and what their stability region does and does not guarantee.
Chapter 2 · 7 sections
Discrete Fourier transforms and the FFT
Discrete orthogonality, aliasing, convolution, and radix-two FFT.
Theorems 15 · Definitions 6Counterexamples 7Lenses 3Proof X-rays 6
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 2.1
Discrete Fourier transforms and the FFT
Discrete orthogonality, aliasing, convolution, and radix-two FFT.
- 2.2
Continuous Fourier series and spectral solutions
Convergence, Parseval, and the heat equation.
- 2.3
Nonuniform Fourier quadrature and the error budget
Estimate Fourier coefficients from uneven samples and separate truncation, quadrature, and measurement errors.
- 2.4
The heat equation on a grid
Derive a finite-difference heat solver and understand its stability and error.
- 2.5
Fourier modes and energy for the wave equation
Solve a vibrating-string problem using sine modes and prove uniqueness by energy.
- 2.6
Two-dimensional discrete Fourier transforms
Develop inversion, separability, frequency conventions and energy for a rectangular sample array.
- 2.7
Fourier truncation, sampling, and the Gibbs phenomenon
Connect smoothness and spectral error to sampling, aliasing, and filtered sums.
Chapter 3 · 3 sections
Weak forms and one-dimensional finite elements
Weak boundary-value problems, assembly, and energy error.
Theorems 6 · Definitions 2Counterexamples 3Lenses 1Proof X-rays 3
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 3.1
Weak forms and one-dimensional finite elements
Weak boundary-value problems, assembly, and energy error.
- 3.2
Finite elements on nonuniform meshes and triangles
Variable coefficients, two-dimensional assembly, and energy error.
- 3.4
Nodal exactness and finite-element error rates
A one-dimensional nodal identity and explicit energy and L2 error estimates.
Chapter 4 · 2 sections
Conformal maps and harmonic boundary problems
Complex derivatives, Möbius maps, and harmonic boundary problems.
Theorems 5 · Definitions 2Counterexamples 2Lenses 3Proof X-rays 2
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 4.1
Conformal maps and harmonic boundary problems
Complex derivatives, Möbius maps, and harmonic boundary problems.
- 4.2
Poisson kernels, conformal maps, and corners
Construct harmonic boundary solutions on the half-plane, strip, and wedge, and examine corner regularity.
Chapter 5 · 1 section
5. Numerical quadrature
Derive composite quadrature bounds and examine refinement indicators.
Theorems 2 · Definitions 2Counterexamples 1Proof X-rays 1
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 5.1
Trapezoids, Simpson's rule and error
Derive composite quadrature bounds and test a refinement indicator.
Chapter 6 · 2 sections
Chebyshev approximation and sampling
Cosine series, Chebyshev–Gauss interpolation, aliasing and stability.
Theorems 10 · Definitions 5Counterexamples 2Lenses 1Proof X-rays 4
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 6.1
Chebyshev approximation, Chebyshev–Gauss sampling, and aliasing on an interval
Turn a nonperiodic interval into a cosine series, prove continuous and discrete orthogonality, and analyze Chebyshev interpolation, reflected aliasing, endpoint singularities, and noise.
- 6.2
Chebyshev–Lobatto differentiation: the matrix, its proof, and boundary conditions
Derive the endpoint-including Chebyshev differentiation matrix, prove polynomial exactness and a derivative-convergence criterion, and separate interpolation, aliasing, noise, and boundary elimination.