1. Basic Concept, 2. Important Multiple choice QA, 3.Important 3 marks QA, 4. Important 12 marks QA, 5. Model Question paper.

1




Important Questions and Answers
MA25C07- Advanced Mathematical Methods (CSIE)
Syllabus
1. Linear Algebra: Vector spaces, norms, Inner Products, Eigenvalues using QR
transformations, QR factorization, generalized eigenvectors, Canonical forms, singular value
decomposition and applications, pseudo inverse, least square approximations.
2. Multivariate Analysis: Random vectors and matrices, Mean vectors and covariance
matrices, Multivariate normal density and its properties, Principal components, Population
principal components, Principal components from standardized variables.
3. Elementary Number Theory: The division algorithm, Divisibility and the Euclidean
algorithm, The fundamental theorem of arithmetic, Modular arithmetic and basic properties
of congruences; Principles of mathematical induction and well ordering principle. Primality
Testing algorithms, Chinese Remainder Theorem, Quadratic Congruence.
4. Advanced Number Theory: Advanced Number Theory, Primality Testing algorithms,
Chinese Remainder Theorem, Quadratic Congruence, Discrete Logarithm, Factorization
Methods, Side Channel Attacks, Shannon Theory, Perfect Secrecy, Semantic Security.
S.No. Description
Unit-I
Linear Algebra
Basic Concepts
1. Vector Spaces

A vector space is a set of vectors closed under vector addition and scalar multiplication. It contains a
zero vector and satisfies the vector space axioms.
V.
U
m




 Linear combination: v = a₁v₁ + a₂v₂ + ... + aₙvₙ
ap




 Linear independence: a₁v₁ + ... + aₙvₙ = 0 implies all aᵢ = 0.
at




 Basis: A linearly independent set that spans the vector space.
hy




 Dimension: Number of vectors in a basis.
,Pr
of
./
EC
N
ot
es

, 2



2. Norms and Inner Products

A norm measures the length or magnitude of a vector.

 Euclidean norm: ||x||₂ = √(x₁² + x₂² + ... + xₙ²)
 Inner product: = x₁y₁ + x₂y₂ + ... + xₙyₙ
 Orthogonality: = 0
 Distance: d(x, y) = ||x − y||₂

3. Eigenvalues and Eigenvectors

For a square matrix A, an eigenvector x is a nonzero vector whose direction remains unchanged under
multiplication by A.

 Eigenvalue equation: Ax = λx
 Characteristic equation: det(A − λI) = 0
 Eigenvectors are obtained by solving: (A − λI)x = 0.
 QR eigenvalue method: Factor Aₖ = QₖRₖ, then calculate Aₖ₊₁ = RₖQₖ. Repeating this process
approximates the eigenvalues.

4. QR Factorization

QR factorization expresses a matrix A as the product of an orthogonal matrix Q and an upper
triangular matrix R.

 Formula: A = QR
 Orthogonality: QᵀQ = I
 R is an upper triangular matrix.
 Applications: Solving linear systems, least-squares problems and eigenvalue computations.

5. Generalized Eigenvectors

Generalized eigenvectors are used when a matrix does not have enough linearly independent ordinary
V.




eigenvectors.
U
m




Generalized eigenvector equation: (A − λI)ᵏx = 0
ap





For k = 1, x is an ordinary eigenvector.
at





hy




 Applications: Jordan canonical form and analysis of linear systems.
,Pr
of
./
EC
N
ot
es

, 3



6. Canonical Forms

Canonical forms represent matrices in simplified standard forms under suitable transformations.

 Diagonalization: A = PDP⁻¹
 Jordan form: A = PJP⁻¹
 D contains eigenvalues on its diagonal.
 J contains eigenvalues and may have ones immediately above the diagonal.
 Applications: Computing matrix powers and solving differential equations.

7. Singular Value Decomposition (SVD)

SVD decomposes any real matrix into orthogonal matrices and a diagonal matrix of singular values.

 Formula: A = UΣVᵀ
 U: Left singular vectors.
 V: Right singular vectors.
 Σ: Diagonal matrix of non-negative singular values.
 Applications: Image compression, noise reduction, dimensionality reduction and data analysis.

8. Pseudo-Inverse

The Moore–Penrose pseudo-inverse provides a generalized inverse for square or rectangular matrices.

 Formula: A⁺ = VΣ⁺Uᵀ
 For a nonzero singular value σᵢ, its reciprocal is 1/σᵢ.
 Zero singular values remain zero in Σ⁺.
 Application: Obtaining minimum-norm solutions to linear systems.

9. Least-Squares Approximation

Least-squares approximation finds a vector x that minimizes the difference between Ax and b when
an exact solution may not exist.
V.
U




 Objective: Minimize ||Ax − b||₂²
m




Normal equations: AᵀAx = Aᵀb
ap





If AᵀA is invertible: x = (AᵀA)⁻¹Aᵀb
at





hy




 General solution: x = A⁺b
,




Applications: Regression, curve fitting, experimental data analysis and engineering
Pr





of
./
EC
N
ot
es

, 4


calculations.

Important exam formulas to remember: Ax = λx, det(A − λI) = 0, A = QR, A = PJP⁻¹, A = UΣVᵀ, A⁺
= VΣ⁺Uᵀ, and AᵀAx = Aᵀb.

Multiple Choice QA
V.
U
m
ap
at
hy
,
Pr
of
./
EC
N
ot
es