资源列表
t2_4
- 本题采用的计算方法为:主要求解三对角阵方程组得解。采用的计算方法为“追赶法”。 算法思路为:求解方程Ly=d(追)——〉求解Ux=y(赶) -that the use of the method of calculating : three pairs for the main diagonal matrix equations in the solution. Using the method of calculating "catch up law." Algor
DRNN
- 对角回归型神经网络的逼近对象程序,可以参考!希望能对大家有所帮助!-right angle regression neural network approximation object, we can make reference! The hope is to help everyone!
euler
- By the proof of Lemma 2 of Section 5.2, this accomplished as follows:
11
- 表达式求值(加减乘除),可以用,但其中不能使用负数-Expression evaluation (Math), you can use, but can not use negative
permutation
- 这是一个算法设计题目,要求输入一个正整数n,将1~n之间的每个数排列2次, 要求两个1之间有一个数,两个2之间有两个数,两个3之间有3个数,......, 两个n之间有n个数。列出所有的可能排列。-This is a subject of algorithm design, to enter a positive integer n, the 1 ~ n 2 arranged between the number of times each, requiring a number be
4
- 机械优化设计中的随机方向法,利用垂直于坐标轴的初始方向搜索最优解,搜索次数多,收敛速度慢,有一定局限性-Mechanical design of multidimensional unconstrained optimization problem
bp
- bp神经网络源码源码,使用BP网络逼近对象,能够基本实现函数逼近效果-bp neural network source code, object approaching the BP network can basically function approximation results
yuesefuhuan
- 约瑟夫环,数据结构里面,链表的使用的实验设计-Joseph ring, data structure inside, the list of the use of the design of experiments
3
- 3.1 最长公共子序列问题 最长公共子序列(动态规划) 实验数据:input.txt X={A,B,C,B,D,A,B} Y={B,D,C,A,B,A} ——要求给出X、Y的最长公共子序列Z,程序运行结束时,将计算结果输出到文件output.txt中。输出文件中包含问题的答案:找不到公共子序列时给出“null” 。-3.1 the longest common subsequence problems longest common subsequence (dynamic
cengcipianli
- 按照一定的输入求出二叉树的层次遍历,输出相应的结果-Calculated in accordance with the input binary tree traversal of the hierarchy, the output of the corresponding results
Non_mon-Newton
- 最优化算法中的使用非单调线搜索求步长的拟牛顿算法的源码,matlab编程实现,希望对大家有用-The use of non-monotonic line optimization algorithm to search seeking step quasi-Newton algorithm source code, Matlab programming, and hope to be useful
Newton_Bisection-Method
- Newton Raphson and Bisection Root Finding Algorithm