leetteel

% 计算数组c，d之间的关系；[q,w]=sort(c,1);f=d(w);coefficient=polyfit(q,f,1); %用一次函数拟合曲线，想用几次函数拟合，就把第三个参数设成那个数y1=polyval(coefficient,q)plot(q,f,'o',q,y1,'-')

syms y x t;y=x+t;z=int(y,x,0,10);z=subs(z,t,3);

import numpy as npfrom matplotlib import pyplot as pltplt.rcParams['font.sans-serif']=['SimHei']plt.rcParams['axes.unicode_minus'] = Falsedef myfun1(x, y1, y2): return y2def myfun2(x,y1, y2): return np.exp(2*x)*np.sin(x)-2*y1+2*y2def od

import numpy as npdef fgauss(A, b): n = A.shape[0] zengguan = np.hstack((A, b.T)) ra = np.linalg.matrix_rank(A) rz = np.linalg.matrix_rank(zengguan) temp1 = rz - ra if temp1 > 0: print("无一般意义下的解，系数矩阵与增广矩阵的秩不同")

import numpy as npfrom matplotlib import pyplot as pltplt.rcParams['font.sans-serif']=['SimHei']plt.rcParams['axes.unicode_minus'] = Falsedef myfun1(x, y1, y2, y3): return y2def myfun2(x, y1, y2, y3): return y3def myfun3(x,y1, y2, y3):

def kaifa(x, n, error): x0 = x err = 1 x = x0/n if x0 == 1: x = 1 elif x == 0: x == 0 elif x < 0: print('输入参数错误！') return 0 else: while err > 10**(-1*error): x = x - (x**

import numpy as npdef myfun(x): if x == 0: return 1 else: return np.sin(x)/xdef tixing(fun, a, b, h): n = int((b-a)/h)+1 x = np.linspace(a, b, n) sum1 = 0 for i in range(1, n-1): sum1 = sum1 + h*fun(x[i

print('-'*22, '不使用加速收敛技术', '-'*22)err = 1x = 1.5k = 0while err > 0.000000001: k = k + 1 x0 = x x = (3*x-1)**(1/3) err = abs(x - x0) if err < 0.000000001: print('第{:<2}次迭代结果为{:.7}，误差为{}'.format(k, x, err))print('-'*

def myfun(x, y): return -1*(0.9*y)/(1+2*x)def rk(h, x, y, s, b, myfun): x_r = [] for i in range(int(b/h)): x_r.append(x) k1 = h * myfun(x, y) k2 = h * myfun(x + h/2, y+0.5*k1) k3 = h * myfun(x + h/2, y+0.5*k2)

import numpy as npimport mathdef sgn1(x): if x > 0: return 1 elif x == 0: return 0 elif x < 0: return -1ai2 = np.mat([[-1, 2, 1], [2, -4, 1], [1, 1, -6]], dtype=float)n = ai2.shape[0

import numpy as npdef lufenjie(a): n = a.shape[0] L = np.mat(np.zeros((n, n), dtype=float)) for i in range(n): L[i, i] = 1 u = np.mat(np.zeros((n, n), dtype=float)) u[0, :] = a[0, :] L[1:n, 0] = a[1:n, 0]/u[0, 0] for

import numpy as npz0 = np.mat([1, 1, 1])z0 = z0.Terr = 1A = np.mat([[-1, 2, 1], [2, -4, 1], [1, 1, -6]], dtype=float)m_r = []k = 0print('乘幂法：')while err > 0.00000000001: y = A * z0 y1 = y.copy() y1 = abs(y1)

import numpy as npz0 = np.mat([1, 1, 1])z0 = z0.Terr = 1A = np.mat([[-1,2,1], [2,-4,1], [1,1,-6]], dtype=float)m_r = []k = 0while err > 0.0000001: y = A * z0 y1 = y.copy() y1 = abs(y1) a = y1.argmax()

import numpy as npdef fgauss(A, b): n = A.shape[0] zengguan = np.hstack((A, b.T)) ra = np.linalg.matrix_rank(A) rz = np.linalg.matrix_rank(zengguan) temp1 = rz - ra if temp1 > 0: print("无一般意义下的解，系数矩阵与增广矩阵的秩不同")

高斯-塞德尔迭代import numpy as npx = [0, 0]err = 1k = 0while err > 0.0000001: k = k+1 x[0] = 0.25*(1+x[1]-0.1*np.exp(x[0])) x[1] = 0.25*(x[0]-(1/8)*x[0]*x[0]) err = max(abs(4*x[0]-x[1]+0.1*np.exp(x[0])-1), abs(-x[0]+4*x[1]+x[0]*x[0]/8))

from matplotlib import pyplot as pltimport numpy as npdef fun(x): return x**3-2*x-5def dfun(x): return 3*x*x-2def newton(fun,dfun,a,b,eps): err = 1 x = b k = 0 lada = 1 x_r = [] x_r.append(x) x = x - fun(x) / d

from matplotlib import pyplot as pltimport numpy as npdef fun(x): return x**3-2*x-5def dfun(x): return 3*x*x-2def newton(fun,dfun,a,b,eps): err = 1 x = b k = 0 lada = 1 x_r = [] x_r.append(x) x = x - fun(x) / d

from matplotlib import pyplot as pltimport numpy as npdef fun(x): return x**3-2*x-5def dfun(x): return 3*x*x-2def newton(fun,dfun,a,b,eps): err = 1 x = b k = 0 lada = 1 x_r = [] while err > eps: x_r.appe

import numpy as npdef fun(x): return x**3-2*x-5def dfun(x): return 3*x*x-2def newton(fun,dfun,a,b,eps): err = 1 x = b c = dfun(x) k = 0 while err > eps: x = x - fun(x)/c err = fun(x) k = k+1

from matplotlib import pyplot as pltimport numpy as npdef fun(x): return x**3-2*x-5def dfun(x): return 3*x*x-2def newton(fun,dfun,a,b,eps): err = 1 x = b while err > eps: x = x - fun(x)/dfun(x) err = fun(x)

def fun(x): return x**3-2*x-5def erfenfa(fun,a,b,e): err = 1 a = 2 b = 3 while err > e: x = (a+b)/2 err = abs(fun(x)) if fun(a)*fun(x) < 0: b = x else: a = x return x

最速下降法算法流程最速下降法的优缺点代码import numpy as npfrom matplotlib import pyplot as pltplt.rcParams['font.sans-serif']=['SimHei']plt.rcParams['axes.unicode_minus'] = Falsedef newton(A, b, error,nmax): n1 = A.shape[0] x = np.mat(np.zeros((n1, 1)))

3.龙格-库塔法# 改进欧拉法import numpy as npfrom matplotlib import pyplot as plth = 0.2x = 1x_r = []t = 0for i in np.linspace(h, 1, 10): x_r.append(x) k1 = h * (x - 2*t/x) x1 = x + k1/2 k2 = h * (x1 - 2*(t+h/2)/x1) x2 = x + k2 / 2 k3 =

1.欧拉法import numpy as npfrom matplotlib import pyplot as plth = 0.0001x = 1x_r = []for i in np.linspace(0, 1, 100000): x_r.append(x) x = x + x*hx_1 = [h*(i+1) for i in range(len(x_r))]e_1 = [np.exp(i) for i in x_1]plt.plot(x_1, x_r, 'ks')p

#龙贝格积分法函数import numpy as npfrom matplotlib import pyplot as pltfrom mpl_toolkits.axes_grid1.inset_locator import inset_axesdef romberg(fun, a, b): sum = 0 t1 = ((b - a)*(fun(a)+fun(b)))/2 for i in range(1, 2): sum = sum + fun(a+(

import numpy as npfrom matplotlib import pyplot as pltdef fgauss(A, b): n = A.shape[0] zengguan = np.hstack((A, b.T)) ra = np.linalg.matrix_rank(A) rz = np.linalg.matrix_rank(zengguan) temp1 = rz - ra if temp1 > 0: pr

这里对三次样条插值函数，拉格朗日插值多项式，牛顿插值多项式这三种插值方法进行比较代码import numpy as npfrom sympy import *from matplotlib import pyplot as pltdef lagrange(x, y): p, la = symbols('p la') n = len(x) s = 0 for k in range(n): la = y[k] for j in ra

代码import numpy as npfrom sympy import *from matplotlib import pyplot as pltdef spline(x, y, t): n = len(x) h = [x[i]-x[i-1] for i in range(1, n)] A = np.eye(n-2) A = A*2 u1 = [h[i]/(h[i]+h[i+1]) for i in range(n-2)] la1 = [1-u

代码在这里插入代码片结果如下图所示

代码import numpy as npfrom sympy import *from matplotlib import pyplot as pltdef hermite(x, y, dy): p, la = symbols('p la') f = 0 n = len(x) for i in range(n): la = 1 lp = 0 for j in range(n): if j !

代码import numpy as npfrom sympy import *from matplotlib import pyplot as pltdef newton(x, y): n = len(x) c = np.zeros((n, n)) print(c) for i in range(n): c[i, 0] = y[i] for i in range(1, n): for j in range(i, n):

#代码

引言SymPy是用于符号数学的 Python 库。详细教程见目录引言加载sympy库定义符号,替换代码结果代码结果展开代码结果加载sympy库from sympy import *定义符号,替换代码x = symbols('x ')str_expr = 'x**2 + 2*x + 1'expr = sympify(str_expr)y = expr*expr+1print(expand(y))print(y.subs(x, 1))结果代码x = symbols('x ')

待写

待写

待写

待写

基于豪斯霍尔德变换的QR分解# Householderimport numpy as npdef householder(a): temp = 1 m = a.shape[0] n = a.shape[1] for i in range(0, n-1): x = a[i:n, i] print("x向量为：") print(x) e = np.mat(np.zeros((n-i, 1), dtype

基于吉文斯变换的QR分解# 基于吉文斯变换的QR分解import numpy as npdef givens(A): m = A.shape[0] n = A.shape[1] P = np.mat(np.eye(n)) p1 = P for i in range(0, n-1): for j in range(i+1, n): if A[i, j] == 0: continue