

Numerical solutions of initial value problems for ordinary differential equations (ODE), Picard-Lindelof theorem, single step methods including Runge-Kutta methods, examples and consistency, stability and convergence of multistep methods, numerical solution of boundary value problems for ODE’s, shooting, finite difference, and collocation methods, finite element methods, Riesz and Lax-Milgram lemmas, weak solutions, numerical solutions of partial differential equations, examples of finite difference methods and their consistency, stability, and convergence including Lax-Richtmeyer equivalence theorem, Courant-Friedrichs-Lewy condition, and von Neumann analysis, Galerkin methods, Galerkin orthogonality, Cea’s lemma, finite element methods for elliptic, parabolic and hyperbolic equations.ĭynamical systems with discrete and continuous time, differential equations on torus, invariant sets, topological dynamics, topological recurrence and entropy, expansive maps, homoemorphisms and diffeomorphisms of the circle, periodic orbits, hyperbolic dynamics, Grobman-Hartman and Hadamard-Perron theorems, geodesic flows, topological Markov chains, zeta functions, invariant measures and the ergodic theorem.įirst variation of a functional, necessary conditions for an extremum of a functional, Euler's equation, fixed and moving endpoint problems, isoperimetric problems, problems with constraints, Legendre transformation, Noether's theorem, Jacobi's theorem, second variation of a functional, weak and strong extremum, sufficient conditions for an extremum, direct methods in calculus of variations, the principle of least action, conservation laws, Hamilton-Jacobi equation. Simple crypto-systems, public key cryptography, discrete logarithms and Diffie-Hellman key exchange, primality, factoring and RSA, elliptic curve crypto-systems, lattice based crypto-systems. #Cardinal chains 6 0 solution software#.
