Abstract Algebra Algebra Algebraic Geometry Algebraic Topology Applied Mathematics Arithmetic Geometry Basic Algebra Basic Mathematics Calculus Category Theory Classical Analysis Combinatorics Commutative Algebra Complex Algebra Complex Analysis Differential Algebra Differential Analysis Differential Calculus Differential Equations Differential Geometry Differential Topology Discrete Mathematics Elliptic Curves Fourier Analysis Functional Analysis Fractals Fractional Calculus Geometric Algebra Geometry Geometric Topology Groups Theory Graph Theory Harmonic Analysis Higher Algebra History of Mathematics Homological Algebra Integral Calculus K-theory Lie Algebra Linear Algebra Mathematical Analysis Mathematical Series Modern Geometry Multivairable Calculus Number Theory Numerical Analysis Probability Theory Real Analysis Rings and Fileds Riemannian Geometry Theorems in Calculus Topology Trigonometry Set Theory Constants & Numerical Sequences
Mathematics and Computation
This lecture note covers the following topics: Prelude: computation, undecidability and the limits of mathematical knowledge, Computational complexity 101: the basics, Problems and classes inside N P, Lower bounds, Boolean Circuits, and attacks on P vs. NP, Proof complexity, Randomness in computation, Abstract pseudo-randomness, Weak random sources and randomness extractors, Randomness in proof, Randomness in proofs, Arithmetic complexity, Interlude: Concrete interactions between Math and Computational Complexity.
Author(s): Avi Wigderson
372 Pages 
Computational Mathematics An Introduction by I Liang Chern
This note explains the following topics: solving equations of one variable, Basic numerical linear algebra, Approximation theory, Numerical integration, Numerical ordinary differential equations.
Author(s): I Liang Chern, National Taiwan University
160 Pages
Computing Mathematics Lecture Notes by Dr Jon Shiach
This note covers mathematical fundamentals, Logic circuits, Algorithms and graph theory.
Author(s): Dr Jon Shiach
110 Pages
This lecture note covers the following topics: Prelude: computation, undecidability and the limits of mathematical knowledge, Computational complexity 101: the basics, Problems and classes inside N P, Lower bounds, Boolean Circuits, and attacks on P vs. NP, Proof complexity, Randomness in computation, Abstract pseudo-randomness, Weak random sources and randomness extractors, Randomness in proof, Randomness in proofs, Arithmetic complexity, Interlude: Concrete interactions between Math and Computational Complexity.
Author(s): Avi Wigderson
372 Pages
Computational Mathematics by Jose Augusto Ferreira
This lecture note explains the following topics: This Numerical Methods for ODEs, Discretizations for ODEs, The Runge-Kutta Methods, Linear Multistep Methods, Numerical Methods for PDEs, Tools of Functional Analysis, The Ritz-Galerkin Method, FDM for Time-Dependent PDES, Finite Difference Methods for Elliptic Equations, Computational Projects.
Author(s): Augusto Ferreira
177 Pages