搜索资源列表
nonlinearNOWTONiterative
- 非线性方程组解法牛顿下山法,求解非线性方程组-nonlinear equations of Newton Method down, solving systems of nonlinear equations
xmds-1.4-1
- XMDS is a code generator that integrates equations. You write them down in human readable form in a XML file, and it goes away and writes and compiles a C++ program that integrates those equations as fast as it can possibly be done in your architectu
NiuDun java
- 求实系数代数方程全部根的牛顿下山法,java,源程序具有自带的数据，经过验证结果无误。使用者可以直接调用方法-realistic Algebraic equations of Newton-down, java, with its own source of data, proven correct results. Users can directly call methods
hyplas
- ************************************************************************ * * * * * THIS IS THE H Y P L A S 2.0 README FILE * * ----------------- * * * * HYPLAS is a finite element program for implicit small and large * * strain analisys of hyperelast
code-hxf 数据降维基本算法
- 浙江大学何晓飞写的数据降维基本算法，对初学者很有帮助-Zhejiang university HeXiaoFei wrote down the wiki data algorithm for beginners helpful
ludcmp.rar
- 矩阵的LU分解，通过基于主元法的分解法将矩阵分解为左右矩阵的积得形式。,LU matrix decomposition, the main element method-based decomposition of the matrix around broken down into a matrix form of the plot.
083
- 歌德巴赫猜想：验证2000以内的正偶数都能够分解成两个素数之和，即验证歌德巴赫猜想再2000范围内的正确性-Goldbach conjecture: Verify 2000 is even less able to break down into two prime numbers and that the Goldbach conjecture and then verify that the scope of the correctness of 2000
Lagrange2
- 这是一个用java高级编程语言编写的程序，实现了用“向上/向下修正方法”的拉格朗日插值公式计算某个函数的值，方便实用。-Java This is a high-level programming languages used in the preparation of procedures, implementation of the " up/down correction method," Lagrange interpolation formula of the valu
Numericalanalysiscalculationmethodscommonalgorithm
- 数值分析&计算方法常见算法C语言源代码，内容包括高斯消元，牛顿下山，雅克比迭代等常用数值算法！-Numerical analysis & calculation methods common algorithm C language source code, including Gauss, Newton down the mountain, such as Jacobian iterative numerical algorithm used!
ndxsf
- 用牛顿下山法解方程x^3-x-1=0 （初值为0.6） 输入：初值，误差限，迭代最大次数，下山最大次数 输出：近似根各步下山因子 -Solution using Newton' s law equation down x ^ 3-x-1 = 0 (initial value 0.6) input: initial value, the error limit, the maximum number of iterations, the maximum number of se
cox_algorithm
- in his name this code is simulation of cox algorithm for ofdm synchronization in WIMAX down link systems. it send 2 frame via awgn channel and uses from correlation to detect the beginning of frame. .-in his name this code is simulat
poly
- this code is simulation of dm synchronization with poly phase sequences with good auto correlation sequences that proposed in 2004 by ieee in ieee 802.16 standard(wimax down link)-this code is simulation of ofdm synchronization with poly phase sequen
lindo-lingo
- lindo-lingo讲稿，跟老师拷的喜欢就下来看看吧-lindo-lingo scr ipt, tell the teacher to like to copy down what we' ve learned
Seekprimes
- 求素数，并且保存于文本文件，并且下次执行还可以接着上次的结果继续找下去 所以总有一天你会找到最大的素数……每天就像挂Q一样挂一下这个程序就行了-Seek primes, and stored in a text file, and the next performance can also be followed by the last results continue to look down so that one day you will find the largest prime
topdown
- source code for top down parsing of a grammar in compilers
MEGforward
- 计算仿真脑电波信号的,从国外网站上下来的,-Computer simulation of brain wave signals from a foreign Web site down,
FiveDirectionPad_Algo
- 此作業需使用Backtracking algorithm 從第一格開始，從1到9依序測試是否可以填入，若本來此格已有數字，則直接往下一格走。若可以填入( if(promising()) )則填入該數字並且往下一格移動繼續填，若此格沒有可填入的數字時，則結束該格的動作，回到上一格去測試剩下的可能結果。若已經填完( if(solution is found) )，則可能解+1，然後回到前面再繼續尋找接下來的可能解。直到全部可能的數字組合都試完之後，程式結束，所有可能解的個數也會被找到。需要印出的
ji-suan-fang-fa-shiyan
- 计算方法实验：包括高斯迭代和牛顿下山法；1、用Gauss - Seidel 迭代法求解方程组 10x1-x2-2x3=7.2 -x1+10x2-2x3=8.3 -x1-x2=5x3 输入：系数矩阵A，最大迭代次数N，初始向量，误差限e 输出：解向量 2、用牛顿下山法解方程 x*x*x-x*x-1=0（初值为0.6） 输入：初值，误差限，迭代最大次数，下山最大次数 输出：近似根各步下山因子。-Experimental method: includ
chenlieguan
- 世界名画陈列馆由nm × 个排列成矩形阵列的陈列室组成。为了防止名画被盗， 需要在陈列室中设置警卫机器人哨位。每个警卫机器人除了监视它所在的陈列室外，还可以监视与它所在的陈列室相邻的上、下、左、右4 个陈列室。试设计一个安排警卫机器人哨位的算法，使得名画陈列馆中每一个陈列室都在警卫机器人的监视之下，且所用的警卫机器人数最少。 算法设计： 设计一个优先队列式分支限界法，计算警卫机器人的最佳哨位安排，使得名画陈列馆中每一个陈列室都在警卫机器人的监视之下，且所用的警卫机器人数最
shizilianbiao
- typedef struct OLNode { int i,j ElemType e struct OLNode *right,*down } OLNode, *OLink typedef struct { OLink *rhead,*chead int mu,nu,tu } CrossList 十字链表法，求解稀疏矩阵运算，程序容易看懂。不过没有乘法-typedef struct OLNode { int i,j E