3.4 Vector Analysis, Matrices & Probability

PRC Electronics Engineering Licensure Examination Study Guide Exam

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Introduction & Board Exam Strategy

1.1 PRC ECE Licensure Exam Overview & Regulation 1.2 Table of Specifications & Exam Strategy

2 Chapter 2: Mathematics Foundations

2.1 College & Advanced Algebra 2.2 Trigonometry & Solid Mensuration 2.3 Analytic Geometry & Differential Calculus 2.4 Integral Calculus & Applications

3 Chapter 3: Advanced Mathematics for ECE

3.1 Differential Equations & Circuit Transients 3.2 Complex Numbers & Laplace Transforms 3.3 Fourier Series, Fourier Transforms & Z-Transforms 3.4 Vector Analysis, Matrices & Probability

4 Chapter 4: GEAS - Engineering Sciences & Economics

4.1 Engineering Physics & Materials Chemistry 4.2 Engineering Mechanics & Strength of Materials 4.3 Engineering Economics & Financial Analysis 4.4 Computer Fundamentals & C/C++ Programming

5 Chapter 5: GEAS - Management, Materials, Environment & CAD

5.1 Engineering Management & Technopreneurship 101 5.2 Materials Science & Engineering 5.3 Environment Science & Engineering 5.4 Computer-Aided Drawing (CAD) & Engineering Graphics

6 Chapter 6: GEAS - ECE Laws, Ethics & Contracts

6.1 Republic Act No. 9292 (Electronics Engineering Law of 2004) 6.2 ECE Code of Ethics & Professional Conduct 6.3 Contracts, Specifications & National Building Code (PD 1096)

7 Chapter 7: Electronics Engineering - Circuits & Semiconductor Diodes

7.1 DC & AC Circuit Analysis & Network Theorems 7.2 Electromagnetics & Passive Components 7.3 Semiconductor Physics & Diode Circuits 7.4 Power Supply Design & Voltage Regulators

8 Chapter 8: Electronics Engineering - Transistors & Analog Circuits

8.1 BJT Operation, Biasing & Small-Signal Amplifiers 8.2 FET Characteristics, Biasing & Amplifier Circuits 8.3 Multistage Amplifiers, Frequency Response & Power Amplifiers 8.4 Operational Amplifiers & Active Filter Design

9 Chapter 9: Electronics Engineering - Digital Electronics & Control Systems

9.1 Feedback Topologies & Oscillator Circuits 9.2 Boolean Algebra, Logic Gates & Combinational Circuits 9.3 Sequential Logic, Flip-Flops & Microprocessor Architecture 9.4 Industrial Power Electronics & Control System Theory

10 Chapter 10: EST - Communications Fundamentals & Transmission Lines

10.1 Signal Fundamentals, Decibel Calculations & Noise Analysis 10.2 Amplitude Modulation (AM) Principles & Receivers 10.3 Frequency Modulation (FM), Phase Modulation & Discriminators 10.4 Transmission Line Parameters, SWR & Smith Chart

11 Chapter 11: EST - Digital Communications, Wireless & Optical Systems

11.1 Pulse & Digital Modulation Systems 11.2 Data Communications, OSI Model & Protocols 11.3 Antenna Principles & Electromagnetic Wave Propagation 11.4 Optical Fiber, Microwave, Satellite & Philippine NTC Regulations

3.4 Vector Analysis, Matrices & Probability

Key Takeaways Explain This Topic AI

Vector calculus field operators—gradient ∇ V \nabla V ∇ V , divergence ∇ ⋅ A \nabla \cdot \mathbf{A} ∇ ⋅ A , and curl ∇ × A \nabla \times \mathbf{A} ∇ × A —form the mathematical underpinning of electromagnetic field theory and Maxwell's equations.

The Divergence Theorem connects volume integrals to closed surface fluxes, while Stokes' Theorem converts surface curl integrals to closed line integrals.

Matrix algebra techniques, including matrix inverses A − 1 A^{-1} A − 1 and Cramer's Rule, provide systematic methods for solving multi-variable linear simultaneous equations in circuit analysis.

Eigenvalues computed from det ⁡ ( A − λ I ) = 0 \det(A - \lambda I) = 0 det ( A − λ I ) = 0 determine state-space system modes, stability, and characteristic natural frequencies.

Bayes' Theorem and Gaussian (Normal) probability distributions are essential tools for analyzing noise, digital communication error probabilities, and decision thresholds.

Last updated: July 2026

3.4 Vector Analysis, Matrices & Probability

Advanced engineering mathematics integrates vector calculus for electromagnetic fields, matrix methods for multi-variable systems, and probability theory for communications and noise analysis. This section provides complete coverage of these three fundamental pillars tested in the PRC ECE Licensure Examination.

1. Vector Analysis & Field Operators in ECE

Vector calculus provides the language for Maxwell's equations and electromagnetic wave propagation. A 3D vector in Cartesian coordinates is expressed as A = A x a x + A y a y + A z a z \mathbf{A} = A_x \mathbf{a}_x + A_y \mathbf{a}_y + A_z \mathbf{a}_z A = A x ​ a x ​ + A y ​ a y ​ + A z ​ a z ​ .

1.1 Vector Algebra Foundations

Dot (Scalar) Product : A ⋅ B = A x B x + A y B y + A z B z = ∣ A ∣ ∣ B ∣ cos ⁡ θ A B \mathbf{A} \cdot \mathbf{B} = A_x B_x + A_y B_y + A_z B_z = |\mathbf{A}| |\mathbf{B}| \cos\theta_{AB} A ⋅ B = A x ​ B x ​ + A y ​ B y ​ + A z ​ B z ​ = ∣ A ∣∣ B ∣ cos θ A B ​

Cross (Vector) Product : Produces a vector perpendicular to both A \mathbf{A} A and B \mathbf{B} B : A × B = ( A y B z − A z B y ) a x + ( A z B x − A x B z ) a y + ( A x B y − A y B x ) a z \mathbf{A} \times \mathbf{B} = (A_y B_z - A_z B_y)\mathbf{a}_x + (A_z B_x - A_x B_z)\mathbf{a}_y + (A_x B_y - A_y B_x)\mathbf{a}_z A × B = ( A y ​ B z ​ − A z ​ B y ​ ) a x ​ + ( A z ​ B x ​ − A x ​ B z ​ ) a y ​ + ( A x ​ B y ​ − A y ​ B x ​ ) a z ​

1.2 The Del Operator and Differential Operators

The vector differential operator Del ( ∇ \nabla ∇ ) in Cartesian coordinates is: ∇ = a x ∂ ∂ x + a y ∂ ∂ y + a z ∂ ∂ z \nabla = \mathbf{a}_x \frac{\partial}{\partial x} + \mathbf{a}_y \frac{\partial}{\partial y} + \mathbf{a}_z \frac{\partial}{\partial z} ∇ = a x ​ ∂ x ∂ ​ + a y ​ ∂ y ∂ ​ + a z ​ ∂ z ∂ ​

Gradient of a Scalar Field V V V : Vector representing the maximum rate and direction of spatial change: ∇ V = ∂ V ∂ x a x + ∂ V ∂ y a y + ∂ V ∂ z a z \nabla V = \frac{\partial V}{\partial x}\mathbf{a}_x + \frac{\partial V}{\partial y}\mathbf{a}_y + \frac{\partial V}{\partial z}\mathbf{a}_z ∇ V = ∂ x ∂ V ​ a x ​ + ∂ y ∂ V ​ a y ​ + ∂ z ∂ V ​ a z ​

ECE Application : Electric field vector E = − ∇ V \mathbf{E} = -\nabla V E = − ∇ V .

Divergence of a Vector Field A \mathbf{A} A : Scalar measure of net outward flux per unit volume (source strength): ∇ ⋅ A = ∂ A x ∂ x + ∂ A y ∂ y + ∂ A z ∂ z \nabla \cdot \mathbf{A} = \frac{\partial A_x}{\partial x} + \frac{\partial A_y}{\partial y} + \frac{\partial A_z}{\partial z} ∇ ⋅ A = ∂ x ∂ A x ​ ​ + ∂ y ∂ A y ​ ​ + ∂ z ∂ A z ​ ​

ECE Application : Gauss's Law ∇ ⋅ D = ρ v \nabla \cdot \mathbf{D} = \rho_v ∇ ⋅ D = ρ v ​ . If ∇ ⋅ A = 0 \nabla \cdot \mathbf{A} = 0 ∇ ⋅ A = 0 , A \mathbf{A} A is solenoidal .

Curl of a Vector Field A \mathbf{A} A : Vector measure of circulation density: ∇ × A = ( ∂ A z ∂ y − ∂ A y ∂ z ) a x + ( ∂ A x ∂ z − ∂ A z ∂ x ) a y + ( ∂ A y ∂ x − ∂ A x ∂ y ) a z \nabla \times \mathbf{A} = \left(\frac{\partial A_z}{\partial y} - \frac{\partial A_y}{\partial z}\right)\mathbf{a}_x + \left(\frac{\partial A_x}{\partial z} - \frac{\partial A_z}{\partial x}\right)\mathbf{a}_y + \left(\frac{\partial A_y}{\partial x} - \frac{\partial A_x}{\partial y}\right)\mathbf{a}_z ∇ × A = ( ∂ y ∂ A z ​ ​ − ∂ z ∂ A y ​ ​ ) a x ​ + ( ∂ z ∂ A x ​ ​ − ∂ x ∂ A z ​ ​ ) a y ​ + ( ∂ x ∂ A y ​ ​ − ∂ y ∂ A x ​ ​ ) a z ​

ECE Application : Ampere's Law ∇ × H = J + ∂ D ∂ t \nabla \times \mathbf{H} = \mathbf{J} + \frac{\partial \mathbf{D}}{\partial t} ∇ × H = J + ∂ t ∂ D ​ . If ∇ × A = 0 \nabla \times \mathbf{A} = \mathbf{0} ∇ × A = 0 , A \mathbf{A} A is irrotational (conservative).

1.3 Fundamental Integral Theorems

Theorem Name Mathematical Statement Physical Significance

Divergence Theorem (Gauss) ∭ V ( ∇ ⋅ A ) d V = ∬ S A ⋅ d S \iiint_V (\nabla \cdot \mathbf{A}) dV = \iint_S \mathbf{A} \cdot d\mathbf{S} ∭ V ​ ( ∇ ⋅ A ) d V = ∬ S ​ A ⋅ d S Converts volume integral to surface flux integral

Stokes' Theorem ∬ S ( ∇ × A ) ⋅ d S = ∮ C A ⋅ d l \iint_S (\nabla \times \mathbf{A}) \cdot d\mathbf{S} = \oint_C \mathbf{A} \cdot d\mathbf{l} ∬ S ​ ( ∇ × A ) ⋅ d S = ∮ C ​ A ⋅ d l Converts surface curl to closed line integral

2. Matrix Algebra & Linear Systems

Simultaneous linear equations arising from multi-loop mesh and nodal circuit analyses are solved systematically using matrix operations.

2.1 Determinants & Matrix Inversion

For a 2 × 2 2 \times 2 2 × 2 matrix A = [ a b c d ] A = \begin{bmatrix} a & b \\ c & d \end{bmatrix} A = [ a c ​ b d ​ ] , det ⁡ ( A ) = a d − b c \det(A) = ad - bc det ( A ) = a d − b c . The inverse exists if det ⁡ ( A ) ≠ 0 \det(A) \ne 0 det ( A )  = 0 : A − 1 = 1 det ⁡ ( A ) [ d − b − c a ] A^{-1} = \frac{1}{\det(A)} \begin{bmatrix} d & -b \\ -c & a \end{bmatrix} A − 1 = det ( A ) 1 ​ [ d − c ​ − b a ​ ]

For an N × N N \times N N × N matrix A A A , the general inverse is given by the adjugate matrix formula: A − 1 = 1 det ⁡ ( A ) adj ( A ) = 1 det ⁡ ( A ) [ C i j ] T A^{-1} = \frac{1}{\det(A)} \text{adj}(A) = \frac{1}{\det(A)} [C_{ij}]^T A − 1 = det ( A ) 1 ​ adj ( A ) = det ( A ) 1 ​ [ C ij ​ ] T

Where C i j = ( − 1 ) i + j M i j C_{ij} = (-1)^{i+j} M_{ij} C ij ​ = ( − 1 ) i + j M ij ​ represents the cofactor of element a i j a_{ij} a ij ​ .

2.2 Eigenvalues and Eigenvectors

For a square matrix A A A , non-zero vector x \mathbf{x} x and scalar λ \lambda λ satisfying A x = λ x A \mathbf{x} = \lambda \mathbf{x} A x = λ x define eigenvectors and eigenvalues . Eigenvalues are roots of the characteristic polynomial : det ⁡ ( A − λ I ) = 0 \det(A - \lambda I) = 0 det ( A − λ I ) = 0

In continuous-time state-space models x ˙ = A x + B u \dot{\mathbf{x}} = A \mathbf{x} + B \mathbf{u} x ˙ = A x + B u , eigenvalues of state matrix A A A define natural system modes and stability.

3. Probability Theory & Random Variables

Communications engineering relies heavily on probability theory for noise modeling, bit error rate (BER) calculation, and signal detection.

3.1 Conditional Probability & Bayes' Theorem

For two events A A A and B B B with P ( B ) > 0 P(B) > 0 P ( B ) > 0 , conditional probability is defined as: P ( A ∣ B ) = P ( A ∩ B ) P ( B ) P(A|B) = \frac{P(A \cap B)}{P(B)} P ( A ∣ B ) = P ( B ) P ( A ∩ B ) ​

Bayes' Theorem calculates posterior probabilities from prior information: P ( A i ∣ B ) = P ( B ∣ A i ) P ( A i ) ∑ j = 1 k P ( B ∣ A j ) P ( A j ) P(A_i|B) = \frac{P(B|A_i) P(A_i)}{\sum_{j=1}^{k} P(B|A_j) P(A_j)} P ( A i ​ ∣ B ) = ∑ j = 1 k ​ P ( B ∣ A j ​ ) P ( A j ​ ) P ( B ∣ A i ​ ) P ( A i ​ ) ​

3.2 Discrete Probability Distributions

Binomial Distribution : Models k k k successes in n n n independent Bernoulli trials with success probability p p p : P ( X = k ) = ( n k ) p k ( 1 − p ) n − k , μ = n p , σ 2 = n p ( 1 − p ) P(X = k) = \binom{n}{k} p^k (1 - p)^{n-k}, \quad \mu = n p, \quad \sigma^2 = n p (1 - p) P ( X = k ) = ( k n ​ ) p k ( 1 − p ) n − k , μ = n p , σ 2 = n p ( 1 − p )

Poisson Distribution : Models event counts occurring at average rate λ \lambda λ : P ( X = k ) = λ k e − λ k ! , μ = λ , σ 2 = λ P(X = k) = \frac{\lambda^k e^{-\lambda}}{k!}, \quad \mu = \lambda, \quad \sigma^2 = \lambda P ( X = k ) = k ! λ k e − λ ​ , μ = λ , σ 2 = λ

3.3 Continuous Gaussian (Normal) Distribution

The Gaussian Distribution describes Thermal (Additive White Gaussian) Noise in communication channels: f ( x ) = 1 2 π σ 2 exp ⁡ ( − ( x − μ ) 2 2 σ 2 ) f(x) = \frac{1}{\sqrt{2\pi\sigma^2}} \exp\left( -\frac{(x - \mu)^2}{2\sigma^2} \right) f ( x ) = 2 π σ 2 ​ 1 ​ exp ( − 2 σ 2 ( x − μ ) 2 ​ )

Transforming to the Standard Normal Variable Z Z Z : Z = X − μ σ ∼ N ( 0 , 1 ) Z = \frac{X - \mu}{\sigma} \sim \mathcal{N}(0, 1) Z = σ X − μ ​ ∼ N ( 0 , 1 )

The tail probability is computed using the Q-Function : Q ( x ) = 1 2 π ∫ x ∞ e − u 2 / 2 d u Q(x) = \frac{1}{\sqrt{2\pi}} \int_{x}^{\infty} e^{-u^2/2} du Q ( x ) = 2 π ​ 1 ​ ∫ x ∞ ​ e − u 2 /2 d u

In digital communications, Bit Error Rate (BER) for binary signaling is evaluated as P e = Q ( 2 E b N 0 ) P_e = Q\left(\sqrt{\frac{2 E_b}{N_0}}\right) P e ​ = Q ( N 0 ​ 2 E b ​ ​ ​ ) .

• 4. PRC ECE Board Exam Worked Examples
• Worked Example 1: Vector Field Divergence & Curl Evaluation

Problem: Given vector field A = x 2 y a x − 2 x z a y + 3 y z 2 a z \mathbf{A} = x^2 y \mathbf{a}_x - 2 x z \mathbf{a}_y + 3 y z^2 \mathbf{a}_z A = x 2 y a x ​ − 2 x z a y ​ + 3 y z 2 a z ​ , calculate ∇ ⋅ A \nabla \cdot \mathbf{A} ∇ ⋅ A at point P ( 1 , 2 , 3 ) P(1, 2, 3) P ( 1 , 2 , 3 ) .

Solution:

Compute the divergence partial derivatives: ∇ ⋅ A = ∂ ∂ x ( x 2 y ) + ∂ ∂ y ( − 2 x z ) + ∂ ∂ z ( 3 y z 2 ) \nabla \cdot \mathbf{A} = \frac{\partial}{\partial x}(x^2 y) + \frac{\partial}{\partial y}(-2 x z) + \frac{\partial}{\partial z}(3 y z^2) ∇ ⋅ A = ∂ x ∂ ​ ( x 2 y ) + ∂ y ∂ ​ ( − 2 x z ) + ∂ z ∂ ​ ( 3 y z 2 ) ∇ ⋅ A = 2 x y + 0 + 6 y z = 2 x y + 6 y z \nabla \cdot \mathbf{A} = 2 x y + 0 + 6 y z = 2 x y + 6 y z ∇ ⋅ A = 2 x y + 0 + 6 yz = 2 x y + 6 yz

Substitute point coordinates ( x = 1 , y = 2 , z = 3 ) (x=1, y=2, z=3) ( x = 1 , y = 2 , z = 3 ) : ∇ ⋅ A ∣ P = 2 ( 1 ) ( 2 ) + 6 ( 2 ) ( 3 ) = 4 + 36 = 40 \nabla \cdot \mathbf{A}\big|_{P} = 2(1)(2) + 6(2)(3) = 4 + 36 = 40 ∇ ⋅ A ​ P ​ = 2 ( 1 ) ( 2 ) + 6 ( 2 ) ( 3 ) = 4 + 36 = 40

Worked Example 2: Bayes' Theorem in Binary Signal Transmission

Problem: A digital transmitter sends bit '0' with probability 0.6 0.6 0.6 and bit '1' with probability 0.4 0.4 0.4 . Noise causes bit errors such that P ( Receive 1 ∣ Sent 0 ) = 0.05 P(\text{Receive 1}|\text{Sent 0}) = 0.05 P ( Receive 1 ∣ Sent 0 ) = 0.05 and P ( Receive 0 ∣ Sent 1 ) = 0.10 P(\text{Receive 0}|\text{Sent 1}) = 0.10 P ( Receive 0 ∣ Sent 1 ) = 0.10 . If bit '1' is received, calculate the probability that bit '1' was actually transmitted.

Solution:

Define events: T 0 , T 1 T_0, T_1 T 0 ​ , T 1 ​ (transmitted), R 0 , R 1 R_0, R_1 R 0 ​ , R 1 ​ (received).

Given: P ( T 0 ) = 0.6 P(T_0) = 0.6 P ( T 0 ​ ) = 0.6 , P ( T 1 ) = 0.4 P(T_1) = 0.4 P ( T 1 ​ ) = 0.4 , P ( R 1 ∣ T 0 ) = 0.05 P(R_1|T_0) = 0.05 P ( R 1 ​ ∣ T 0 ​ ) = 0.05 , P ( R 1 ∣ T 1 ) = 1 − 0.10 = 0.90 P(R_1|T_1) = 1 - 0.10 = 0.90 P ( R 1 ​ ∣ T 1 ​ ) = 1 − 0.10 = 0.90 .

Calculate total probability of receiving '1': P ( R 1 ) = P ( R 1 ∣ T 1 ) P ( T 1 ) + P ( R 1 ∣ T 0 ) P ( T 0 ) P(R_1) = P(R_1|T_1)P(T_1) + P(R_1|T_0)P(T_0) P ( R 1 ​ ) = P ( R 1 ​ ∣ T 1 ​ ) P ( T 1 ​ ) + P ( R 1 ​ ∣ T 0 ​ ) P ( T 0 ​ ) P ( R 1 ) = ( 0.90 ) ( 0.4 ) + ( 0.05 ) ( 0.6 ) = 0.36 + 0.03 = 0.39 P(R_1) = (0.90)(0.4) + (0.05)(0.6) = 0.36 + 0.03 = 0.39 P ( R 1 ​ ) = ( 0.90 ) ( 0.4 ) + ( 0.05 ) ( 0.6 ) = 0.36 + 0.03 = 0.39

Apply Bayes' Theorem to find posterior probability P ( T 1 ∣ R 1 ) P(T_1|R_1) P ( T 1 ​ ∣ R 1 ​ ) : P ( T 1 ∣ R 1 ) = P ( R 1 ∣ T 1 ) P ( T 1 ) P ( R 1 ) = 0.36 0.39 = 12 13 ≈ 0.9231 ( 92.31 % ) P(T_1|R_1) = \frac{P(R_1|T_1)P(T_1)}{P(R_1)} = \frac{0.36}{0.39} = \frac{12}{13} \approx 0.9231 \quad (92.31\%) P ( T 1 ​ ∣ R 1 ​ ) = P ( R 1 ​ ) P ( R 1 ​ ∣ T 1 ​ ) P ( T 1 ​ ) ​ = 0.39 0.36 ​ = 13 12 ​ ≈ 0.9231 ( 92.31% )