搜索资源列表
ntree
- 设T 是一棵带权树，树的每一条边带一个正权。又设S 是T 的顶点集,T/S 是从树T 中 将S中顶点删去后得到的森林。如果T/S中所有树的从根到叶的路长都不超过d ，则称T/S 是一个d 森林。 (1)设计一个算法求T的最小顶点集S，使T/S是d 森林。(提示：从叶向根移动) (2)分析算法的正确性和计算复杂性。 (3)设T中有n 个顶点，则算法的计算时间复杂性应为O(n)。-based T is a right to bring a tree for every one o
PolynomialIncludingAllFunctions
- 一元多项式符号计算-含因式分解版 不仅包含+,-,*,/,多项式求值,数值积微分,(内含多项式求根子程序),定与不定积分,还有因式分解(求根法). 用单链表.输入格式按提示.-one yuan polynomial symbolic computation-containing factorization version not only contains ,-,*,/, polynomial evaluation, Numerical plot differential (intron
ALGER
- 使用C++编写的经典数值计算算法,包括NEWTON迭带法,SIMPSON,二分法,二分法求根,还附加了模式识别的FISHER算法-prepared to use the classic C numerical algorithms including Netwon Diez belt law, Simpson, black, black roots, also added a pattern recognition algorithm Fisher
Bi_formula
- 二分法求方程的实根 很简单的一个程序 要不是为了下一个东西，我才不会上这么变态的网站！-dichotomy equation for the real roots of a very simple procedure but for the sake of the next one thing, I would not be such a metamorphosis on the website!
chswordV2
- Jacobi GaussSeidel法求算式的根-Jacobi GaussSeidel Act formula for the roots
for_equation_real_radix
- 分别用二分法 Newton法 弦截法(割线法) 求方程x3-3x2+x-1= 0的全部实根(精度小于0.00001)。-respectively dichotomy Newton law xianjie (secant) Equation x3-3x2 x-1 = 0 all real roots (precision of less than 0.00001).
newton_raphson
- Summary: Newton-Raphson method for all real roots of the polynomial. MATLAB Release: R11 Descr iption: This M-file calculates all the real roots of the given polynomial. It calls syn_division, a synthetic division function, and derivate, differ
Numerical_Computing_with_MATLAB
- Numerical Computing with MATLAB （by Cleve Moler) is a textbook for an introductory course in numerical methods, Matlab, and technical computing. The emphasis is on in- formed use of mathematical software. We want you learn enough about the mathe-
ncm
- Toolbox for Numerical Computing with MATLAB （by Cleve Moler). Numerical Computing with MATLAB （by Cleve Moler) is a textbook for an introductory course in numerical methods, Matlab, and technical computing. The emphasis is on in- formed u
fixed_point
- matlab function ---> find roots using fixed-point iteration
bisect
- 用二分法求解非线性方程,只要用户输入所求的方程,方程的根就很快被程序计算出,方便而且还很快捷.对于数值分析这样的课程,将算法通过程序实现,具有很好的教学价值.-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 an
A_maths_me1067647162002
- This is a program that will let you calculate roots with the Quadratic formula (including complex roots), Factorial of a number, Fibonacci series (and Pascals Triangle still under construction).
牛顿迭代法(M)
- 原题：编写一个子程序NewTon（float x0，float eps，float x1）。它的功能是用牛顿迭代法求f（x）=x*x*x-2x*x+4x+1在x=0附近的一个实根。若迭代成功，则返回费0值；否则，返回0。-original title : the preparation of a subroutine NewTon (x0 float, float eps, float x1). Its function is to use Newton's iterative meth
polynomials10
- This library defines basic operation on polynomials, and contains also 3 different roots (zeroes)-finding methods that can handle quite large polynomials (>1000 coefs) Implemented in ANSI C++ Templates. Handles all real and complex floating p
roots
- 一元多项式方程求根，可以求出方程的所有根，包括虚根-Code to find all real roots of a polynomial with real coefficients.
finding-roots
- finding roots by search method
roots-music.m
- 空间谱估计算法中的求根MUSIC算法，很简单程序。-Spatial spectrum estimation algorithm finding roots of MUSIC algorithm is very simple program.
the-roots-of-quadratic-equations
- search for the roots of quadratic equations
roots-by-gauss-ellimination
- this code of matlab finds the roots of equation by gauss elimination mthod
ROOTS
- finding roots to a function using bisection and newton method