Search - polynomial root

Search - polynomial root - List

[Algorithm] 牛顿法解多项式的根 DL : 0: 牛顿法解多项式的根包含重根的判断和多项式的输入-Newton method for polynomial root contains heavy-judgment and the importation of polynomials
Date : 2025-12-20 Size : 193kb User : 洋溢
[Algorithm] newton_new DL : 0: 牛顿法解多项式的根输入：多项式系数c[]，多项式度数n，求在[a,b]间的根输出：根要求保证[a,b]间有根-Newton method for polynomial root input : polynomial coefficients c [], polynomial degree n, for [a, b] the root output :-assurance [a, b]- between
Date : 2025-12-20 Size : 1kb User : 周远
[Algorithm] jsffsybg DL : 0: 十三个计算方法源程序,实现了拉格朗日插值多项式牛顿插值多项式自适应梯形公式牛顿切线法问题：求方程的根 -13 method of calculating the source code to achieve the Lagrange interpolation polynomial interpolation polynomial Newton Newton adaptive trapezoid formula tangent law: seeking the root of equation
Date : 2025-12-20 Size : 185kb User : kang
[Algorithm] numerical_analysis_classic DL : 0: 数值分析中最常用的14个程序： 01_N皇后问题 01_循环赛程表 02_分段线性插值 02_牛顿插值法 03_构造正交多项式 03_最佳一致逼近多项式 04_简单迭代法求方程根[1+1；x] 04_简单迭代法求方程根[sqrt(x+1)] 05_复化梯形公式求积 06_尤拉公式解初值问题 08_高斯消去法解方程组 09_连分式法求积 10_迭代法解线性方程组 10_雅可比方法-Numerical analysis of the 14 most commonly used procedures: 01_N Queen s problem 01_ cycle calendar 02_ piecewise linear interpolation 02_ Newton interpolation 03_ structure orthogonal polynomials 03_ best uniform approximation polynomial 04 _ a simple iterative method for root equation [1+ 1 x] 04_ simple iteration equation for the root [sqrt (x+ 1)] 05_ complex formula of trapezoid quadrature formula 06_ yula 08 initial value problem solutions _ Gaussian elimination solution equations 09_ continued fractions method 10_ quadrature iteration solution of linear equations Jacobian 10_ Ways
Date : 2025-12-20 Size : 2.92mb User : 丁一
[Algorithm] N_COmp DL : 0: 数值计算算法，包括：（1）Lagrange插值（2）Newton 插值（3）求f(x0)：秦九韶法（4）求实系数多项式f(z0)。z0为复数（5）二分法求f(x)=0的根（6）弦截法求f (x)=0的根（7）求实系数多项式方程的实根、复根（8）解线性方程组：Gauss列主元素消去法( 9 )快速弗利叶变换（FFT） -Numerical algorithms, including: (1) Lagrange interpolation (2) Newton interpolation (3) for f (x0): Qin Jiushao Law (4) realistic coefficient polynomial f (z0). z0 for the plural (5) dichotomy for f (x) = 0 root (6) cut-off method string f (x) = 0 root (7) realistic coefficient of the real roots of polynomial equations, complex root (8) Solution of linear equations: Gauss elimination method out the main elements (9) Fast Fourier transform forli (FFT)
Date : 2025-12-20 Size : 16kb User : wang yucao
[Algorithm] jgdhghjd DL : 0: DHRT:对分法搜索方程的实根 ATKN：埃特金迭代法求方程的一个实根 NEWT：牛顿迭代法求方程的一个实根 QRRT：QR方法求实系数多项式方程的全部根 NETN：拟牛顿法求非线性方程组的一组实数解-DHRT: method to search for the real roots of equation ATKN: Aitken iterative method for a real roots of equation NEWT: Newton iteration equation for the real roots of a QRRT: QR method realistic coefficient of polynomial equation root of all the NETN : quasi-Newton method for nonlinear equations of a set of real solutions
Date : 2025-12-20 Size : 4kb User : 万相友
[Algorithm] 1002NA DL : 0: A polynomial of degree n has the common form as . Your task is to write a function to find a root of a given polynomial in a given interval. Format of function double Polynomial_Root(int n, double c[], double a, double b, double EPS) where int n is the degree of the polynomial double c[] is an array of n +1 coefficients , , ..., , and of the given polynomial double a and b are the two end-points of the given interval and double EPS is the accuracy of the root. The function must return the root. Note: It is guaranteed that a unique real number r exists in the given interval such that p(r) = 0. -A polynomial of degree n has the common form as . Your task is to write a function to find a root of a given polynomial in a given interval. Format of function double Polynomial_Root(int n, double c[], double a, double b, double EPS) where int n is the degree of the polynomial double c[] is an array of n+1 coefficients , , ..., , and of the given polynomial double a and b are the two end-points of the given interval and double EPS is the accuracy of the root. The function must return the root. Note: It is guaranteed that a unique real number r exists in the given interval such that p(r) = 0.
Date : 2025-12-20 Size : 1kb User : suncheng
[Algorithm] calculator DL : 0: 设计简易交互式计算器，功能如下： (1) 计算器功能与Windows操作系统带的标准型的计算器系统相同。至少有+、-、*、/、开方、取倒数、清零、backspace的功能，可以对小数进行运算。 (2) 程序可以实现简单的没有括号的表达式计算， (3) 不使用math.h头文件，求开方运算时使用多项式拟合方式。 -Design simple interactive calculator, function as follows: (1) calculator function and Windows operating system with the standard system of the same type of calculator. At least+,-,*,/, prescription, take the countdown, clear, backspace function, can operate on decimal. (2) The program can not simply calculate the expression in brackets, (3) does not use the math.h header file, find the root operation means the use of polynomial fitting.
Date : 2025-12-20 Size : 2.59mb User : onway
[Algorithm] ji-suan-mo-ni DL : 0: 插值、多项式求值、求根、图形绘制、线性方程求解-Interpolation, polynomial evaluation, root finding, graphics rendering, linear equations
Date : 2025-12-20 Size : 93kb User : 李小
[Algorithm] Computer-Science DL : 0: 利用计算机方法解决数学问题，包括求方程的根，求插值多项式-The method of using a computer to solve math problems, including seeking the root of the equation, polynomial interpolation seeking
Date : 2025-12-20 Size : 438kb User :
[Algorithm] 4-2-Root-of-a-Polynomial.c DL : 0: 牛顿迭代二次 na 1003 Root of a Polynomial-newtown method
Date : 2025-12-20 Size : 1kb User : zhu
[Algorithm] jisuanjishuzhifangfa DL : 0: 计算机数值方法课中常见数值计算方法源代码，包括Gauss列主元素消去法、变步长梯形法、拉格朗日插值法、牛顿插值法、平方根法-Computer Numerical Methods Course common numerical method source code, including Gauss Out the main elements of elimination, variable step trapezoidal method, Lagrange polynomial, Newton interpolation, square root method, etc.
Date : 2025-12-20 Size : 9kb User : zty9