十三周作业 python scipy

10.Scipy

Exercise 10.1: Least squares
Generate matrix A 2 Rm×n with m > n. Also generate some vector b 2 Rm.
Now find
x = arg minx kAx - bk2.
Print the norm of the residual.

import numpy as np   
import scipy.optimize as op  

m = 6  
n = 4  
A = np.random.normal(4,1, (m, n))  
b = np.random.normal(6,1,(m, 1))  
x = np.dot(np.dot(np.linalg.inv(np.dot(A.T, A)), A.T), b)  
print(x) 
Exercise 10.2: Optimization
Find the maximum of the function
f ( x ) = sin 2 ( x - 2) e - x 2
import numpy as np   
import scipy.optimize as op

fun = lambda x : (-1)*(np.sin(x-2))**2*np.exp((-1)*(x**2))  
m = op.fmin(fun, 0)  
print((-1)*m[0])
Exercise 10.3: Pairwise distances
Let X be a matrix with n rows and m columns. How can you compute the pairwise distances between
every two rows?
As an example application, consider
n 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.optimize as op
import scipy.spatial.distance as dis

m = 6  
n = 4
X = np.random.rand(m,n)  
Y = dis.pdist(X, 'euclidean')  
print(Y)

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值