S1 / Electrical Fundamentals
Per-Phase Equivalent Circuit 01
⟹3-phase power=3∣Vl∣∣Il∣cosθ Symbols
- cosθ
- power factor
Mean Value 02
vmean=T1∫T0T0+Tv(t)dt Symbols
- T0
- the starting time of a cycle
Equation 03
C=dϵA Symbols
- ϵ
- permittivity of the material in-between
- d
- distance between the plates
Impedance (Z) 04
Z=IV=R+jX Admittance (Y) 05
Y=Z1=VI=G+jB Inductance (L) 06
v=−Ldtdi Symbols
- v
- voltage difference across the inductor
- i
- current through the inductor
Equation 07
R=Aρl S1 / Fluid Mechanics
Continuity Equation 01
Bernoulli's Equation 02
Total head H=z+ρgP+2gv2 Symbols
- z
- datum head, the height to the point from a reference level
- 2gv2
- velocity head, the kinetic energy per unit weight
Steady Flow Momentum Equation 03
FS=Mo˙−Mi˙ Symbols
- FS
- Force exerted on the fluid within the control volume
- Mo˙
- Rate of change of momentum of the inflow fluid
- Mi˙
- Rate of change of momentum of the outflow fluid
Steady Flow Momentum Equation 04
M˙=ρQv Symbols
- M˙
- rate of change of momentum
Power 05
Symbols
- γ
- specific weight of the fluid
Local Loss 06
KL2gv2 Symbols
- KL
- local loss coefficient
- g
- gravitational acceleration
Friction Loss 07
λDL2gv2 Symbols
- λ
- friction factor
- g
- gravitational acceleration
Head Provided 08
Impulse Turbines 09
μ=v121(2u)(v1−u)(1+kcosβ) Symbols
- v1
- velocity of the jet of fluid
- u
- velocity of the bucket
- k
- loss coefficient (a little less than 1)
- β
- angle of deflection of fluid inside the bucket
Equation 10
u=weight of displaced fluid=vρg Symbols
- ρ
- density of the fluid
Equation 11
P=21ρω2r2−ρgz+c Symbols
- ω
- angular velocity
Centre of Pressure 12
yp=yc+A⋅ycIcc Symbols
- yp
- distance to centre of pressure measured along the submerged surface from the free surface
- yc
- distance to Cmeasured along the submerged surface from the free surface
- Icc
- second moment of submerged area about the centroidal axis parallel to the free surface
Vertical Acceleration 13
P2=hρ(az+g) Symbols
- hρg
- hydrostatic pressure
- hρaz
- due to az
Rotation Is About Centroidal Axis of Waterline Plane 14
∫OCxtanθdA=∫OAxtanθdA⟹∫OCxdA=0=Ax Symbols
- A
- area of waterline plane
- x
- distance to the centroid from axis OO
Equation for Metacentric Radius 15
V(BB′)=θ(∫ACx2dA)=Iθ Symbols
- I
- second moment of area of the waterline plane about the centroidal axis OO
Time Period of Oscillation 16
θ¨=−IGW(GM)θ=−Mk2Mg(GM)θ Symbols
- IG
- Moment of inertia of the body about axis of rotation
- k
- Radius of gyration about axis of rotation
S1 / Mathematics
Equation 01
z,w∈C Representation Methods 02
z=peiθ Symbols
- x=pcosθ
- real part
- y=psinθ
- imaginary part
- p=x2+y2
- modulus
- θ=tan−1(xy)
- arg angle
Properties 03
∃D,P s.t. D=P−1AP Solution 04
y=yp+yc Symbols
- yp
- **particular solution**
- yc
- **complementary solution**
Complementary Solution 05
yc=i=1∑nciyi Symbols
- ci
- constant coefficients
- yi
- a linearly-independent solution
Linear 06
P0(x)y+P1(x)y′+...+Pn(x)y(n)+Q(x)=0 Symbols
- P0,P1,…,Pn,Q
- differentiable functions of x that do not depend on y
- y(x)
- the unknown function
- y(n)
- the nth derivative of y
Equation 07
n=0∑∞an(x−c)n Distance Between 2 Skew Lines 08
distance=∣AB⋅n∣ Symbols
- n
- the unit normal to both l1,l2
- A,B
- points lying on each line
Shortest Distance from a Point 09
d2=r−p2−[∣n∣n⋅(r−p)]2 Symbols
- p
- the position vector of P
- r
- the position vector of a point on the line
- n
- parallel to the line
S1 / Mechanics
General 2D Motion 01
aB=aA+aB/A=aA+θ¨×rB/A+θ˙×(θ˙×rB/A) Symbols
- θ˙
- angular velocity of B relative to A
- vB/A
- velocity of B relative to A
- aB/A
- acceleration of B relative to A
- rB/A
- constant position vector of B relative to A
Pitch 02
d=mz=2r Symbols
- d
- pitch circle diameter
- z
- no. of teeth in the gear
For a Particle 03
Symbols
- F
- resultant applied force
- a
- acceleration of the particle
For a System of Particles 04
F=∑miai=F=maG Symbols
- F
- resultant applied force
- mi
- mass of a particle
- ai
- acceleration of a particle
- aG
- acceleration of the center of mass
Kinetics of a Rigid Body 05
F=maandM=Iα Symbols
- F
- resultant applied force
- a
- acceleration of the body
- M
- moment of the resultant force
- I
- mass moment of inertia
- α
- angular acceleration of the body
General Plane Motion 06
∑MG=IGα Symbols
- MG
- moment about center of mass
- IG
- mass moment of inertia about center of mass
- α
- angular acceleration of the body
Center of Percussion 07
lP/G=OGkG2 Symbols
- P
- Center of percussion
- G
- Center of gravity
Grubler's Equation 08
F=3(N−1)−2L−H=1⟹3N−2L+H=4 Symbols
- N
- number of kinematic elements
- L
- number of lower pairs
- H
- number of higher pairs
Acceleration Diagram 09
a1b1=a1x1+x1b1=(AB)ωAB2+(AB)αAB Symbols
- a1x1
- the radial component of the relative acceleration between A and B
- x1b1
- the transverse component of the relative acceleration between A and B
Deflection of a Beam 10
Smax=4IWL∧Dmax=48EIWL3 Symbols
- Smax
- Maximum stress
- Dmax
- Deflection
- I
- Second moment of cross-sectional area
First Moment of Area 11
About y-axis=∫AxdA=Ayˉ Symbols
- xˉ
- Centroid's xcoordinate
- yˉ
- Centroid's ycoordinate
Necessary Condition for Being Simply Stiff 12
Symbols
- m
- Number of members (bars)
S1 / Programming Fundamentals
S1 / Properties of Materials
Rule of Mixtures 01
Ec=VmEm+VfEf Symbols
- Vm,Vf
- volume fractions of matrix and fiber
- Em,Ef
- elastic moduli of matrix and fiber
Density 02
ρ=Volume/unit cellMass/unit cell=vLMn Symbols
- v
- volume of the unit cell
Relative Permittivity 03
ϵr=ϵ0ϵ Symbols
- ϵ
- permittivity of the material
- ϵ0
- permittivity of free space (8.85×10−12F/m)
Fermi-Dirac Distribution 04
f(Ei)=exp(KBTEi−Ef)+11 Symbols
- Ei
- Energy of the ith energy state
- KB
- Boltzmann constant
- exp()
- exponent function
Temperature Coefficient of Resistivity 05
ρ=ρ0[1+α(T−T0)] Symbols
- ρ
- resistivity at temperature T
- ρ0
- resistivity at temperature T0
- α
- temperature coefficient of resistivity
Current Density 06
J=nqν=σE Symbols
- n
- carrier concentration
- q
- charge on a single charge carrier
- ν
- drift velocity
- E
- applied electric field
Piezoelectric Materials 07
Symbols
- d
- charge sensitivity (a material property)
Piezoelectric Materials 08
C=ϵtA⟹V=ϵdσt Conductivity of Intrinsic Semiconductors 09
σ=n∣e∣(μe+μh) Symbols
- n
- carrier concentration
- μe
- carrier mobility of electrons
- μh
- carrier mobility of holes
Equation 10
MOR=2bd23PL Vickers 11
HV=d21.854F Symbols
- d
- average diagonal length of indentation (mm)
Brinell (HB) 12
HB=πDh2F Symbols
- F
- applied load (in kN)
- D
- diameter of the indenter (in mm)
- d
- diameter of the indentation (in mm)
- h=(D−D2−d2)
- depth of the indentation (in mm)
Relation to Elastic Moduli 13
G=2(1+ν)EK=3(1−2ν)E S2 / Computer Organization and Digital Design
Power Consumption 01
Dynamic power consumption=CV2f Symbols
- C
- Capacitance of the circuit
- f
- Charging frequency of the capacitor
Power Consumption 02
Static power consumption=VIleakage Symbols
- Ileakage
- Leakage current
S2 / Methods of Mathematics
Equation 01
Ln,k(x)=i=0i=k∏nxk−xix−xi Symbols
- x0,x1,…,xn
- the n+1distinct data points (nodes)
Jacobi Method 02
T=D−1(L+U)∧C=D−1B Symbols
- D
- a diagonal matrix whose entries are of A
- −L
- the strictly lower-triangular part of A
- −U
- the strictly upper-triangular part of A
Gauss-Seidel Method 03
∀i∈{1,2,…,n}aii=0 Symbols
- D
- a diagonal matrix whose entries are of A
- −L
- the strictly lower-triangular part of A
- −U
- the strictly upper-triangular part of A
Chi-Square Distribution 04
f(x;k)=2k/2Γ(k/2)1xk/2−1e−x/2,x>0 Symbols
- k
- the degrees of freedom
Mean 05
E(X)=μ=i∑xi⋅P(X=xi) Symbols
- xi
- each possible value of X
- P(X=xi)
- the probability of observing that value
Bernoulli Distribution 06
P(x)=px(1−p)1−x;x=0or1 Symbols
- p
- the probability of success
Binomial Distribution 07
P(X)=(xn)px(1−p)n−x;x=0,1,…,n Symbols
- θ
- the probability of success
Poisson Distribution 08
P(x)=x!e−λλx;x=0,1,2,… Symbols
- λ
- average number of successes occurred within the fixed time interval
Conditional Probability 09
P(A∣B)=P(B)P(A∩B) Symbols
- P(A∣B)
- the conditional probability of A given B
- P(A∩B)
- the joint probability of both A and Boccurring
- P(B)
- the probability of event Boccurring
S2 / Theory of Electricity
Magnetomotive Force 01
f=Ni Reluctance 02
R=μAl=ϕf DC Time Constant 03
τRL=RL Equation 04
F(s)=L{f(t)}=∫0∞e−stf(t)dt Symbols
- s
- σ+jω, where σ,ω∈R
- e−st
- the exponential decay factor that weights the function f(t)
Equivalent Circuit 05
A=VdV0 Symbols
- Rin
- Input resistance, very high
- Rout
- Output resistance, very low
- A
- Gain, ranges from 105 to 107
- Vd
- voltage difference between input terminals
- Vin
- voltage input, ranges between 5V and 18V
Non-Inverting Amplifier 06
Av=vinv0=1+R1R2 Symbols
- Av
- Closed-loop voltage gain
Impedances 07
[Zp]=ZsZmZmZmZsZmZmZmZs Symbols
- Zm
- the impedance caused by mutual coupling between phases
- Zs
- the impedance in a single phase
Copper Loss 08
Pcopper=I2R Symbols
- R
- resistance of winding
Impedance Transformation 09
Z1Z2=(N1N2)2 Symbols
- Z1
- impedance of the primary coil
- Z2
- impedance of the load in the secondary coil
Transmission Parameters 10
[V1I1]=[ACBD][V2−I2] Symbols
- A
- Voltage gain. Open circuit transfer function. Dimensionless.
- B
- Transfer impedance. Short circuit transfer impedance.
- C
- Transfer admittance. Open circuit transfer admittance.
- D
- Current gain. Short circuit current ratio. Dimensionless.
S3 / Applied Statistics
Equation 01
χ2=σ2νs2 Symbols
- σ2
- population variance
For Two-Tailed Tests 02
Symbols
- H0
- μ=μ0
- H1
- μ=μ0
For Right-Tailed Tests 03
Symbols
- H0
- μ≤μ0
- H1
- μ>μ0
For Left-Tailed Tests 04
Symbols
- H0
- μ≥μ0
- H1
- μ<μ0
Equation 05
P(x)=p(1−p)x−1 Symbols
- p
- probability of success in a single trial
Test Statistic 06
χ2=i=1∑kEi(Oi−Ei)2∼χν2 Symbols
- Oi
- observed frequency for class i
- Ei
- expected frequency for class i under H0
- k
- number of non-empty classes
Degrees of Freedom 07
ν=k−p−1 Symbols
- p
- number of parameters estimated from the data
Hypergeometric Experiment 08
P(x)=NCnkCx×N−kCn−x Symbols
- kCx
- Number of ways to choose x successes from ksuccesses.
- N−kCn−x
- Number of ways to choose n−x failures from N−kfailures.
- NCn
- Total number of ways to choose n items from Nitems.
Model 09
yi=α+βxi+εi Symbols
- α
- intercept (value of Y when X=0)
- β
- slope (rate of change of Y with respect to X)
- εi
- random error, assumed εi∼N(0,σ2)
Analysis of Variance (ANOVA) for Regression 10
Symbols
- yi
- Actual observed value of the dependent variable for observation i
- yi^
- Predicted value of yifrom the regression line
- yˉ
- Mean of all observed yivalues (overall average)
For Two-Tailed Tests 11
2×P(Z>∣z∣) Symbols
- H0
- μ=μ0
- H1
- μ=μ0
For Right-Tailed Tests 12
Symbols
- H0
- μ≤μ0
- H1
- μ>μ0
For Left-Tailed Tests 13
P(Z<−z) Symbols
- H0
- μ≥μ0
- H1
- μ<μ0
Equation 14
P(x)=(r−1x−1)pr(1−p)x−r Symbols
- p
- probability of success in a single trial
- r
- number of successes required
Definition 15
f(t)=νπΓ(2ν)Γ(2ν+1)(1+νt2)−2ν+1 Symbols
- t
- the value of the random variable
- ν
- the degrees of freedom (typically, ν=n−1 for a sample of size n)
- Γ
- the gamma function
S3 / Artificial Intelligence
Consistent 01
h(n)≤c(n,a,n′)+h(n′) Symbols
- n′
- the successor node of n after applying action a
- h(n)
- the heuristic of a node n
- h(n′)
- the heuristic of a node n′
- c(n,a,n′)
- the cost of the action a from node n to node n′
Comparison 02
Symbols
- d
- depth of the shallowest goal
- m
- maximum depth of the search tree
Equation 03
M=(S,A,T,R) Symbols
- T:S×A×S→R≥0
- the transition function
- R:S×A→R≥0
- the reward function
Transition Function 04
P(s′∣s,a) Reward Function 05
R(s,a,s′) Discounting Rewards 06
Gt=k=0∑∞γkRt+k+1 Symbols
- t
- the current time step
- Rt+k+1
- the reward received at time step t+k+1
Bellman Optimality Equation 07
Q∗(s,a)V∗(s)=s′∑T(s,a,s′)[R(s,a,s′)+γV∗(s′)]=amaxQ∗(s,a) Symbols
- V∗(s)
- the optimal value of s
- Q∗(s,a)
- the optimal action-value of a at s, the maximum reward for taking an action a in state s
Chance Node: Random Event 08
V=i∑P(i)×Vi Symbols
- P(i)
- probability of outcome i
- Vi
- value resulting from that outcome
Value Iteration 09
Qk+1(s,a)Vk+1(s)=s′∑T(s,a,s′)[R(s,a,s′)+γVk(s′)]=amaxQk+1(s) Symbols
- θ
- small threshold for stopping
Q-Value Iteration 10
Qk+1(s,a)=s′∑T(s,a,s′)[R(s,a,s′)+γa′maxQk(s′,a′)] Symbols
- Qk(s,a)
- estimate at iteration k,
- T(s,a,s′)
- transition probability,
- R(s,a,s′)
- immediate reward,
- γ
- discount factor.
Sample-Based Policy Evaluation 11
Vπ(s)≈N(s)1i=1∑N(s)Gi(s) Symbols
- Gi(s)
- the discounted sum of rewards from a visit to s
- N(s)
- the number of samples for s
Comparison 12
Symbols
- d
- depth of the shallowest solution
- m
- maximum depth of the state space
- C
- cost of the optimal solution
S3 / Data Communication and Networking
AM 01
s(t)=Ac(1+km(t))cos(ωct) Symbols
- Ac
- Amplitude of the carrier signal
- m(t)
- Modulation signal
- ωc
- Angular frequency of the carrier signal
FM 02
θ(t)=2πΔf∫−∞tm(τ)dτ Symbols
- Δp
- Phase modulation index
- Ac
- Amplitude of the carrier signal
- m(t)
- Modulation signal
- ωc
- Angular frequency of the carrier signal
PM 03
θ(t)=Δpm(t) Symbols
- Δp
- Phase modulation index
- Ac
- Amplitude of the carrier signal
- m(t)
- Modulation signal
- ωc
- Angular frequency of the carrier signal
Mathematical Representation 04
s(t)=A×cos(2πft+θi) Symbols
- s(t)
- modulated signal
- θi
- phase angle that varies according to the digital input
Free Space Loss 05
Free space loss=PrPt=(c4πfd)2 Symbols
- Pt
- Power at transmission
- Pr
- Power at reception
- f
- Frequency of the signal
- d
- Distance between attennas
- c
- Speed of light in vacuum
S3 / Differential Equations
Equation 01
f(x,y,u,ux,uy,uxx,uxy,…)=0 Symbols
- x,y
- independent variables
- u(x,y)
- dependent variable
- ux
- first partial derivative w.r.t. x
- uy
- first partial derivative w.r.t. y
- uxx
- 2nd partial derivative w.r.t. x
- uyy
- 2nd partial derivative w.r.t. y
- uxy
- partial derivative of ux w.r.t. y
- uyx
- partial derivative of uy w.r.t. x
Two Dimensional Heat Flow 02
r2∂r2∂2T+r∂r∂T+∂θ2∂2T=0 Symbols
- x,y
- spatial coordinates
- r,θ
- polar coordinates
S3 / Engineering Thermodynamics
Entropy 01
dS≥TδQ Symbols
- δQ
- differential heat transfer into the system
- T
- absolute temperature at the boundary
Efficiency 02
η=1−rp(k−1)/k1 Symbols
- k
- specific heat ratio (cp/cv), approximately 1.4 for air
Equation 03
E=U+21mC2+mgz Symbols
- 21mv2
- kinetic energy of the system
- mgz
- the potential energy of the system
For Closed Systems 04
ΔQ−ΔWΔUΔKEΔPE=ΔEsys=ΔU+ΔKE+ΔPE=m(h2−h1)=21m(C22−C12)=mg(z2−z1) Symbols
- ΔQ
- net heat transfer to the system
- ΔW
- net work transfer from the system
- ΔEsys
- change in total energy
- ΔU
- change in internal energy
- ΔKE
- change in kinetic energy
- ΔPE
- change in potential energy
- h1,h2
- specific enthalpy
- C1,C2
- velocity of the system
- g
- gravitational acceleration
- z1,z2
- elevation of the system
For Open Systems 05
θ=h+21C2+gz Symbols
- θ
- total specific energy
- h=u+Pν
- enthalpy
- u
- specific internal energy
- Pν
- specific flow work
- g
- gravatitaional acceleration
- z
- elevation of the flow system
For Open Systems 06
Q−W+minθin−moutθout=ΔEsys Symbols
- min
- mass flow rate of the inlet
- θin
- total specific energy of the inlet
- mout
- mass flow rate of the outlet
- θout
- total specific energy of the outlet
- ΔEsys
- change in total energy of the system
Steady Flow Energy Equation (SFEE) 07
q−w=he−hi+21(Ce2−Ci2)+g(ze−zi) Symbols
- q
- specific heat transfer
- w
- specific work transfer
- he,hi
- specific enthalpy at the outlet and inlet
- Ce,Ci
- flow velocity at the outlet and inlet
- g
- gravitational acceleration
- ze,zi
- elevation at the outlet and inlet
For Reversible Process 08
ΔS=TδQ Symbols
- ΔS
- the change in entropy
- δQ
- the heat transfer
- T
- the absolute temperature
Carnot Heat Engine 09
QLQH=TLTH Symbols
- TH
- temperature of hot reservoir in Kelvin
- TL
- temperature of cold reservoir in Kelvin
- QH
- heat taken from hot reservoir
- QL
- heat rejected to cold reservoir
Carnot Efficiency 10
ηCarnot=1−THTL Symbols
- TL
- temperature of the cold reservoir (K)
- TH
- temperature of the hot reservoir (K)
Fourier’s Law 11
q˙=−kdxdT Symbols
- dxdT
- temperature gradient
Newton’s Law of Cooling 12
q˙=h(Ts−T∞) Symbols
- q˙
- convective heat flux
- h
- heat transfer coefficient
- Ts
- surface temperature
- T∞
- fluid temperature
Radiation 13
q˙=σεσf(T14−T24) Symbols
- q˙
- net radiative heat flux
- σ
- Stefan-Boltzmann constant
Temperature Distribution for Plane Slab 14
∂t∂T=ρckdx2dT2+ρcqg˙ Ideal Gas Law 15
PV=mRT=vRT Symbols
- R
- specific gas constant
Ideal Gases 16
Specific Heat Capacity at Constant Volume 17
Symbols
- Cv
- Specific heat capacity at constant volume
- u
- Specific internal energy
Specific Heat Capacity at Constant Pressure 18
Symbols
- Cp
- Specific heat capacity at constant pressure
3rd Law 19
T→0limS=S0 Symbols
- S
- the entropy of the system
- S0
- the minimum entropy value
- T
- the absolute temperature
Open Feedwater Heater 20
yh6+(1−y)h2=h3 Symbols
- 1−y
- main flow fraction
- h6
- enthalpy of extracted steam
- h2
- feedwater entering heater
- h3
- saturated liquid exiting heater
S3 / Operating Systems
Equation 01
Speedup(N)=S+N1−S1 Symbols
- N
- number of processing cores
- S
- serial portion of the task
- P=1−S
- parallel portion of the task
Shortest Job First 02
τn+1=αtn+(1−α)τn Symbols
- tn
- duration of n-th CPU burst
- τn
- predicted duration of n-th CPU burst
- α
- weight in [0,1]
S4 / Computer Networks
Back-Off Algorithm 01
0≤r<2k,k=min(n,10) Symbols
- r
- randomly chosen integer back-off delay, in slot times
- n
- number of transmission attempts
Distance Vector Routing 02
D(x,y)=vmin{c(x,v)+D(v,y)} Symbols
- c(x,v)
- link cost from x to v
Flow Control 03
Sender window≤min(rwnd,cwnd) Symbols
- rwnd
- receiver window. Used for flow control.
- cwnd
- congestion window. Used for congestion control.
S4 / Graph Theory
Deletion–Contraction Method 01
P(G,x)=P(G−e,x)−P(G/e,x) Symbols
- (G−e)
- resulting graph when e is removed from G
- (G/e)
- resulting graph when ednpoints of eis merged
S4 / Internet of Things
Equation 01
D=⌊VrefVin×(2n−1)⌋ Symbols
- Vin
- input voltage
- Vref
- reference voltage
Counter-Ramp ADC 02
Tconv=D×Tclk Symbols
- D
- steps to reach Vin
- Tclk
- clock period
Equation 03
Vout=2n−1D×Vref Symbols
- Vout
- output voltage
- Vref
- reference voltage
Current-Limiting Resistor 04
R=IfVCC−Vf Symbols
- VCC
- supply voltage
- Vf
- LED forward voltage
- If
- desired forward current
Tachometer 05
RPM=Nfpulse×60 Symbols
- fpulse
- pulse frequency in Hz
- N
- pulses per revolution
Closed-Loop Speed Control 06
u(t)=Kpe(t)+Ki∫e(t)dt+Kddtde Symbols
- e(t)
- error (setpoint minus measured speed)
- Kp
- proportional gain (correction proportional to current error)
- Ki
- integral gain (correction for accumulated error, eliminates steady-state offset)
- Kd
- derivative gain (correction proportional to rate of error change, damps overshoot)
Forbidden Band 07
Symbols
- VOL
- maximum voltage an output guarantees when driving LOW
- VOH
- minimum voltage an output guarantees when driving HIGH
- VIL
- maximum voltage an input will reliably interpret as LOW
- VIH
- minimum voltage an input will reliably interpret as HIGH
Schmitt Trigger Inputs 08
Symbols
- VT+
- upper threshold. Output switches HIGH when input rises above this.
- VT−
- lower threshold. Output switches LOW when input falls below this.
Capture Mode 09
Tpulse=(t2−t1)×fclkP S4 / Linear Algebra
Equation 01
A=PJP−1 Symbols
- J
- the Jordan form of A
- P
- an invertible matrix where the columns are generalized eigenvectors of A
Jordan Form 02
J=diag(B(λ1,m1),B(λ2,m2),…,B(λk,mk)) Symbols
- λi
- an eigenvalue of A for i=1,2,…,m
- mi∈R
- such that ∑mi=n
Change of Basis 03
A′=Q−1AP Symbols
- Pn×n
- the change-of-basis matrix that satisfies (vi)(i=1)n
- Qm×m
- the change-of-basis matrix that satisfies (wj)(j=1)m
Equation 04
A=UΣVH Symbols
- Σ
- singular values on the diagonal
Calculation 05
Symbols
- V∈Cn×n
- consists of v’s
- U∈Cm×m
- consists of u’s
- Σ∈Rn×m
- consists of eigenvalues on the diagonal and 0s elsewhere
S4 / Software Engineering
COCOMO 01
PM=a×(KDSI)b Symbols
- PM
- effort in person-months
- KDSI
- thousands of delivered source instructions
- a,b
- constants that vary by mode
COCOMO 02
TDEV=c×(PM)d Symbols
- TDEV
- time to develop, in months.
- c,d
- constants that vary by mode.
Productivity Adjustment 03
PMadjusted=PMbase×m Symbols
- PMbase
- effort from the COCOMO formula with standard mode parameters
- m
- productivity multiplier
COCOMO II 04
Effort=A×(Size)B×∏EMi Symbols
- A
- calibration constant. ≈2.94 in the standard model. Calibrated from the organization's historical project data.
- Size
- measured in KSLOC (thousands of source lines of code) or function points
- B
- scaling exponent. B=0.91+0.01×∑SFi, where SFi is each Scale Factor's rating.
- EMi
- effort multipliers (17 cost drivers)
Timing Analysis 05
U=i∑TiCi≤1 Symbols
- Ci
- execution time of process i
- Ti
- period of process i
S4 / Theory of Computing
Regular Grammar 01
Equation 02
αAβ→αXβ Symbols
- A∈V
- single non-terminal on LHS surrounded by context
- X∈(V∪Σ)+
- non-empty replacement
- α,β∈(V∪Σ)∗
- arbitrary context strings
Equation 03
M=(Q,Σ,q0,A,δ) Symbols
- Q
- a finite set of states
- Σ
- a finite input alphabet
- q0∈Q
- the start state
- A⊆Q
- the set of accepting states
- δ:Q×Σ→Q
- the transition function
Version 2 04
Symbols
- x
- prefix before the loop
- y
- substring corresponding to the loop
Equation 05
(Q,Σ,Γ,q0,Z0,A,δ) Symbols
- Z0
- initial stack symbol
- δ
- transition function
Configuration 06
(q,x,α) Equation 07
T=(Q,Σ,Γ,q0,δ) Symbols
- Σ⊃{ha,hr}
- input alphabet
- Γ⊃{Λ}
- tape alphabet
- δ:Q×Σ→Q×Γ×{L,R,S}
- transition function
n-Tape Turing Machine 08
M=(Q,Σ,Γ,δ,q0,F) Symbols
- Γ
- tape alphabet (Σ⊆Γ)
- F
- set of accepting states
- δ:Q×Γn→Q×Γn×{L,R,S}n
- transition function
S5 / Advanced Networking
Sampling 01
fs>2fmax Symbols
- fs
- sampling frequency
- fmax
- highest input frequency
Differential PCM 02
en=xn−x^n Symbols
- en
- prediction error
- x^n
- predicted sample
S5 / Business Economics and Financial Accounting
Taxation 01
Consumer burdenProducer burden=Ed+EsEs×tax=Ed+EsEd×tax Symbols
- Ed
- Price elasticity of demand (absolute value)
- E2
- Price elasticity of supply
Consumer Surplus 02
CS=21×Q∗×(Pmax−P∗) Symbols
- Q∗
- equilibrium quantity
- Pmax
- choke price, the price at which quantity demanded is 0
- P∗
- equilibrium price
Producer Surplus 03
PS=21×Q∗×(P∗−Pmin) Symbols
- Pmin
- the price at which quantity supplied is 0
Output and Price 04
Qm<QcandPm>Pc Symbols
- Qm
- monopoly quantity
- Qc
- competitive quantity
- Pc
- competitive price
Marginal Cost Pricing 05
Symbols
- MR
- marginal revenue, revenue from 1 additional unit sold
- MC
- marginal cost, cost of producing 1 additional unit
- ATC
- average total cost, total cost per unit of output
Total Revenue 06
TR=P×Q Marginal Revenue Product 07
MRPL=MPL×P Symbols
- MRPL
- Marginal Revenue Product of Labour
- MPL
- Marginal Product of Labour
S5 / Calculus
Singularities Inside and Outside 01
∫Cf(z)dz=2πi∑ca Symbols
- ca
- coefficient of z−a1, summed over the singular points a inside C
Laurent's Theorem 02
cn=2πi1∫∣ζ−α∣=s(ζ−α)n+1f(ζ)dζ Symbols
- s
- any radius with r<s<R
Equation 03
logz=ln∣z∣+iargz={ln∣z∣+i(Argz+2kπ):k∈Z},z=0 Symbols
- Argz
- principal argument of z, the unique argument with −π<Argz≤π
- argz
- {Argz+2kπ:k∈Z}
Equation 04
n=0∑∞cn(z−α)n Symbols
- α
- center, a fixed complex number
- cn
- coefficients, fixed complex numbers
Rectangular Coordinates 05
P=(x,y,z) Symbols
- x
- signed distance from the yz-plane
- y
- signed distance from the zx-plane
- z
- signed distance from the xy-plane
Cylindrical Coordinates 06
x=rcosθ,y=rsinθ,z=z,r≥0 Symbols
- r
- distance from the z-axis
- θ
- angle in the xy-plane from the positive x-axis
- z
- signed height above the xy-plane
Spherical Coordinates 07
x=ρsinϕcosθ,y=ρsinϕsinθ,z=ρcosϕ Symbols
- ρ
- distance from the origin to the point
- θ
- angle in the xy-plane from the positive x-axis
- ϕ
- angle from the positive z-axis
Area Formula 08
A(D)=21∮Cxdy−ydx Parametric Form 09
r(u,v)=x(u,v)i^+y(u,v)j^+z(u,v)k^,(u,v)∈R Symbols
- R
- region in the uv-plane
- x,y,z
- component functions of u and v
S5 / Computer Security
Encryption 01
c=25−mmod26 Symbols
- m
- plaintext letter, encoded as an integer 0 (a) to 25 (z)
- c
- ciphertext letter, same encoding
Choosing a Generator 02
g(p−1)/qi≡1(modp)for every i Symbols
- qi
- a distinct prime factor of p−1
Noninterference 03
∀L,H1,H2.LowOutput(H1,L)=LowOutput(H2,L) Symbols
- H1,H2
- any 2 possible high inputs
- LowOutput(H,L)
- the low output produced for inputs H and L
Equation 04
K=KDF(S,salt,info,L) Symbols
- salt
- non-secret random value
- info
- context label binding the key to its purpose
- L
- required output length
Key Derivation from Passwords 05
K=PBKDF2(HMAC,password,salt,c,L) Equation 06
si=c1si−1⊕c2si−2⊕⋯⊕cnsi−n,i≥n Symbols
- c1,…,cn∈{0,1}
- the feedback taps, fixed for a given LFSR.
- s0,…,sn−1
- the initial state, acting as the secret key or seed.
Combining LFSRs 07
ki=f(si(1),si(2),…,si(m)) Symbols
- si(j)
- the output bit of the j-th LFSR at step i.
- f
- a fixed nonlinear function of the mcomponent outputs.
HMAC 08
HMACk(m)=H((k′⊕opad)∥H((k′⊕ipad)∥m)) Symbols
- k′
- key kpadded with zeros to the hash block size, or hashed first if longer than a block
- ipad
- the byte `0x36` repeated to the block size
- opad
- the byte `0x5c` repeated to the block size
Encryption 09
cσ(i)=mi Symbols
- mi
- plaintext character at position iin the block
- cj
- ciphertext character at position jin the block
Computational Indistinguishability 10
Pr[D(Xn)=1]−Pr[D(Yn)=1] Symbols
- Xn
- first distribution at security parameter n
- Yn
- second distribution at security parameter n
- Pr[D(Xn)=1]
- probability that D outputs 1 for a sample from Xn
- Pr[D(Yn)=1]
- probability that D outputs 1 for a sample from Yn
Key Scheduling Algorithm 11
S[i]=i,i=0,…,255j=0for i=0 to 255:j=(j+S[i]+K[imodlen(K)])mod256swap S[i] and S[j] Symbols
- i
- iterates once over every index in order.
- j
- a running value seeded by the key, deciding which entry iis swapped with.
Encryption 12
c=m+kmod26 Symbols
- m
- plaintext letter, encoded as an integer 0 (a) to 25 (z)
- k
- the shift value, the secret key
Attacking 13
Δ[X,Yk]=21u∈V∑X←DstdPr[X=u]−Yk←DkPr[Yk=u] Symbols
- X
- random variable distributed according to the standard character frequency
- Yk
- random variable distributed according to the shift k
- V
- the set of values which can occur for X or Ykwith non-zero probability
S5 / Image Processing
CMYK 01
Symbols
- M
- magenta, absorbs green
- K
- key, black ink added to deepen dark tones and reduce colored ink use
Indexed 02
Strue=24WH Symbols
- W,H
- image width and height in pixels
- S
- total storage in bits
One-Dimensional DCT 03
X(k)=α(k)n=0∑N−1x(n)cos2N(2n+1)kπ Symbols
- x(n)
- sample value at index n
- X(k)
- coefficient for frequency k
- α(0)
- 1/N
- α(k) for k≥1
- 2/N
Two-Dimensional DCT 04
f(x,y)=u=0∑N−1v=0∑N−1α(u)α(v)F(u,v)cos2N(2x+1)uπcos2N(2y+1)vπ Symbols
- x,y
- column and row indices
- u,v
- horizontal and vertical frequency indices
- f(x,y)
- pixel value at column x and row y
- F(u,v)
- coefficient at horizontal frequency u and vertical frequency v
- F(0,0)
- DC coefficient, equal to Ntimes the block mean
Ordered Dithering 05
Tijqij=n2Dij+0.5={10v>Tijv≤Tij Symbols
- Tij
- threshold at sub-pixel (i,j)
- Dij
- dither matrix entry at sub-pixel (i,j)
- qij
- bi-level output at sub-pixel (i,j)
Equation 06
Btotal=Bavg×N Symbols
- L
- number of grey levels
- ri
- number of pixels with grey level li
- P(li)
- probability of grey level li
Average Code Length 07
Lavg≥BavgRcoding=Lavg−Bavg Symbols
- l(k)
- codeword length of grey level kin bits
- Lavg
- average codeword length in bits per pixel
- b
- size of the coded image in bits
- Rcoding
- coding redundancy in bits per pixel
Image Gradient 08
∇f(x,y)=[GxGy]=∂x∂f(x,y)∂y∂f(x,y) Symbols
- f(x,y)
- image intensity at (x,y)
- Gx
- horizontal intensity derivative
- Gy
- vertical intensity derivative
Thresholded Edge Maps 09
g(x,y)={10∣∇f(x,y)∣≥T∣∇f(x,y)∣<T Symbols
- g(x,y)
- binary edge-map value
- T
- minimum gradient magnitude accepted as an edge
Laplacian of Gaussian 10
LoG(f)=∇2(Gσ∗f) Symbols
- Gσ
- Gaussian kernel with standard deviation σ
Fixed Length Coding 11
l(k)=⌈log2L⌉ Symbols
- L
- number of grey levels
- l(k)
- codeword length of grey level k
Delta Coding 12
D(x,y)=I(x+1,y)−I(x,y) Symbols
- I(x,y)
- grey level at column x and row y
- D(x,y)
- difference between a pixel and its right neighbour
Image Pyramid Coding 13
Gk=Lk+expand(Gk+1) Symbols
- Gk
- image at level k, with G0the full-resolution image
- K
- index of the coarsest level
- reduce
- Gaussian low-pass filtering followed by downsampling by 2 in each dimension
- expand
- upsampling by 2 in each dimension with interpolation
- Lk
- difference layer at level k
Bit-Plane Coding 14
I(x,y)=k=0∑m−1ak(x,y)2k Symbols
- ak(x,y)
- bit k of the pixel at (x,y), with k=0the least significant bit
Bit-Plane Coding 15
am−1=gm−1,ak=gk⊕ak+1 Symbols
- gk
- bit kof the Gray coded pixel
Psychovisual Redundancy 16
I′(x,y)=i,j∑h(i,j)I(x+i,y+j)i,j∑h(i,j)=1 Symbols
- m,m′
- bits per pixel before and after re-quantizing
- I′(x,y)
- pixel value after the operation
- h(i,j)
- Gaussian weight at offset (i,j)
Filter Kernel 17
P(x,y)=i=−N∑Nj=−M∑MH(i,j)I(x−i,y−j) Symbols
- I(x,y)
- input image intensity
- P(x,y)
- filtered output intensity
- H(i,j)
- kernel coefficient at offset (i,j)
Equation 18
Symbols
- x,y
- spatial coordinates of a point in the image
- I(x,y)
- light intensity at that point, bounded between a minimum and maximum
Digital Image Model 19
I(0,0)I(1,0)⋮I(m−1,0)I(0,1)I(1,1)⋮I(m−1,1)⋯⋯⋱⋯I(0,n−1)I(1,n−1)⋮I(m−1,n−1) Symbols
- i
- row index, 0≤i≤m−1
- j
- column index, 0≤j≤n−1
- L
- number of intensity levels, usually L=2k for a bit depth k
Objective Assessment 20
mean squared error=MN1x=1∑My=1∑N(p(x,y)−r(x,y))2 Symbols
- M,N
- image dimensions
- p(x,y)
- pixel value in the processed image
- r(x,y)
- pixel value in the source image
Size Independence 21
PSNR=10log10MSEMAX2 Symbols
- MAX
- maximum possible pixel value
Backward Mapping 22
kx=source widthnew widthky=source heightnew height Symbols
- kx,ky
- horizontal and vertical scale factors
- (sx,sy)
- source position, generally non-integer
Bilinear Interpolation 23
v= +++v00(1−fx)(1−fy)v10fx(1−fy)v01(1−fx)fyv11fxfy Symbols
- fx,fy
- fractional distances from the top-left neighbour, in [0,1)
- v00
- top-left neighbour value, at (⌊sx⌋,⌊sy⌋)
- v10
- top-right, v01: bottom-left, v11: bottom-right
- v
- interpolated value, rounded to an integer
Gaussian Pyramid 24
Gn+1=downsample(H∗Gn) Symbols
- G0
- the original image
- Gn+1
- Gnfiltered with a Gaussian low-pass filter, then downsampled by 2
Gaussian Pyramid Filter 25
Gn+1(x,y)=i=−2∑2j=−2∑2H(i,j)Gn(2x−i,2y−j) Symbols
- H
- 2-D Gaussian-pyramid filter
- Gn
- input pyramid level
- Gn+1
- filtered and downsampled pyramid level
Laplacian Pyramid 26
Ln=Gn−U(Gn+1) Symbols
- Gn,Gn+1
- consecutive levels of the Gaussian pyramid above
- U(Gn+1)
- Gn+1 upsampled back to level n's resolution
- Ln
- band-pass detail at level n
Trellis Quantization 27
J=D+λR Symbols
- D
- squared error between the original and the dequantized coefficients
- R
- number of bits the choice costs after run-length and Huffman coding
- λ
- weight that sets the exchange rate between error and bits
AC Coefficients 28
RS=16R+s Symbols
- R
- number of zeros since the previous nonzero coefficient, from 0 to 15
- s
- category of the nonzero coefficient, from 1 to 10
Decoding 29
f^(x,y)=clamp(round(IDCT(Fq(u,v)Q(u,v)))+128, 0, 255) Symbols
- Fq(u,v)
- quantized coefficient from the entropy decoder
- Q(u,v)
- quantization table entry
- IDCT
- inverse 2D DCT of the block
- clamp(a,0,255)
- a limited to the range [0,255]
Block 30
xi=⌈X⋅HmaxHi⌉yi=⌈Y⋅VmaxVi⌉ Symbols
- xi,yi
- dimensions of component iin samples
- Hmax,Vmax
- largest sampling factors across all components
Discrete Cosine Transform 31
f(x,y)=41u=0∑7v=0∑7C(u)C(v)F(u,v)cos16(2x+1)uπcos16(2y+1)vπ Symbols
- x,y
- column and row of a sample in the block
- u,v
- horizontal and vertical frequency indices, from 0 to 7
- C(k)
- 21 for k=0, otherwise 1
- F(0,0)
- DC coefficient, equal to 8 times the block mean
- F(u,v) for (u,v)=(0,0)
- AC coefficients
Spatial Filtering 32
(M∘I)(x,y)=i=−N∑Nj=−M∑MM(i,j)I(x+i,y+j) Symbols
- M(i,j)
- mask, typically odd sized with dimensions (2N+1)×(2M+1)
- I(x,y)
- input image
Gaussian Noise 33
p(z)=2πσ1exp[−2σ2(z−μ)2] Symbols
- z
- noise value added to a pixel
- μ
- mean, taken as 0so the noise neither brightens nor darkens on average
- σ
- standard deviation, sets the noise strength
Uniform Noise 34
p(z)=⎩⎨⎧b−a10a≤z≤botherwise Symbols
- a
- lower bound of the noise range
- b
- upper bound of the noise range
Salt and Pepper Noise 35
p(z)=⎩⎨⎧PaPb1−Pa−Pbz=zminz=zmaxpixel unchanged Symbols
- zmin,zmax
- darkest and brightest intensity values
- Pa
- probability a pixel is set to zmin, seen as pepper
- Pb
- probability a pixel is set to zmax, seen as salt
Frame Averaging 36
Output=n1i=1∑nFramei=F+n1i=1∑nNi Symbols
- F
- static source scene frame
- Ni
- noise in frame i
Lens Equation 37
f1=u1+v1 Symbols
- f
- focal distance of the lens
- u
- distance to the object
- v
- distance to the image
Grey Level Histogram 38
P(k)=nN(k) Symbols
- N(k)
- number of pixels with intensity k
- n
- total number of pixels
Characteristics 39
μ=k∑kP(k)σ2=k∑(k−μ)2P(k) Symbols
- σ2
- variance of intensity
Brightness and Contrast 40
Symbols
- c
- shift constant, added to move brightness
- a
- gain constant, multiplied to change contrast
Point Processing Functions 41
s=round((L−1)A(r)) Symbols
- L
- number of grey levels
- a,b
- lower and upper bounds of the chosen range
- (r1,s1),(r2,s2)
- control points of the piecewise linear curve
- rmin,rmax
- limits of the input range
- smin,smax
- limits of the output range
- k
- bit-plane index, with 0the least significant bit
- A(r)
- accumulated histogram
Histogram Matching 42
LUT(g)=argrmin∣Cr(r)−Ct(g)∣ Symbols
- Ct(g)
- accumulated probability of test level ≤g
- Cr(r)
- accumulated probability of reference level ≤r
Equation 43
height=RNr Symbols
- R
- resolution in dots per unit length
- Nc
- number of columns
- Δx:Δy
- pixel aspect ratio
S5 / Numerical Methods
Standard Form 01
y′′=f(x,y,y′),a≤x≤b,y(a)=α, y(b)=β Equation 02
Computing $L$ 03
lki=liiaki−j=1∑i−1lijlkj,i=1,2,…,k−1 Computing $L$ 04
lkk=akk−j=1∑k−1lkj2 General Form 05
xminsubject tof(x)gi(x)=ci,i=1,…,nhj(x)≤dj,j=1,…,m Symbols
- gi(x)=ci
- equality constraints
- hj(x)≤dj
- inequality constraints
Standard Form 06
z=f(x)=a1x1+a2x2+⋯+anxn Standard Form 07
ai1x1+ai2x2+⋯+ainxn≤bi Equation 08
Sj(x)=aj+bj(x−xj)+cj(x−xj)2+dj(x−xj)3,x∈[xj,xj+1] Equation 09
Sj(xj)=f(xj),Sj(xj+1)=f(xj+1) Construction 10
hj=xj+1−xj,aj=f(xj),δj=hjaj+1−aj Construction 11
hj−1cj−1+2(hj−1+hj)cj+hjcj+1=3(δj−δj−1),j=1,…,n−1 Construction 12
bj=δj−3hj(2cj+cj+1),dj=3hjcj+1−cj Construction 13
c0=cn=0 Construction 14
2h0c0+h0c1=3(δ0−f′(x0)), Error 15
M=a≤x≤bmax∣f(4)(x)∣ Error 16
∣f(x)−S(x)∣≤3845M0≤j≤n−1max(xj+1−xj)4 Mesh Points 17
ti=a+ih,i=0,1,…,N Difference Equation 18
y(ti+1)=y(ti)+hf(ti,y(ti))+2h2y′′(ξi),ξi∈(ti,ti+1) Difference Equation 19
w0wi+1=α=wi+hf(ti,wi),i=0,1,…,N−1 Theoretical Error Bound 20
∣y(ti)−wi∣≤2LhM(eL(ti−a)−1) Symbols
- M
- bound on ∣y′′∣ over [a,b]
- L
- Lipschitz constant of f
Computational Error Bound 21
u0ui+1=α+δ0=ui+hf(ti,ui)+δi+1,∣δi∣<δ Computational Error Bound 22
∣y(ti)−ui∣≤L1(2hM+hδ)(eL(ti−a)−1)+∣δ0∣eL(ti−a) Computational Error Bound 23
h=M2δ Equation 24
G(p)=p Fixed-Point Iteration 25
x(k)=G(x(k−1)),k≥1 Fixed-Point Theorem in n-Space 26
∂xj∂gi(x)≤nK,∀x∈D,i,j=1,2,…,n Solve the System 27
f1(x1,x2,x3)f2(x1,x2,x3)f3(x1,x2,x3)=3x1−cos(x2x3)−21=x12−81(x2+0.1)2+sinx3+1.06=e−x1x2+20x3+310π−3 Rearrangement Choice 28
x3+x−1=0 Rearrangement Choice 29
g1(x)=1−x3,g2(x)=x2+11 Forward Elimination 30
Rj−a11aj1R1→Rj,j=2,3,…,n Forward Elimination 31
Rj−aii(i)aji(i)Ri→Rj,j=i+1,i+2,…,n Forward Elimination 32
a110⋮0a12a22(1)0⋯⋯⋱⋯a1na2n⋮ann(n−1)b1(1)b2(2)⋮bn(n−1) Back Substitution 33
xn=ann(n−1)bn(n−1) Back Substitution 34
xi=aii(i−1)bi(i−1)−j=i+1∑naij(i−1)xj,i=n−1,n−2,…,1 Scaled Partial Pivoting 35
sj=1≤k≤nmax∣ajk∣ Ill Conditioning 36
(1111.0001)(xy)=(22.0001) Ill Conditioning 37
(1111.0001)(xy)=(22.0002) Condition Number 38
κ(A)=∥A∥∥A−1∥ Condition Number 39
{x+y=2x+1.001y=2{x+y=2x+1.001y=2.001 Example 1 40
2x1+x2−x3−3x1−x2+2x3−2x1+x2+2x3=8=−11=−3 Example 2 41
3x2+x32x1+2x2−x34x1+2x2+x3=9=3=11 Example 3 42
4x1+100x2−50x3x1+x2+2x32x1−x3=54=4=1 Example 4 43
2x1−x2+x3x1+x2+4x3x1+2x2−2x3=3=15=−1 Equation 44
y′(t)=f(t,y),a≤t≤b,y(a)=α Lipschitz Condition 45
∣f(t,y1)−f(t,y2)∣≤L∣y1−y2∣ Stable Solution 46
z′(t)=f(t,z)+δ(t),a≤t≤b,z(a)=α+δ0 Stable Solution 47
t∈[a,b] Symbols
- k
- stability constant, independent of ε
Equation 48
x0<x1<⋯<xn, Equation 49
ϕ(xi)=yi,i=0,1,…,n Polynomial Interpolation 50
pn(xi)=yi Polynomial Interpolation 51
pn(x)=i=0∑nyiLi(x),Li(x)=j=0j=i∏nxi−xjx−xj Polynomial Interpolation 52
Li(xj)={1,0,i=j,i=j. Other Forms 53
ϕ(x)=2a0+k=1∑m(akcos(kx)+bksin(kx)) Other Forms 54
ϕ(x)=q(x)p(x) Equation 55
y′′=p(x)y′+q(x)y+r(x),a≤x≤b,y(a)=α, y(b)=β Superposition Idea 56
y1′′=p(x)y1′+q(x)y1+r(x) Superposition Idea 57
y2′′=p(x)y2′+q(x)y2 Auxiliary IVPs 58
y1(a)=α, y1′(a)=0,y2(a)=0, y2′(a)=1 Auxiliary IVPs 59
y1′′=p(x)y1′+q(x)y1+r(x),y1(a)=α, y1′(a)=0y2′′=p(x)y2′+q(x)y2,y2(a)=0, y2′(a)=1 Combining Solutions 60
c=y2(b)β−y1(b),y(x)=y1(x)+y2(b)β−y1(b)y2(x) Mesh Points 61
xi=a+ih,i=0,1,…,N+1 Centered Difference Formulas 62
y′′(xi)=h2y(xi+1)−2y(xi)+y(xi−1)+O(h2),y′(xi)=2hy(xi+1)−y(xi−1)+O(h2) Linear Difference Equation 63
(1+2hp(xi))wi−1−(2+h2q(xi))wi+(1−2hp(xi))wi+1=h2r(xi) Matrix Form 64
Matrix Form 65
ai=−1−2hp(xi),di=2+h2q(xi),ci=−1+2hp(xi)A=d1a2c1d2⋱c2⋱aN⋱dNw=w1w2⋮wN,b=−h2r(x1)−a1α−h2r(x2)⋮−h2r(xN)−cNβ Equation 66
a11x1+a12x2+⋯+a1nxna21x1+a22x2+⋯+a2nxn⋮am1x1+am2x2+⋯+amnxn=b1=b2=bm Equation 67
A=a11a21⋮am1a12a22⋮am2⋯⋯⋱⋯a1na2n⋮amn,x=x1x2⋮xn,b=b1b2⋮bm Symbols
- [A∣b]
- augmented matrix
Worked Example 68
(a){x+y=32x−y=0(b){x+y=32x+2y=6(c){x+y=32x+2y=7 Equation 69
Using Gaussian Elimination 70
mji=aii(i)aji(i) Using Gaussian Elimination 71
U=a11(1)0⋮0a12(1)a22(2)⋮⋯⋯⋯⋱⋯a1n(1)a2n(2)⋮ann(n)andL=1m21⋮mn101⋮⋯⋯⋯⋱mn,n−10⋮01 Direct Computation Method 72
aij=k=1∑nlikukj Direct Computation Method 73
uij=aij−k=1∑i−1likukj Direct Computation Method 74
lji=uii1[aji−k=1∑i−1ljkuki] Finding the Inverse 75
Axj=ej,j=1,…,n Finding the Determinant 76
detA=detLdetU Finding the Determinant 77
detA=i=1∏nuii Finding the Determinant 78
detA=(−1)si=1∏nuii Example 1 79
A=2−3−21−11−122 Example 2 80
b=101 Example 3 81
A=132287159 Example 4 82
A=2−3−21−11−122 Equation 83
Symbols
- L
- unit lower triangular, n×n with all diagonal entries 1
- U
- upper triangular, n×n
- P
- permutation matrix, n×n
Recursive Leading-Row-Column Algorithm 84
B(k)=(α(k)c(k)(r(k))TC(k)) Symbols
- A(k)
- matrix entering recursion depth k
- B(k)
- matrix after the row swap
- α(k)
- pivot
- (r(k))T
- rest of the pivot row
- c(k)
- rest of the pivot column
- C(k)
- trailing block
- ℓ(k)
- multiplier vector
- S(k)
- row swap at recursion depth k
Schur Complement 85
ℓ(k)=α(k)c(k),A(k+1)=C(k)−ℓ(k)(r(k))T Base Case 86
P(k)=L(k)=(1),U(k)=A(k) Recursive Step 87
P(k)=(100TP(k+1))S(k),L(k)=(1P(k+1)ℓ(k)0TL(k+1)),U(k)=(α(k)0(r(k))TU(k+1)) Example 1 88
A=026598508 Diagonally Dominant Matrix 89
∣aii∣≥j=1,j=i∑n∣aij∣ Positive Definite Matrix 90
Ak=a11⋮ak1⋯⋱⋯a1k⋮akk Positive Definite Matrix 91
A=2−10−12−10−12 Convergent Matrix 92
k→∞limAk=B Worked Example 93
A=7302550−1−6 Worked Example 94
B=4−10−14−10−14 Worked Example 95
C=(0.50.2500.5) Equation 96
wi+1=am−1wi+am−2wi−1+⋯+a0wi+1−m+h[bmf(ti+1,wi+1)+bm−1f(ti,wi)+⋯+b0f(ti+1−m,wi+1−m)] Adams Methods 97
y(ti+1)=y(ti)+∫titi+1f(t,y(t))dt Adams-Bashforth Explicit Methods 98
wi+1=wi+2h[3fi−fi−1] Adams-Bashforth Explicit Methods 99
wi+1=wi+12h[23fi−16fi−1+5fi−2] Adams-Bashforth Explicit Methods 100
wi+1=wi+24h[55fi−59fi−1+37fi−2−9fi−3] Adams-Bashforth Explicit Methods 101
wi+1=wi+720h[1901fi−2774fi−1+2616fi−2−1274fi−3+251fi−4] Adams-Moulton Implicit Methods 102
wi+1=wi+12h[5fi+1+8fi−fi−1] Adams-Moulton Implicit Methods 103
wi+1=wi+24h[9fi+1+19fi−5fi−1+fi−2] Adams-Moulton Implicit Methods 104
wi+1=wi+720h[251fi+1+646fi−264fi−1+106fi−2−19fi−3] Iteration 105
G(x)=x−J(x)−1F(x) Iteration 106
J(x(k−1))y(k−1)=−F(x(k−1)) Example 2 107
x12+x22−4x1x2−1=0=0 Equation 108
y′′=p(x)y′+q(x)y+r(x) Idea 109
y′′=f(x,y,y′),y(a)=α, y′(a)=t Newton Iteration 110
z′′=fy(x,y,y′)z+fy′(x,y,y′)z′,z(a)=0, z′(a)=1 Newton Iteration 111
tk=tk−1−z(b,tk−1)y(b,tk−1)−β Nonlinear Difference Equation 112
w0=α,wN+1=β,−h2wi+1−2wi+wi−1+f(xi,wi,2hwi+1−wi−1)=0 Nonlinear System 113
2w1−w2+h2f(x1,w1,2hw2−α)−α=0−wi−1+2wi−wi+1+h2f(xi,wi,2hwi+1−wi−1)=0,i=2,…,N−1−wN−1+2wN+h2f(xN,wN,2hβ−wN−1)−β=0 Equation 114
f1(x1,x2,…,xn)f2(x1,x2,…,xn)fn(x1,x2,…,xn)=0=0⋮=0 Equation 115
F(x)=(f1(x),f2(x),…,fn(x))T Symbols
- F
- maps Rn into Rn
- f1,f2,…,fn
- coordinate functions of F
Continuity from Bounded Partials 116
∂xj∂f(x)≤K,j=1,2,…,n Example 1 117
3x1−cos(x2x3)−21x12−81(x2+0.1)2+sinx3+1.06e−x1x2+20x3+310π−3=0=0=0 Example 2 118
x12+x22x12−x2=4=2 1-Norm 119
∥x∥1=i=1∑n∣xi∣ 2-Norm 120
∥x∥2=(i=1∑nxi2)1/2 Infinity Norm 121
∥x∥∞=1≤i≤nmax∣xi∣ Equivalent Norms 122
c1∥x∥v1≤∥x∥v2≤c2∥x∥v1 Equivalent Norms 123
∥x∥∞≤∥x∥2≤n∥x∥∞ Equivalent Norms 124
∥x∥∞≤∥x∥1≤n∥x∥∞ Induced Matrix Norm 125
∥A∥M=x=0sup∥x∥v∥Ax∥v=∥x∥v=1sup∥Ax∥v Induced Matrix Norm 126
∥A∥∞=1≤i≤nmaxj=1∑n∣aij∣(maximum row sum) Spectrum 127
σ(A)={λ;Av=λv,v∈Rn,λ is an eigenvalue of A} Spectral Radius 128
ρ(A)=max{∣λ∣;λ∈σ(A)} Spectral Radius 129
∥A∥2=ρ(ATA) Worked Example 130
A=(13−24) Midpoint Method 131
f(t,y)+2hf′(t,y)=f(t+2h, y+2hf(t,y))+O(h2) Modified Euler Method 132
w0wi+1=α=wi+2h[f(ti,wi)+f(ti+1, wi+hf(ti,wi))] Order 4 Runge-Kutta 133
w0k1k2k3k4wi+1=α=hf(ti,wi)=hf(ti+2h, wi+21k1)=hf(ti+2h, wi+21k2)=hf(ti+1, wi+k3)=wi+61(k1+2k2+2k3+k4) Gradient 134
∇f(x,y)=∂x∂fi+∂y∂fj Procedure 135
g(hi)=f(xi+hi∂x∂f(xi,yi), yi+hi∂y∂f(xi,yi)) Procedure 136
xi+1=xi+hi∂x∂f(xi,yi),yi+1=yi+hi∂y∂f(xi,yi) Worked Example 137
f(x,y)=2xy+2x−x2−2y2 Equation 138
u′(t)=f(t,u(t)),u(a)=α Equation 139
∥f(t,u)−f(t,z)∥≤L∥u−z∥ Reducing a Higher-Order IVP 140
y(m)(t)=f(t,y,y′,…,y(m−1)),a≤t≤b Reducing a Higher-Order IVP 141
u′=u2u3⋮umf(t,u1,…,um),u(a)=α1α2⋮αm Example 1 142
y′′−2y′+2y=e2tsint,0≤t≤1,y(0)=−0.4, y′(0)=−0.6 Equation 143
b1x1+c1x2a2x1+b2x2+c2x3an−1xn−2+bn−1xn−1+cn−1xnanxn−1+bnxn=d1=d2 ⋮=dn−1=dn Symbols
- ai
- subdiagonal entries
- bi
- main diagonal entries
- ci
- superdiagonal entries
- di
- right-hand-side entries
Equation 144
b1a20⋮0c1b2a3⋱⋯0c2b3⋱0⋯⋱⋱⋱an0⋮0cn−1bnx1x2⋮xn=d1d2⋮dn Crout Factorization 145
Crout Factorization 146
L=ℓ1a20⋮0ℓ2a3⋱⋯⋱⋱⋱0⋮0ℓn,U=10⋮00u11⋱⋯⋯0u2⋱0⋯⋯⋱⋱100⋮0un−11 Crout Factorization 147
ℓ1ℓiℓn=b1,=bi−aiui−1,=bn−anun−1.u1ui=ℓ1c1,=ℓici,i=2,…,n−1, Triangular Solves 148
y1yi=ℓ1d1,=ℓidi−aiyi−1,i=2,…,n. Triangular Solves 149
xnxi=yn,=yi−uixi+1,i=n−1,n−2,…,1. Worked Example 150
2x1−x2−x1+2x2−x3−x2+2x3−x4−x3+2x4=1=0=0=1. S5 / Operational Research
Payoff Matrix 01
A=a11⋮am1⋯⋱⋯a1n⋮amn Symbols
- m
- number of row player strategies
- n
- number of column player strategies
- aij
- row player's payoff when the row player picks i and the column player picks j
Linear Program 02
x∈Rnmaxs.t.z=cTxAx≤bx≥0 Symbols
- c
- objective coefficients
- A=[aij]
- constraint coefficients
Activity Limits 03
0≤xi≤tiN−tiC Symbols
- xi
- time reduction for activity i
- tiN
- normal time for activity i
- tiC
- crash time for activity i
Crashable Activity 04
ti>tiC Symbols
- ti
- activity's current duration
- tiC
- activity's crash time
Cost Slope 05
Cost slopei=−tiN−tiCCiN−CiC Symbols
- CiN
- direct cost of activity iat normal time
- CiC
- direct cost of activity iat crash time
Project Cost 06
CD=i∑CiN+i∑xisi Symbols
- CD
- total direct cost
- xi
- time reduction for activity i
- si
- cost slope of activity i
Project Cost 07
CT=CD+rT Symbols
- CT
- total project cost
- r
- indirect cost rate per time unit
Crashing Offer 08
Cnet=ΔCD−rΔT Symbols
- Cnet
- net additional cost
- ΔCD
- added direct cost
- ΔT
- reduction in project duration
Resource Profile 09
Rr,t=i∈At∑ri Symbols
- At
- activities running during time period t
- ri
- amount of resource r required by activity i
- Rr,t
- total demand for resource r during time period t
S5 / Secure App Dev
PCR Extend 01
PCRnew=H(PCRold∥m) Symbols
- m
- hash of the component being measured
- ∥
- concatenation
No equations match those filters.