搜索资源列表
线性方程组求解与方程组性态讨论
- 线性方程组求解与方程组性态讨论(实验报告)三次样条插值问题,数值积分,微分方程数值解,线性方程组的迭代解法,非线性方程的迭代解法-solving linear equations and the equations behavior discussion (Experiment), cubic spline interpolation, numerical integration, the numerical solution of differential equations, linear
迭代法
- 是用C做的迭代法的实验报告-C is doing iterative method of experimental report
Tenprograms
- 数值计算方法相关的十个程序.包括对分法、迭代法、牛顿法、割线法、高斯消元法、雅克比迭代法程序、幂法、线性拟合态、-numerical calculation method related to the 10 procedures. Including the right method, iterative method, Newton's method, secant, PGE, Jacques procedures than the iterative method, power, l
linear_solution
- 原创的线性方程组求解程序，包括Jacobi迭代，高斯消去法，Gauss-Seidel迭代三种求解算法。-Original procedure for solving linear equations, including the Jacobi iteration, Gauss elimination method, Gauss-Seidel iterative algorithm three.
111
- 用迭代法求a的立方根,求立方根 迭代公式为 ::Xi+1=2/3*Xi+a/(3*Xi*Xi) -Iterative method of seeking a cube root, cube root iteration formula is seeking:: Xi+1 = 2/3* Xi+ a/(3* Xi* Xi)
ChordIntercept
- 基于Java的迭代法，是数值计算方法的实验题。-Java-based iterative method is a numerical calculation of the experimental problems.
Iteration
- 基于Java的迭代法，是数值计算方法的实验题。-Java-based iterative method is a numerical calculation of the experimental problems.
tree
- J2me手机程序，此程序的功能是在320*240的屏幕上利用迭代法画一颗迭代树-J2me mobile phone program, this program' s function is 320* 240 screen on the use of an iterative method iterative tree paintings
binary_tree
- this program use binary search tree. Searching a binary tree for a specific value can be a recursive or iterative process. This explanation covers a recursive method
K-means
- kmeans算法， K-means算法是最为经典的基于划分的聚类方法，是十大经典数据挖掘算法之一。K-means算法的基本思想是：以空间中k个点为中心进行聚类，对最靠近他们的对象归类。通过迭代的方法，逐次更新各聚类中心的值，直至得到最好的聚类结果-kmeans algorithm, K-means algorithm is the most classic divide-based clustering method is one of the top ten classical data mi
Apriori-
- Apriori算法是R.Agrawal和R.Srikant于1994年提出的为布尔关联规则挖掘频繁项集的原创性质算法。正如我们将看到的，算法的名字基于这样的事实：算法使用频繁项集性质的先验性质。Apriori使用一种称作逐层搜索的迭代方法，k项集用于探索（k+1）项集。首先，通过扫描数据库，累积每个项的计数，并收集满足最小支持度的项，找出频繁1项集的集合。该集合记作L1。然后L1用于找频繁2项集的集合L2，L2用于找L3，如此下去，知道不能在找到频繁项集k项集。找每个Lk需要一次数据库全扫描。-
wchy_agui
- 计算方法大作业源代码，实现了二分法，牛顿迭代法，高斯消去法，解三对角分解法，雅可比迭代法等10余个算法-Method to calculate the project source code, the realization of the dichotomy, Newton iterative method, gauss elimination, solving tridiagonal decomposition method, Jacobi iteration method and so on
Finalwork
- 结合java图形界面编程实现了计算方法中的相关的算法，包含：雅可比迭代 高斯-塞德尔迭代 拉格朗日插值 主元素高斯消去 高斯-约当消去 牛顿插值 不含列主元高斯约当法 二次多项式拟合 一次多项式拟合 二分法 牛顿迭代 三次样条插值 三对角的追赶法-Combined with java GUI programming calculation method of the related algorithms, comprising: Jacobi iteration Gauss- Seidel it
s
- 简单迭代法工作原理,电磁场电磁波课程实验第几节第一个-Simple iterative method works
Apriori
- apriori算法，逐层搜索的迭代方法，首先寻找1-项频繁集的集合，集合记做L1， L1用于寻找两项频繁集合L2，L2用于寻找L3，如此下去，直到不能找K项频繁集合-apriori algorithm，Layer by layer search iterative method, first of all, to find a set of 1- frequent itemsets, set to remember to do L1, L1 used to find two frequent s