🇮🇳 CSIR NET Physical Sciences · subject

CSIR NET Physical Sciences Mathematical Methods of Physics Syllabus

The Mathematical Methods of Physics syllabus for CSIR NET Physical Sciences in full: 10 chapters and 18 topics, every one listed below, plus 51 Mathematical Methods of Physics flashcards with answers.

10Chapters
18Topics
51Flashcards

Mathematical Methods of Physics syllabus: all 10 chapters

Expand any chapter to see its topics and sub-topics.

  1. Dimensional Analysis

    overview

    No separate topics listed for this chapter.

  2. Vector Algebra and Vector Calculus

    overview

    No separate topics listed for this chapter.

  3. Linear Algebra

    3 topics
    • Matrices
    • Cayley-Hamilton Theorem
    • Eigenvalues and Eigenvectors
  4. Linear Ordinary Differential Equations

    2 topics
    • First Order
    • Second Order
  5. Special Functions

    4 topics
    • Hermite Functions
    • Bessel Functions
    • Laguerre Functions
    • Legendre Functions
  6. Fourier Series

    overview

    No separate topics listed for this chapter.

  7. Fourier and Laplace Transforms

    overview

    No separate topics listed for this chapter.

  8. Elements of Complex Analysis

    5 topics
    • Analytic Functions
    • Taylor Series
    • Laurent Series
    • Poles and Residues
    • Evaluation of Integrals
  9. Elementary Probability Theory

    4 topics
    • Random Variables
    • Binomial Distribution
    • Poisson Distribution
    • Normal Distribution
  10. Central Limit Theorem

    overview

    No separate topics listed for this chapter.

CSIR NET Physical Sciences Mathematical Methods of Physics flashcards — 51 questions with answers

  1. What is a partial differential equation (PDE), and what distinguishes its order and linearity?

    A PDE is an equation involving an unknown function of two or more independent variables and its partial derivatives. Its order is the order of the highest derivative; it is linear if the unknown function and all its derivatives appear to the first power with coefficients depending only on the independent variables, e.g. $a\,u_{xx}+b\,u_{xy}+c\,u_{yy}+\dots=f$.

  2. How are second-order linear PDEs of the form $Au_{xx}+Bu_{xy}+Cu_{yy}+\dots=0$ classified?

    By the discriminant $B^{2}-4AC$: elliptic if $B^{2}-4AC<0$ (e.g. Laplace), parabolic if $B^{2}-4AC=0$ (e.g. heat), and hyperbolic if $B^{2}-4AC>0$ (e.g. wave).

  3. Write the Laplace equation in three dimensions and state what kind of PDE it is.

    $$\nabla^{2}\phi=\frac{\partial^{2}\phi}{\partial x^{2}}+\frac{\partial^{2}\phi}{\partial y^{2}}+\frac{\partial^{2}\phi}{\partial z^{2}}=0$$ It is a second-order linear elliptic PDE; its solutions are called harmonic functions.

  4. What is Poisson's equation and how does it relate to Laplace's equation?

    $$\nabla^{2}\phi=-\rho/\varepsilon_{0}\quad(\text{or }\nabla^{2}\phi=f)$$ It is the inhomogeneous form of Laplace's equation; when the source term $f=0$ it reduces to Laplace's equation $\nabla^{2}\phi=0$.

  5. State the mean value property of harmonic functions (solutions of Laplace's equation).

    The value of a harmonic function at a point equals its average over any sphere (or circle in 2D) centered at that point. Consequently harmonic functions attain their maxima and minima only on the boundary (maximum principle).

  6. Write the one-dimensional wave equation and give its general d'Alembert solution.

    $$\frac{\partial^{2}u}{\partial t^{2}}=c^{2}\frac{\partial^{2}u}{\partial x^{2}}$$ General solution: $u(x,t)=f(x-ct)+g(x+ct)$, a superposition of right- and left-moving waves of speed $c$.

  7. Using separation of variables on $u_{tt}=c^{2}u_{xx}$ for a string of length $L$ fixed at both ends, what are the normal-mode solutions?

    $$u_{n}(x,t)=\sin\!\left(\frac{n\pi x}{L}\right)\left[A_{n}\cos\!\frac{n\pi c t}{L}+B_{n}\sin\!\frac{n\pi c t}{L}\right]$$ with allowed frequencies $\omega_{n}=\dfrac{n\pi c}{L}$, $n=1,2,3,\dots$

  8. Write the heat (diffusion) equation in two spatial dimensions.

    $$\frac{\partial u}{\partial t}=\alpha\left(\frac{\partial^{2}u}{\partial x^{2}}+\frac{\partial^{2}u}{\partial y^{2}}\right)$$ where $\alpha$ is the thermal diffusivity. It is a parabolic PDE.

  9. Write the heat equation in three spatial dimensions in compact form.

    $$\frac{\partial u}{\partial t}=\alpha\,\nabla^{2}u=\alpha\left(\frac{\partial^{2}u}{\partial x^{2}}+\frac{\partial^{2}u}{\partial y^{2}}+\frac{\partial^{2}u}{\partial z^{2}}\right)$$ with thermal diffusivity $\alpha$.

  10. For the 1D heat equation by separation of variables, what is the time dependence of each Fourier mode?

    Each spatial mode $\sin(k_{n}x)$ decays exponentially in time as $e^{-\alpha k_{n}^{2}t}$. Higher spatial frequencies decay faster, so the heat equation smooths out the temperature distribution.

  11. Contrast the qualitative behavior of solutions to the wave equation versus the heat equation.

    The wave equation (hyperbolic) propagates disturbances at finite speed $c$ without dissipation and is time-reversible. The heat equation (parabolic) diffuses/smooths disturbances, has infinite propagation speed, is dissipative and time-irreversible.

  12. In separation of variables for the 2D Laplace equation in Cartesian coordinates, what form do the separated ODEs take?

    Writing $u=X(x)Y(y)$ gives $\dfrac{X''}{X}=-\dfrac{Y''}{Y}=-k^{2}$, so $X''+k^{2}X=0$ (oscillatory) and $Y''-k^{2}Y=0$ (exponential/hyperbolic), or vice versa depending on boundary conditions.

  13. What are Dirichlet and Neumann boundary conditions for a PDE?

    Dirichlet: the value of the function $u$ is specified on the boundary. Neumann: the value of the normal derivative $\partial u/\partial n$ is specified on the boundary. (A mix of both is a Robin/mixed condition.)

  14. What is the goal of computational (numerical) techniques in physics, and why are they needed?

    They provide approximate numerical solutions to mathematical problems (root finding, integration, differential equations) that cannot be solved analytically in closed form, replacing continuous operations with discrete arithmetic the computer can perform.

  15. Distinguish round-off error from truncation error in numerical methods.

    Round-off error arises from the finite precision of representing numbers (limited significant digits). Truncation error arises from approximating an infinite/continuous process by a finite one (e.g. cutting off a Taylor series or using finite step size $h$).

  16. State the bisection method for finding a root of $f(x)=0$ and its convergence behavior.

    Given $[a,b]$ with $f(a)f(b)<0$, repeatedly take the midpoint $c=\frac{a+b}{2}$ and keep the subinterval where the sign change persists. It converges linearly; the error is halved each step, so $|x-c_{n}|\le\dfrac{b-a}{2^{n}}$.

  17. Write the Newton-Raphson iteration formula for finding a root of $f(x)=0$ and state its order of convergence.

    $$x_{n+1}=x_{n}-\frac{f(x_{n})}{f'(x_{n})}$$ It converges quadratically (order 2) near a simple root, provided $f'(x_{n})\neq0$ and the initial guess is sufficiently close.

  18. Write the secant method iteration for a root of $f(x)=0$ and give its order of convergence.

    $$x_{n+1}=x_{n}-f(x_{n})\frac{x_{n}-x_{n-1}}{f(x_{n})-f(x_{n-1})}$$ It needs no derivative and converges superlinearly with order $\approx1.618$ (the golden ratio).

  19. Compare the Newton-Raphson and bisection methods for root finding.

    Bisection always converges (if a sign change is bracketed) but only linearly. Newton-Raphson converges quadratically (faster) but requires the derivative, may fail or diverge for poor initial guesses or when $f'\approx0$, and is not guaranteed to stay bracketed.

  20. What is interpolation, and how does it differ from extrapolation?

    Interpolation estimates the value of a function at a point lying within the range of known data points. Extrapolation estimates values outside that range. Extrapolation is generally far less reliable because the assumed functional behavior is unverified beyond the data.

Show the other 31 Mathematical Methods of Physics flashcards
  1. Write the formula for linear (two-point) interpolation between points $(x_{0},y_{0})$ and $(x_{1},y_{1})$.

    $$y=y_{0}+(x-x_{0})\frac{y_{1}-y_{0}}{x_{1}-x_{0}}$$ This fits a straight line through the two data points.

  2. Write the Lagrange interpolation polynomial through $n+1$ points $(x_{i},y_{i})$.

    $$P(x)=\sum_{i=0}^{n}y_{i}\,L_{i}(x),\qquad L_{i}(x)=\prod_{\substack{j=0\\ j\neq i}}^{n}\frac{x-x_{j}}{x_{i}-x_{j}}$$ where each $L_{i}(x_{k})=\delta_{ik}$.

  3. What is Newton's forward-difference interpolation formula for equally spaced points?

    With $p=\dfrac{x-x_{0}}{h}$: $$P(x)=y_{0}+p\,\Delta y_{0}+\frac{p(p-1)}{2!}\Delta^{2}y_{0}+\frac{p(p-1)(p-2)}{3!}\Delta^{3}y_{0}+\cdots$$ where $\Delta$ is the forward-difference operator.

  4. Write the trapezoidal rule for approximating $\int_{a}^{b}f(x)\,dx$ with $n$ equal subintervals of width $h$.

    $$\int_{a}^{b}f(x)\,dx\approx\frac{h}{2}\Big[f_{0}+2(f_{1}+f_{2}+\cdots+f_{n-1})+f_{n}\Big]$$ with $h=\dfrac{b-a}{n}$. It approximates the curve by straight-line segments.

  5. What is the order of the error of the composite trapezoidal rule?

    The global error is $O(h^{2})$; explicitly $E=-\dfrac{(b-a)h^{2}}{12}f''(\xi)$. The rule is exact for linear (degree-1) polynomials.

  6. Write Simpson's 1/3 rule for $\int_{a}^{b}f(x)\,dx$ and state its requirement on the number of intervals.

    $$\int_{a}^{b}f\,dx\approx\frac{h}{3}\Big[f_{0}+4(f_{1}+f_{3}+\cdots)+2(f_{2}+f_{4}+\cdots)+f_{n}\Big]$$ It requires an even number of subintervals $n$ (odd index coefficients 4, even 2).

  7. State the error order of Simpson's 1/3 rule and which polynomials it integrates exactly.

    Global error is $O(h^{4})$, with $E=-\dfrac{(b-a)h^{4}}{180}f^{(4)}(\xi)$. It is exact for polynomials up to degree 3 (cubics), since it fits parabolas through triples of points.

  8. Compare the trapezoidal rule and Simpson's 1/3 rule in accuracy and underlying approximation.

    Trapezoidal approximates the integrand by straight lines, error $O(h^{2})$, exact for degree 1. Simpson approximates by parabolas over pairs of intervals, error $O(h^{4})$, exact up to degree 3 — substantially more accurate for the same $h$.

  9. Write Simpson's 3/8 rule and state when it is used.

    $$\int_{x_{0}}^{x_{3}}f\,dx\approx\frac{3h}{8}\big[f_{0}+3f_{1}+3f_{2}+f_{3}\big]$$ Used when the number of subintervals is a multiple of 3; it fits a cubic through four points and has error $O(h^{4})$.

  10. What is an initial value problem (IVP) for a first-order ODE?

    A problem of the form $\dfrac{dy}{dx}=f(x,y)$ with a prescribed initial condition $y(x_{0})=y_{0}$. The goal of numerical methods is to advance the solution stepwise from $x_{0}$ using step size $h$.

  11. Write Euler's method for solving $y'=f(x,y)$, $y(x_{0})=y_{0}$, and give its accuracy.

    $$y_{n+1}=y_{n}+h\,f(x_{n},y_{n})$$ It is a first-order method: local truncation error $O(h^{2})$, global error $O(h)$. It is the simplest explicit one-step method.

  12. Describe the modified Euler (Heun / improved Euler) method.

    A predictor-corrector: predict $y^{*}_{n+1}=y_{n}+h f(x_{n},y_{n})$, then correct $$y_{n+1}=y_{n}+\frac{h}{2}\big[f(x_{n},y_{n})+f(x_{n+1},y^{*}_{n+1})\big].$$ It is second-order accurate, global error $O(h^{2})$.

  13. Write the classical fourth-order Runge-Kutta (RK4) update formula.

    $$y_{n+1}=y_{n}+\frac{1}{6}(k_{1}+2k_{2}+2k_{3}+k_{4})$$ with $k_{1}=hf(x_{n},y_{n})$, $k_{2}=hf(x_{n}+\tfrac{h}{2},y_{n}+\tfrac{k_{1}}{2})$, $k_{3}=hf(x_{n}+\tfrac{h}{2},y_{n}+\tfrac{k_{2}}{2})$, $k_{4}=hf(x_{n}+h,y_{n}+k_{3})$.

  14. What is the order of accuracy of the classical RK4 method?

    RK4 has local truncation error $O(h^{5})$ and global error $O(h^{4})$ — fourth-order accurate, using four function evaluations per step.

  15. Compare Euler's method and RK4 for solving ODEs.

    Euler uses one slope evaluation per step, is first-order ($O(h)$ global error), and needs very small $h$ for accuracy. RK4 uses four evaluations per step, is fourth-order ($O(h^{4})$), giving far higher accuracy for moderate $h$ at greater cost per step.

  16. In finite-difference methods, write the central-difference approximations for the first and second derivatives.

    $$f'(x)\approx\frac{f(x+h)-f(x-h)}{2h},\qquad f''(x)\approx\frac{f(x+h)-2f(x)+f(x-h)}{h^{2}}$$ both accurate to $O(h^{2})$.

  17. Write the forward and backward first-difference approximations to $f'(x)$ and give their accuracy.

    Forward: $f'(x)\approx\dfrac{f(x+h)-f(x)}{h}$; Backward: $f'(x)\approx\dfrac{f(x)-f(x-h)}{h}$. Both are first-order accurate, $O(h)$, while the central difference is $O(h^{2})$.

  18. How is the 2D Laplace equation discretized by finite differences on a uniform grid?

    $$\nabla^{2}u\approx\frac{u_{i+1,j}+u_{i-1,j}+u_{i,j+1}+u_{i,j-1}-4u_{i,j}}{h^{2}}=0$$ giving the five-point formula $u_{i,j}=\tfrac{1}{4}(u_{i+1,j}+u_{i-1,j}+u_{i,j+1}+u_{i,j-1})$ — each interior value is the average of its four neighbors.

  19. What is a tensor, and how is its rank defined?

    A tensor is a multilinear geometric object whose components transform in a definite way under coordinate changes. Its rank (order) is the number of indices: rank 0 = scalar, rank 1 = vector, rank 2 = matrix-like (e.g. stress tensor). A rank-$n$ tensor in $d$ dimensions has $d^{n}$ components.

  20. Give the transformation laws for contravariant and covariant tensor components of rank 1.

    Contravariant: $A'^{i}=\dfrac{\partial x'^{i}}{\partial x^{j}}A^{j}$. Covariant: $A'_{i}=\dfrac{\partial x^{j}}{\partial x'^{i}}A_{j}$. Indices upstairs are contravariant, downstairs covariant; repeated upper-lower indices are summed (Einstein convention).

  21. What is the role of the metric tensor $g_{ij}$ in raising and lowering indices?

    The metric $g_{ij}$ and its inverse $g^{ij}$ convert between covariant and contravariant components: $A_{i}=g_{ij}A^{j}$ (lowering) and $A^{i}=g^{ij}A_{j}$ (raising). It also defines the line element $ds^{2}=g_{ij}\,dx^{i}dx^{j}$.

  22. Distinguish symmetric and antisymmetric tensors of rank 2.

    Symmetric: $T_{ij}=T_{ji}$ (e.g. stress, metric). Antisymmetric: $T_{ij}=-T_{ji}$, which forces diagonal elements to vanish (e.g. electromagnetic field tensor $F_{\mu\nu}$). Any rank-2 tensor decomposes into symmetric and antisymmetric parts.

  23. What is a group in the mathematical sense, and what four axioms define it?

    A set $G$ with a binary operation satisfying: (1) closure — $a\cdot b\in G$; (2) associativity — $(a\cdot b)\cdot c=a\cdot(b\cdot c)$; (3) identity — $\exists\,e$ with $e\cdot a=a$; (4) inverse — every $a$ has $a^{-1}$ with $a\cdot a^{-1}=e$.

  24. What distinguishes an Abelian group from a non-Abelian group, and which are Lie groups?

    An Abelian group has a commutative operation ($ab=ba$); non-Abelian does not. A Lie group is a continuous group whose elements depend smoothly on parameters (e.g. $SU(2)$, $O(3)$), as opposed to a discrete/finite group.

  25. What is a group representation?

    A representation is a homomorphism from a group $G$ to a set of linear operators (matrices) on a vector space, $D:G\to GL(V)$, preserving the group multiplication: $D(g_{1})D(g_{2})=D(g_{1}g_{2})$. An irreducible representation has no nontrivial invariant subspace.

  26. Define the group $SU(2)$ and state its dimension.

    $SU(2)$ is the group of $2\times2$ complex unitary matrices with determinant $+1$: $U^{\dagger}U=I$, $\det U=1$. It is a 3-parameter (3-dimensional) compact Lie group, the group of spin rotations.

  27. What are the generators of $SU(2)$ and their commutation relations?

    The generators are $J_{i}=\tfrac{1}{2}\sigma_{i}$ (half the Pauli matrices), satisfying the angular-momentum Lie algebra $$[J_{i},J_{j}]=i\,\epsilon_{ijk}J_{k}.$$ A general element is $U=e^{-i\theta\,\hat{n}\cdot\vec{J}}$.

  28. Define the group $O(3)$ and distinguish it from $SO(3)$.

    $O(3)$ is the group of real $3\times3$ orthogonal matrices ($R^{T}R=I$), with $\det R=\pm1$. $SO(3)$ is the subgroup with $\det R=+1$ (proper rotations). $O(3)$ additionally includes improper operations (reflections/inversion, $\det R=-1$).

  29. What is the relationship (homomorphism) between $SU(2)$ and $SO(3)$?

    There is a 2-to-1 homomorphism from $SU(2)$ onto $SO(3)$: each rotation in $SO(3)$ corresponds to two elements $\pm U$ in $SU(2)$. $SU(2)$ is the double cover of $SO(3)$, which is why spin-1/2 states acquire a sign change under a $2\pi$ rotation.

  30. What are the Pauli matrices, and what algebraic identity do they satisfy?

    $$\sigma_{1}=\begin{pmatrix}0&1\\1&0\end{pmatrix},\ \sigma_{2}=\begin{pmatrix}0&-i\\i&0\end{pmatrix},\ \sigma_{3}=\begin{pmatrix}1&0\\0&-1\end{pmatrix}$$ They satisfy $\sigma_{i}\sigma_{j}=\delta_{ij}I+i\epsilon_{ijk}\sigma_{k}$, are Hermitian, traceless, and unitary with $\sigma_{i}^{2}=I$.

  31. For a string fixed at both ends, how is the initial-shape coefficient $B_n$ obtained, and what role does Fourier analysis play in solving the wave/heat equations?

    The initial condition is expanded in the orthogonal eigenfunctions $\sin(n\pi x/L)$, giving the Fourier sine coefficients $$B_{n}=\frac{2}{L}\int_{0}^{L}u(x,0)\sin\!\frac{n\pi x}{L}\,dx.$$ Fourier analysis decomposes the boundary/initial data into the normal modes whose time evolution is known, then superposes them.

CSIR NET Physical Sciences Mathematical Methods of Physics FAQ

What is in the CSIR NET Physical Sciences Mathematical Methods of Physics syllabus?

CSIR NET Physical Sciences Mathematical Methods of Physics is split into 10 chapters: Dimensional Analysis, Vector Algebra and Vector Calculus, Linear Algebra, Linear Ordinary Differential Equations, Special Functions, Fourier Series, Fourier and Laplace Transforms, Elements of Complex Analysis, Elementary Probability Theory and Central Limit Theorem. Together they contain 18 topics.

How many chapters are in CSIR NET Physical Sciences Mathematical Methods of Physics?

10 chapters, containing 18 topics. The largest chapter is Elements of Complex Analysis, with 5 topics.

Are there flashcards for CSIR NET Physical Sciences Mathematical Methods of Physics?

Yes — a 51-card Mathematical Methods of Physics deck, printed in full in the flashcards section of this page and available in the Examius app with spaced repetition. The free plan covers one exam of your choice, including its flashcards; Examius Pro, a one-time purchase, unlocks every other exam and deck.