Useful Links
Mathematics
Numerical Methods
1. Introduction to Numerical Methods
2. Foundational Concepts in Numerical Computation
3. Root Finding Methods
4. Linear Systems of Equations
5. Interpolation and Approximation
6. Curve Fitting and Least Squares
7. Numerical Differentiation
8. Numerical Integration
9. Ordinary Differential Equations
10. Partial Differential Equations
11. Optimization Methods
12. Eigenvalue Problems
Linear Systems of Equations
Linear Algebra Review
Vector Spaces
Matrix Operations
Addition
Multiplication
Transpose
Inverse
Determinants
Calculation Methods
Matrix Norms
Vector Norms
Matrix Norms
Condition Numbers
Direct Solution Methods
Gaussian Elimination
Forward Elimination
Back Substitution
Pivoting Strategies
Partial Pivoting
Complete Pivoting
Scaled Partial Pivoting
Operation Count
Gauss-Jordan Elimination
Reduced Row Echelon Form
Matrix Inversion
Computational Efficiency
LU Decomposition
Doolittle Method
Crout Method
Pivoting in LU
Forward Substitution
Backward Substitution
Cholesky Decomposition
Symmetric Positive Definite Matrices
Algorithm Implementation
Computational Advantages
Special Matrix Systems
Tridiagonal Systems
Thomas Algorithm
Storage Requirements
Banded Systems
Storage Schemes
Solution Algorithms
Iterative Solution Methods
Jacobi Method
Algorithm Description
Matrix Formulation
Convergence Criteria
Gauss-Seidel Method
Algorithm Description
Convergence Analysis
Comparison with Jacobi
Successive Over-Relaxation
Relaxation Parameter
Optimal Parameter Selection
Convergence Properties
Convergence Theory
Diagonal Dominance
Spectral Radius
Convergence Conditions
Stopping Criteria
Previous
3. Root Finding Methods
Go to top
Next
5. Interpolation and Approximation