The PAMCET Learning Team is the institutional curriculum and content group behind course publishing on this platform. PAMCET (Professional and Academic Management Centre for Education and Training) is operated by Digitpen Hub Ltd, a company registered in Lagos, Nigeria. Courses credited to the PAMCET Learning Team are structured, organized, and published centrally by the platform rather than authored by a single named individual instructor — each course's syllabus, learning outcomes, and content are reviewed before publication under this institutional account. For questions about a specific course or to report a content issue, please use the platform's Help & Support or Contact Us pages.
Numerical Methods
Master Numerical Methods in University - Computer Science with this structured course, covering 8 modules and practice assessments.
Course Overview
Master Numerical Methods in University - Computer Science with this structured course, covering 8 modules and practice assessments. Curriculum Structure & Core Modules: • 1. Floating-Point Representation, Error Propagation, and Computational Conditioning • 2. Nonlinear...
What You'll Learn
- Understand and apply the principles of Errors in Numerical Computation
- Work confidently through Root-Finding Methods and its practical applications
- Analyse real-world scenarios involving Numerical Differentiation and Integration
- Develop applied skills in Solving Linear Systems Numerically
- Critically evaluate approaches to Interpolation Techniques
Requirements
- A foundational understanding of University - Computer Science concepts, from an introductory course or equivalent experience
- A computer, tablet or smartphone with a stable internet connection
- Willingness to commit regular study time to complete lessons, quizzes and assignments
Degree Programme Curriculum Context
This course is a curriculum unit of the B.Sc. Computer Science degree framework in Nigeria.
Earn Your Certificate
Showcase your skills with a certificate! Complete the course, submit your project, and earn your certificate. Here's a sample of what you'll receive to show off your accomplishments.

Course Curriculum
Browse complete theoretical foundations, worked calculations, laboratory protocols, and board assessment questions under each topic.
IEEE 754 Floating-Point Standard, Machine Epsilon, Precision Limits, and Underflow/Overflow
Sign in or enroll to access the full lecture notes and interactive reader.
Truncation versus Round-off Errors, Forward and Backward Error Analysis, and Floating-Point Arithmetic
Sign in or enroll to access the full lecture notes and interactive reader.
Numerical Stability, Well-Posedness, Condition Numbers of Functions, and Catastrophic Cancellation Mitigation
Sign in or enroll to access the full lecture notes and interactive reader.
Bracketing Methods: Bisection, Regula Falsi, and Convergence Rate Analysis
Sign in or enroll to access the full lecture notes and interactive reader.
Open Iterative Methods: Fixed-Point Iteration, Newton-Raphson, and the Secant Method
Sign in or enroll to access the full lecture notes and interactive reader.
Polynomial Roots, Muller's Method, Basins of Attraction, and Hybrid Modern Solvers (Brent-Dekker)
Sign in or enroll to access the full lecture notes and interactive reader.
Gaussian Elimination, Partial and Full Pivoting Strategies, and Operation Counts (O(n^3))
Sign in or enroll to access the full lecture notes and interactive reader.
Matrix Factorizations: Doolittle, Crout, and Cholesky Decomposition for Symmetric Positive Definite Systems
Sign in or enroll to access the full lecture notes and interactive reader.
Matrix Norms, Condition Number kappa(A), Ill-Conditioned Linear Systems, and Residual Correction
Sign in or enroll to access the full lecture notes and interactive reader.
Classical Stationary Iterative Methods: Jacobi, Gauss-Seidel, and Successive Over-Relaxation (SOR)
Sign in or enroll to access the full lecture notes and interactive reader.
Mid-Course Progress Assessment
Test your knowledge of Solving Linear Systems Numerically
Krylov Subspace Methods: Conjugate Gradient (CG) for Symmetric Systems and Preconditioning Strategies
Sign in or enroll to access the full lecture notes and interactive reader.
Eigenvalue and Eigenvector Computations: Power Method, Inverse Power Iteration, and the QR Algorithm
Sign in or enroll to access the full lecture notes and interactive reader.
Polynomial Interpolation: Lagrange Form, Newton's Divided Differences, and Runge's Phenomenon
Sign in or enroll to access the full lecture notes and interactive reader.
Piecewise Polynomial Interpolation: Hermite Polynomials and Natural/Clamped Cubic Splines
Sign in or enroll to access the full lecture notes and interactive reader.
Least-Squares Approximation: Normal Equations, Orthogonal Polynomials, and Chebyshev Economization
Sign in or enroll to access the full lecture notes and interactive reader.
Mid-Semester Case Study & Research Paper
Sign in or enroll to access the full lecture notes and interactive reader.
Finite Difference Approximations: Forward, Backward, Central Differences, and Richardson Extrapolation
Sign in or enroll to access the full lecture notes and interactive reader.
Newton-Cotes Quadrature Formulas: Trapezoidal Rule, Simpson's 1/3 and 3/8 Rules, and Romberg Integration
Sign in or enroll to access the full lecture notes and interactive reader.
Adaptive Quadrature, Gaussian Quadrature (Gauss-Legendre), and Multidimensional Numerical Integration
Sign in or enroll to access the full lecture notes and interactive reader.
Initial Value Problems (IVPs): Euler's Forward and Backward Methods, Local vs. Global Truncation Error
Sign in or enroll to access the full lecture notes and interactive reader.
Runge-Kutta Methods: Classical RK4, Adaptive Step-Sizing via Embedded Runge-Kutta-Fehlberg (RKF45)
Sign in or enroll to access the full lecture notes and interactive reader.
Multi-step Methods (Adams-Bashforth, Adams-Moulton, Predictor-Corrector) and Stiff ODEs (A-Stability)
Sign in or enroll to access the full lecture notes and interactive reader.
Boundary Value Problems (BVPs): Finite Difference Discretization and the Linear Shooting Method
Sign in or enroll to access the full lecture notes and interactive reader.
Comprehensive End-of-Course Examination
Test your knowledge of Numerical Methods Software Tools
Discretization of PDEs: Elliptic (Poisson/Laplace), Parabolic (Heat Equation/Crank-Nicolson), and Hyperbolic PDEs
Sign in or enroll to access the full lecture notes and interactive reader.
Numerical Optimization Fundamentals: Unconstrained Optimization, Golden Section Search, Gradient Descent, and Quasi-Newton (BFGS)
Sign in or enroll to access the full lecture notes and interactive reader.
Academic Ecosystem & Connected Pathways
Deepen your studies across connected learning pathways in the PAMCET academic network:
Instructor
PAMCET Learning Team
Institutional Course Curation · PAMCET
Qualifications:
PAMCET Learning Team — Institutional Course Curation, Digitpen Hub LtdMy Skills:
- Curriculum Curation
- Course Content Review
- Learning Outcome Design
- Course Publishing & Quality Assurance
- Platform Content Operations
Reviews
Course Includes
Download Syllabus & Study Guide
Receive the full lecture syllabus, reading list, and milestone schedule for Numerical Methods.
By submitting, you agree to receive educational updates. You can unsubscribe anytime. Read our Privacy Policy.

