最小二乘法矩陣

#! /usr/bin/env python# -*- coding: utf-8 -*-import numpy as npdef calc_left_k_mat(k):  """  獲得左側k矩陣  :param k:  :return:  """  k_mat = []  for i in range(k + 1):    now_line = []    for j in range(k + 1):      now_line.append(j + i)    k_mat.append(now_line)  return k_matdef calc_right_k_mat(k):  """  計算右側矩陣  :param k:  :return:  """  k_mat = []  for i in range(k + 1):    k_mat.append([i, i + 1])  return k_matdef pow_k(x, k):  """  計算x列表中的k次方和  :param x: 點集合的x坐標  :param k: k值  :return:  """  sum = 0  for i in x:    sum += i ** k  return sumdef get_left_mat_with_x(k_mat, k):  """  將 左側k矩陣運算得到左側新的矩陣  :param k_mat:  :param k:  :return:  """  left_mat = []  for kl in k_mat:    now_data = []    for k in kl:      now_data.append(pow_k(x, k))    left_mat.append(now_data)  return left_matdef get_right_mat_with(right_k_mat):  """  將 右側k矩陣運算得到右側新的矩陣  :param right_k_mat:  :return:  """  right_mat = []  for i in range(len(right_k_mat)):    sum = 0    for xL, yL in zip(x, y):      a = (xL ** right_k_mat[i][0]) * (yL ** right_k_mat[i][1])      sum += a    right_mat.append(sum)  return right_matdef fuse_mat(left, right):  """  融合兩個矩陣  :param left:  :param right:  :return:  """  new_mat = []  for i in range(len(left)):    asd = np.append(left[i], right[i])    new_mat.append(list(asd))  return new_matif __name__ == '__main__':  k = 3  x = [1, 2, 3]  y = [1, 2, 3]  # 計算原始左側K矩陣  left_k_mat = calc_left_k_mat(k)  print("原始左側K矩陣")  print(left_k_mat)  # 計算原始右側K矩陣  right_k_mat = calc_right_k_mat(k)  print("原始右側k矩陣")  print(right_k_mat)  # 計算左側 k 矩陣  new_left_mat = get_left_mat_with_x(k_mat=left_k_mat, k=k)  # 計算右側 k 矩陣  new_right_mat = get_right_mat_with(right_k_mat=right_k_mat)  print("計算后左側K矩陣")  print(new_left_mat)  print("計算后右側側K矩陣")  print(new_right_mat)  print("-----" * 10)  # 融合兩個矩陣 左側 矩陣每一行增加 右側矩陣的對應行  new_all = fuse_mat(new_left_mat, new_right_mat)  print("完整矩陣")  print(new_all)

總結

以上就是這篇文章的全部內(nèi)容了，希望本文的內(nèi)容對大家的學習或者工作具有一定的參考學習價值，謝謝大家對武林站長站的支持。如果你想了解更多相關內(nèi)容請查看下面相關鏈接