登录
首页 » 算法 » 给予全局误差和局部误差的最小二乘辨识

给予全局误差和局部误差的最小二乘辨识

于 2022-06-30 发布 文件大小:3.16 kB
0 186
下载积分: 2 下载次数: 1

代码说明:

其中BPNN_global.m为给予全局误差最小二乘辨识,BPNN_local为基于局部误差最小二乘辨识

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • 线性代数方程组的求解全选主元高斯消去全选主元高斯约当消去复系数方程组的全选主元高斯消去...
    线性代数方程组的求解全选主元高斯消去法全选主元高斯约当消去法复系数方程组的全选主元高斯消去法-linear algebraic equations to solve all the main election yuan Gaussian Elimination entire election PCA about when Gaussian Elimination of complex equations of the entire election PCA Gaussian Elimination Act, etc.
    2022-05-05 11:28:38下载
    积分:1
  • YUV 视频帧 Sobel 方
    /*对象: 视频文件 ;YUV 4: 2: 0日期: 13/1/18 10:28#ifndef #define #include #include #include #include / / 定义图像高度和宽度的帧数高度 480宽度 640NUM_FRAME 20THRESH_HOLD_Y 20THRESH_HOLD_U 1THRESH_HOLD_V 1因舍尔沙尔 / / 函数原型无效 / / 初始化的内存Sobel_Assign (无符号字符型 *
    2022-04-14 22:45:48下载
    积分:1
  • Gaussian elimination method to solve high
    高斯消去法求解高阶矩阵,拟合椭圆等时需要用到的-Gaussian elimination method to solve high-order matrix, fitting ellipse, etc. need to use
    2023-02-21 22:00:03下载
    积分:1
  • 矩阵奇异分解(svd)最新c++版本,性能更稳定
    矩阵奇异分解(svd)最新c++版本,性能更稳定-matrix decomposition (SVD) c latest version of a more stable performance
    2023-05-31 05:40:02下载
    积分:1
  • 易语言内存进程读写例程
    资源描述易语言内存进程读写例程易语言内存进程读写例程易语言内存进程读写例程易语言内存进程读写例程易语言内存进程读写例程易语言内存进程读写例程易语言内存进程读写例程易语言内存进程读写例程易语言内存进程读写例程易语言内存进程读写例程易语言内存进程读写例程
    2022-05-08 10:08:04下载
    积分:1
  • fortran source code for fdtd parall computing
    fortran source code for fdtd parall computing
    2023-09-03 04:30:03下载
    积分:1
  • paxos的源码实现
    分布式系统的大作业,关于paxos算法的实现。
    2022-02-13 22:06:01下载
    积分:1
  • 递推关系的建立及在信息学竞赛中的应用 欢迎下载ginger547的资料
    递推关系的建立及在信息学竞赛中的应用 欢迎下载ginger547的算法资料-recurrence relations and the establishment of the Information Science Contest welcome to download the application of the algorithm information ginger547
    2022-12-03 14:10:03下载
    积分:1
  • 解调
    本方案用于PIC与测量加速器和角度的角度传感器的连接。您必须创建一个mikroC项目并将这个C文件添加到这个项目中。请记住,不要修改此文件中的任何内容
    2022-11-19 20:35:03下载
    积分:1
  • Sicily 1009梅森素数
    One of the world-wide cooperative computing tasks is the "Grand Internet Mersenne Prime Search" -- GIMPS -- striving to find ever-larger prime numbers by examining a particular category of such numbers. A Mersenne number is defined as a number of the form (2p–1), where p is a prime number -- a number divisible only by one and itself. (A number that can be divided by numbers other than itself and one are called "composite" numbers, and each of these can be uniquely represented by the prime numbers that can be multiplied together to generate the composite number — referred to as its prime factors.) Initially it looks as though the Mersenne numbers are all primes. Prime Corresponding Mersenne Number 2 4–1 = 3 -- prime 3 8–1 = 7
    2022-03-17 05:46:40下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载