Scipy Exercise
Exercise 1: Least squares
Generate matrix
A∈Rm×n
A
∈
R
m
×
n
with
m>n
m
>
n
. Also generate some vector
b∈Rm
b
∈
R
m
.
Now find
x=argminx||Ax−b||2
x
=
arg
min
x
|
|
A
x
−
b
|
|
2
.
Print the norm of the residual.
代码
import numpy as np
import scipy.linalg as la
m = 8
n = 6
A = np.random.rand(m, n)
print("A =\n", A)
b = np.random.rand(m, 1)
print("b =\n", b)
x = la.lstsq(A, b)[0]
print("x =\n", x)
norm = la.norm(np.dot(A, x) - b, ord=2)
print("norm = ", norm)
结果
Exercise 2: Optimization
Find the maximum of the function
f(x)=sin2(x−2)e−x2
f
(
x
)
=
s
i
n
2
(
x
−
2
)
e
−
x
2
代码
import numpy as np
import scipy.optimize as op
def func(x):
return -np.sin(x-2) ** 2 * np.exp(-(x ** 2))
x = op.minimize_scalar(func, bounds=[-10, 10], method="bounded").x
func = -op.minimize_scalar(func, bounds=[-10, 10], method="bounded").fun
print("x = ", x)
print("Maximum = ", func)
结果
Exercise 3: Pairwise distances
Let
X
X
be a matrix with rows and
m
m
columns. How can you compute the pairwise distances between every two rows?
As an example application, consider cities, and we are given their coordinates in two columns. Now we want a nice table that tells us for each two cities, how far they are apart.
Again, make sure you make use of Scipy’s functionality instead of writing your own routine.
代码
import numpy as np
import scipy.spatial.distance as dt
n = 4
m = 6
X = np.random.rand(n, m)
print("X =\n", X)
dist = dt.cdist(X, X)
print("Distance:\n", dist)