登录
首页 » Visual C++ » kalman_C

kalman_C

于 2006-03-01 发布 文件大小:2KB
0 245
下载积分: 1 下载次数: 1

代码说明:

说明:  离散随机线性系统的卡尔曼滤波。 其中13lman.c是卡尔曼滤波函数,4rinv.c是滤波函数中用到的矩阵求逆函数,13lman0.c是主程序。(discrete stochastic linear Kalman filtering system. 13lman.c which is the Kalman filter function, 4rinv.c filtering function is used in the matrix inversion function, is the main program 13lman0.c.)

文件列表:

13LMAN.C
13LMAN0.C
4RINV.C

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

发表评论

0 个回复

  • zuiyouerfenjiansuozhu
    最优二叉搜索树问题具有最优子结构性质,即其任意一棵子树都是一棵独立的最优二叉搜索树,所以可以采用动态规划方法,并且在每次更新时保存子树的根。(Optimal binary search tree problem has optimal substructure property that any of its sub-tree are an independent optimal binary search tree, so you can use dynamic programming methods, and save each update subtree roots.)
    2013-10-10 18:48:17下载
    积分:1
  • Ex3
    c++实现的静态链表 可以从屏幕输入来构建静态链表 数据结构重要的部分(c++ implemented statically linked list can be input from the screen to the important part to build a static linked list data structure)
    2012-11-27 15:19:25下载
    积分:1
  • kaikuohaohebikuohaodepipei
    开括号和比括号的匹配,数据结构内容,很不错(More than brackets and brackets to open the match, the contents of data structure)
    2009-04-13 14:35:56下载
    积分:1
  • Binary-Tree-Sort
    二叉树排序,二叉树的递归调用排序,属于C语言源码(Binary Tree Sort)
    2011-09-01 10:14:24下载
    积分:1
  • the-shortest-path-of-chart
    求有向图的最短路劲,根据所给图的边长和顶点,建立有向图,以邻接表的方式存储,并编写程序求从有向图任一点出发的最短路径(according to the graph with sides and vertex, establish a directed graph, and write a program find the shortest path from one of the point of the chart )
    2020-07-16 11:28:50下载
    积分:1
  • Figure-topological-sort
    说明:  拓扑排序   对一个 有向无环图 G进行拓扑排序,是将G中所有顶点排成一个线性序列,使得图中任 意一对顶点u和v,若u,v ∈E,则u在线性序列中出现在v之前。   通常,这样的线性序列称为满足拓扑次序的序列,简称 拓扑序列 。 注意:   ①若将图中顶点按拓扑次序排成一行,则图中所有的有向边均是从左指向右的。   ②若图中存在有向环,则不可能使顶点满足拓扑次序。   ③一个DAG的拓扑序列通常表示某种方案切实可行。 (Topological sort In a directed acyclic graph G topological sort, is all vertices will G formed a linear sequence, make diagram post Meaning a pair of vertex u and v, if u, v ∈ E, then u in linear sequence in which they appear in v before. Usually, such linear sequence sequence of topological order called meet, abbreviation topology sequence. Note: (1) if the diagram according to the topology order line vertices, then figure all from left to right edge are pointing. (2) if the figure to exist in the ring, is impossible to have the vertex meet topological sequence. (3) a DAG topological sequence usually expressed some scheme is feasible. )
    2011-03-22 17:19:14下载
    积分:1
  • DouglasPeucker
    道格拉斯—普克法(Douglas—Peucker)的C++程序(Douglas- Puck method (Douglas-Peucker) of the C++ program)
    2011-08-28 19:04:29下载
    积分:1
  • multiplication
    本程序是用c语言编写的在800位整数之间的乘积运算(This procedure is written in c the 800 integers in the product operation between)
    2009-05-16 22:04:42下载
    积分:1
  • d
    有助于c++的初学者在平日的学习中更好的学习(Contribute to better learning c++ beginners learning on weekdays)
    2013-11-29 14:32:18下载
    积分:1
  • Sort
    排序,各种排序算法,插入排序,冒泡排序,快速排序,等等!(Sorting, various sorting algorithms, insertion sort, bubble sort, quick sort, and more!)
    2011-05-08 00:09:13下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载