Welcome to CSIR NET Unit 3 — Differential Equations, Numerical Methods & Mechanics
Differential equations, numerical analysis, calculus of variations, integral equations and classical mechanics at the depth CSIR NET JRF demands — theorems with proofs, live labs, and Part B / Part C problems with every option decided. Here is how the course works and how to use it, alone or in a classroom.
1. Who this course is for
This course covers Unit 3 of the CSIR NET JRF Mathematical Sciences syllabus: ordinary and partial differential equations, numerical analysis, the calculus of variations, linear integral equations and classical mechanics. It is written for two kinds of reader at once.
🎓 Students
MSc students and final-year BSc students preparing for CSIR NET JRF, GATE MA or a university MSc examination, studying on their own. You should know BSc calculus, the elementary methods for differential equations, matrices and some mechanics; the theory is built up from there, with proofs.
🧑🏫 Teachers
College and university teachers who want a rigorous classroom text: every section comes with a lesson plan, discussion questions, the misconceptions to watch for, a suggested homework set, and two interactive labs to project in class.
Unit 3 is the most varied unit of the paper, and it is tempting to learn it as a list of recipes — Charpit's method, Simpson's rule, the Euler–Lagrange equation, the resolvent kernel. CSIR Part C does not reward recipes. It asks whether an initial value problem has a unique solution on the whole line, whether a boundary value problem has a solution at all, whether a numerical method converges and at what rate, whether an extremal is really a minimum. So we state every theorem with its hypotheses, prove the central results, and collect in a ⚠️ box the counterexamples that show what goes wrong when a hypothesis is dropped.
2. Two ways to use the course
- Read with a pencil. Copy each definition and theorem into a notebook; for every theorem write down one equation that satisfies the hypotheses and one that does not.
- Derive before you read. Most results in this unit are derivations — the Euler–Lagrange equation, the error of Simpson's rule, Lagrange's equations of motion. Try each one for five minutes before reading it.
- Cover the solutions. Attempt every worked example before opening "💡 Show solution"; if you are stuck, open one step at a time.
- Play with the labs — predict what will happen (will the iterates converge? will the solution blow up? which mode will dominate?) before you press Play.
- Exercises, then the Exam corner. Do at least the homework set in the 🧑🏫 box. For every Part C problem, decide every option and write the reason or counterexample in one line.
- Compute to check. Many answers in this unit can be confirmed numerically in a few lines of Python or a spreadsheet; the 🔬 Research–Teaching Nexus projects show how.
Each section is planned for two or three lectures of about an hour. The 🧑🏫 For the teacher box at the end of the section says which theorems to prove on the board, which examples to work, when to project which lab, and which Exam-corner problems to do live. The labs work on a projector or a phone, need no installation and no internet once the page has loaded. The worked solutions are hidden by default, so a page can be projected while students attempt a problem. Exercises are solved in full; use them for tutorials, and the Exam corner for class tests.
3. What every section contains
- Motivation — why the idea matters, where it is used, and how it is examined.
- Teaching in coloured boxes: 📘 definitions, 📐 theorems stated with all their hypotheses and followed by a Proof, 🧭 problem-solving strategies, and a ⚠️ Counterexamples and pitfalls box listing the standard traps.
- ✏️ Worked examples (five to seven per section), mixing computations with "prove or disprove" problems, each with a full step-by-step solution.
- Two interactive labs that show the idea moving: Picard iterates closing in on a solution, an envelope swept out by straight lines, characteristics carrying data into a PDE, Fourier modes of a vibrating string, Newton's method zooming in on a root, coupled pendulums exchanging energy.
- Exercises — 25 to 40 parts from routine to research-flavoured, every one solved.
- 🎯 Exam corner — six original problems: E1–E3 in the style of CSIR Part B (one correct option) and E4–E6 in the style of Part C (one or more correct options), with every option decided.
- 🧑🏫 For the teacher, a 🔬 Research–Teaching Nexus mini-project, and a 🧪 five-question quiz.
Words with a dotted underline are in the Glossary — hover or tap for the meaning. Every key result is collected in the Formula Sheet, which you can search.
4. The CSIR NET examination in brief
The Joint CSIR–UGC NET in Mathematical Sciences is a single computer-based paper of multiple-choice questions in three parts:
- Part A — general aptitude: logical reasoning, graphical analysis, numerical ability and puzzles. Common to all subjects; not covered by this course.
- Part B — mathematics, each question with exactly one correct option. Questions test one idea quickly: a computation, a definition, a standard result.
- Part C — mathematics at greater depth, where one or more of the options may be correct and all the correct options must be chosen. A single overlooked counterexample costs the whole question, so Part C rewards precise knowledge of hypotheses.
In Parts B and C the questions are spread over the four units of the syllabus, and candidates answer a prescribed number of the questions offered. The number of questions, the marks per question, the duration and the negative-marking rules have changed over the years and differ between parts: always check the latest official notification for the exam session you are taking. Many problems in this course also fit GATE MA, and are tagged so.
Treat each option as a separate true/false question. For a "true" option, know the theorem that proves it — with its hypotheses. For a "false" option, have a specific counterexample ready: "$y'=3y^{2/3}$, $y(0)=0$ has infinitely many solutions", "$y'=y^2$ blows up although $f$ is smooth", "$u''+u=0$, $u(0)=u(\pi)=0$ has infinitely many solutions", "Newton's method converges only linearly at a double root". The ⚠️ boxes of each section are designed to be learned as such a list.
5. A first taste: one oscillator, eight chapters
Before any theory, here is how the chapters of this course talk to each other. The simplest vibrating system — a mass on a spring, $\ddot x=-x$ — has the exact solution $x=\cos t$, $v=\dot x=-\sin t$, which runs around the unit circle in the $(x,v)$-plane for ever, conserving the energy $E=\tfrac12(x^2+v^2)$. A computer does not know this. It steps forward with a rule such as Euler's, and the lab shows what each rule does to the energy.
Chapter 1 — existence and systems
As the system $\dot x=v$, $\dot v=-x$ with a Lipschitz right-hand side, the motion through each initial state exists for all time and is unique: two orbits never cross.
Chapter 2 — linear theory
$\cos t$ and $\sin t$ form a fundamental set with Wronskian $1$; a forcing term is handled by variation of parameters, and $u''+\lambda u=0$ on $[0,\pi]$ is the model Sturm–Liouville problem.
Chapter 4 — vibrating strings
Separating variables in the wave equation $u_{tt}=c^2u_{xx}$ produces one such oscillator for each Fourier mode $\sin(n\pi x/L)$.
Chapter 5 — numerical methods
Euler multiplies the energy by $1+h^2$ at every step, Heun by $1+\tfrac{h^4}{4}$, RK4 by $1-\tfrac{h^6}{72}+\tfrac{h^8}{576}$ — orders $1$, $2$, $4$ made visible.
Chapter 6 — variations
$x=\cos t$ makes the action $\int\tfrac12(\dot x^2-x^2)\,dt$ stationary: its Euler–Lagrange equation is $\ddot x+x=0$.
Chapter 8 — mechanics
$L=\tfrac12\dot x^2-\tfrac12x^2$ and $H=\tfrac12(p^2+x^2)$: Hamilton's equations are the system above, $H$ is conserved, and small oscillations of any system decompose into such normal modes.
6. Map of the course
The eight chapters follow the official Unit 3 syllabus. Each chapter page opens with a short overview, the outcomes, a teaser lab, a paragraph on how the chapter is examined, and the list of its sections.
First-Order Ordinary Differential Equations
Existence and uniqueness, Picard iterates, blow-up, Gronwall; singular solutions and Clairaut's equation; systems and phase portraits.
Linear Ordinary Differential Equations
General theory, Wronskians, variation of parameters, series solutions; Sturm–Liouville problems and Green's functions.
First-Order Partial Differential Equations
Formation of PDEs, Lagrange's method, Charpit's method, complete and singular integrals, the Cauchy problem.
Second-Order Partial Differential Equations
Classification and canonical forms, constant-coefficient equations, separation of variables for Laplace, heat and wave equations.
Numerical Analysis
Roots and rates of convergence, Gauss elimination and Gauss–Seidel, interpolation, quadrature, numerical solution of ODEs.
Calculus of Variations
Functionals, the Euler–Lagrange equation, isoperimetric problems, sufficient conditions, Rayleigh–Ritz.
Linear Integral Equations
Fredholm and Volterra equations, separable kernels, characteristic numbers, the resolvent kernel.
Classical Mechanics
Lagrange's and Hamilton's equations, variational principles, rigid bodies and Euler's equations, small oscillations.
The other three units of the syllabus are covered by the sister courses CSIR NET Unit 1 — Analysis and Linear Algebra (which this course uses constantly: uniform convergence, the mean value and implicit function theorems, eigenvalues), CSIR NET Unit 2 — Complex Analysis, Algebra and Topology, and CSIR NET Unit 4 — Statistics, Probability and Operations Research.
7. Conventions
- $\mathbb{N}=\{1,2,3,\dots\}$ does not contain $0$. $\log x$ is the natural logarithm. Intervals are written $[a,b]$, $(a,b)$, $[a,b)$.
- For ODEs, $y'=\tfrac{dy}{dx}$, and in Chapter 1 also $p=y'$. In mechanics a dot is a time derivative, $\dot q=\tfrac{dq}{dt}$. For PDEs, $u_x=\tfrac{\partial u}{\partial x}$, and in Chapter 3 $p=z_x$, $q=z_y$.
- "Iff" means "if and only if". A theorem stated with "if" claims one direction only — the converse is often false, and Part C knows it.
- Definitions and theorems are numbered by chapter (Definition 1.4, Theorem 1.12). Results in other sections are referred to by section number and name, e.g. "the Picard–Lindelöf theorem (§1.1)".
- Proofs end with ∎. "Proof (sketch)" means every key step is named but routine details are left to the reader.
- Numerical answers are given to a stated number of decimal places or significant figures; applied answers carry SI units.
Where to begin. Start with Chapter 1 — First-Order Ordinary Differential Equations. Its first section, on existence and uniqueness, sets up the language — Lipschitz conditions, iteration, maximal intervals — that every later chapter uses, from integral equations to numerical methods.