To numerically find a root of \(f(x)=0\), we may use the Newton’s method. Assuming
the root is at the proximity of \(x_k\), to find a better approximate \(x_{k+1}\),
we consider the tangent line at \((x_k, f(x_k))\), which is provided by the
equation
[more]
Property of Matrix and Its Eigenvalues
For a matrix \(A\), and its eigenvalue \(\lambda_i\)
[more]
Covariance & Correlation
Consider random variables \(X\) and \(Y\), to measure how much they change together, we use covariance:
[more]
QR Decomposition
What
[more]
Solving Steiner Tree Problem as a MILP
Consider a network \(G(V,E)\), with \(W_0 \subset V\) is a set of focus vertices. Let’s call \(s\in W_0\) the multicast sender and the rest \(W = W_0 \backslash \{s\}\) the multicast receivers. Given the edges of unit weight, how to find the multicast tree that connects \(s\) to \(W\) with...
[more]