搜索资源列表
Newton_Bisection
- 数值计算中的二分法和牛顿迭代法的演示,通过对数值的计算-Numerical calculation of the dichotomy and the Newton iteration of the demonstration, through numerical calculation
duoxiangshi
- 输入系数和最高阶次,可以求得多项式的根(二分法),dos界面操作-Input factors and the most high-level meeting, you can find the root of polynomial (dichotomy), dos interface operation
2-1
- 二分法求方程的根,非常好的算法,自己编写的-Equation for the root of the dichotomy, very good algorithm, I have written
Main
- Algorithm of dichotomy method
xuexi
- 新函数重载,快速排序,二分法等学习的很好的例子,练练手把-Overloaded new function, quick sort, and so the dichotomy of the good example to learn, huh练练hand
binarysearch
- 二分法求解方程的c语言实现,sin(x)在(-3,7)范围内的c语言实现方法-Solving the equation c dichotomy language, sin (x) in (-3,7) c language within the scope of implementation
nonlinear_epuation_solve
- 非线性方程组解法源代码,包括二分法和牛顿法,数值分析作业,给初学者作参考。-Solution of nonlinear equations the source code, including the dichotomy and the Newton method, numerical analysis of operations, to the beginners for reference.
1.6
- 这是一个二分法求方程根的程序,希望设计思路对你有所启发,共同交流-This is an equation for the root of the dichotomy procedure, you want to design some enlightenment, common exchange
erfenfa
- 二分法解非线性方程,通过C编程,可以解决高校学生作业问题-Dichotomy of solutions of nonlinear equations
binarysearch
- 本例演示一种较高级的查找方式:二分法查找。-This example shows you a more advanced way to find: Find dichotomy.
bisectroot
- 本例向大家演示用二分法求解方程f(x)=sin(x)在(-3,7)这个范围内。-This example to demonstrate the dichotomy used to solve equations f (x) = sin (x) in (-3,7) in this range.
spgs
- 用途:利用二分法快速求解非线性方程f(x) = 0; 用向量形式(普通存储格式)的Gauss-Seidel迭代解线性方程组Ax=b;Newton迭代法解非线性方程f(x) = 0;用分量形式的SOR迭代解线性方程组Ax=b;用向量(稀疏存储)形式的Gauss-Seidel迭代解线性方程组Ax=b -Purposes: the use of dichotomy quickly solving nonlinear equations f (x) = 0 with vector form o
math
- 非线性方程求根的各种算法的比较, //求非线性方程的根 //程序中共给出了以下几种方法求非线性方程的根 // (1)二分法 (2)牛顿法 (3)普通迭代法 (4)斯蒂芬森迭代法 (5)弦截法 //程序中用到的函数为: f(x)=x^3-x-1 //其中:(1)普通迭代法用的迭代函数为:x=(x+1)^(1/3) // (2)斯蒂芬森迭代法用的迭代函数为:x=x^3-1-Root of all kinds of non-linear equation algorithm,/
1
- 数据结构 内部排序分析(C++源代码) 其中包括 第一种算法为选择排序,二为插入排序,三是冒泡排序,六是二分法插入排序-Analysis of internal data structure to sort (C++ source code) which includes an algorithm for the selection of the first order, second for the Insertion Sort, Bubble Sort is three, six is
sorts
- 各种排序方法的比较。有冒泡法,二分法,插入法,选择法,并比较其时间复杂度和空间复杂度-Comparison of various sorting methods. There are bubble law, dichotomy, insertion, selection, and compare its time complexity and space complexity
Formula_Numerical_Analysis
- 数值分析中用于求近似值的算法、二分法解方程、变步长梯形求积分的算法。是在Linux下用C++实现的。用G++编译。 配合华中科大的那本著名的“数值分析”。李庆扬编著。 用来交作业很好。 在本压缩包里面包含的是: HalfDevision.d 二分法解方程 LagrgIn.d 拉格朗日差值公式-求近似值 NewtonFwIn.d 牛顿前插公式-求近似值 NewtonItera.d 牛顿迭代法-求近似值 VarStpTrpzoItg.d 变步长梯形积
bintree
- 二叉树的两种排序功能,快速排序,二分法排序。有效排列二叉树-Function of two binary tree sort, quick sort, sort of dichotomy. Effective binary tree with
DichotomyRoot
- 二分法求根的C实现 二分法求根的C实现-Dichotomy Root
bisectVC
- 用二分法求解非线性方程,只要用户输入所求的方程,方程的根就很快被程序计算出,方便而且还很快捷.对于数值分析这样的课程,将算法通过程序实现,具有很好的教学价值-dichotomy used to solve nonlinear equations, as long as import demand equation, the equation roots soon be worked out procedures to facilitate and very fast. Numerical ana
p1
- 设计一个可以支持无限精度的计算器;支持+、-、*、/四种运算,至少一种运算运用分支法, 现+、-法用常规法,时间复杂度为O(n), *法可以使用常规法、二分法、FFT法- design can support an infinite precision calculator +,-,*,/ four computing support, computing at least one branch of law to use, =