Welcome![Sign In][Sign Up]
Location:
Search - diedai

Search list

[Mathimatics-Numerical algorithmsdiedai

Description: 迭代发解方程算法-iterative algorithm for solving equations made
Platform: | Size: 1197 | Author: 风信 | Hits:

[Mathimatics-Numerical algorithmsdiedai

Description: 用c++编写的简单迭代发和牛顿迭代发以及埃特金加整收敛法的有效程序
Platform: | Size: 1759 | Author: 叫怎高 | Hits:

[Other resourcediedai

Description: 迭代法是基于逼近的思想,其步骤如下: 1. 求出图象的最大灰度值和最小灰度值,
Platform: | Size: 932 | Author: wangyi | Hits:

[Mathimatics-Numerical algorithmsdiedai

Description: 通过迭代的原理,进行数值计算,求得所需解的曲线,精度很高
Platform: | Size: 1655 | Author: stephen | Hits:

[Mathimatics-Numerical algorithmsdiedai

Description: 不动点迭代——方程根的求解-fixed-point iteration -- Solving the equation -
Platform: | Size: 6128 | Author: 王慧 | Hits:

[Mathimatics-Numerical algorithmsdiedai

Description: 高斯-塞德尔迭代法算法: 设方程组AX=b 的系数矩阵的对角线元素 ,M为迭代次数容许的最大值, 为容许误差。 ① 取初始向量 ,令k=0 ② 对 计算 ③ 如果 ,则输出 ,结束;否则执行④, ④ 如果 ,则不收敛,终止程序;否则 ,转②。
Platform: | Size: 791 | Author: kozzy | Hits:

[Mathimatics-Numerical algorithmsdiedai

Description: 迭代发解方程算法-iterative algorithm for solving equations made
Platform: | Size: 1024 | Author: 风信 | Hits:

[Mathimatics-Numerical algorithmsdiedai

Description: 不动点迭代——方程根的求解-fixed-point iteration-- Solving the equation-
Platform: | Size: 308224 | Author: 王慧 | Hits:

[Mathimatics-Numerical algorithmsdiedai

Description: 用c++编写的简单迭代发和牛顿迭代发以及埃特金加整收敛法的有效程序-With c++ Prepared a simple iterative Newton-fat and fat as well as Aitken plus the entire convergence law effective procedures
Platform: | Size: 1024 | Author: 叫怎高 | Hits:

[matlabdiedai

Description: 迭代法是基于逼近的思想,其步骤如下: 1. 求出图象的最大灰度值和最小灰度值,-Iterative method is based on the idea of approximation, the steps are as follows: 1. To derive the maximum gray value image and the minimum gray value,
Platform: | Size: 1024 | Author: wangyi | Hits:

[Mathimatics-Numerical algorithmsdiedai

Description: 通过迭代的原理,进行数值计算,求得所需解的曲线,精度很高-Through iteration of the principle of numerical calculation to obtain the required solution of the curve, the high accuracy
Platform: | Size: 1024 | Author: stephen | Hits:

[Mathimatics-Numerical algorithmsdiedai

Description: 高斯-塞德尔迭代法算法: 设方程组AX=b 的系数矩阵的对角线元素 ,M为迭代次数容许的最大值, 为容许误差。 ① 取初始向量 ,令k=0 ② 对 计算 ③ 如果 ,则输出 ,结束;否则执行④, ④ 如果 ,则不收敛,终止程序;否则 ,转②。
Platform: | Size: 1024 | Author: kozzy | Hits:

[Special Effectsdiedai

Description: 图像分割、迭代法、直方图的统计计算、二值化图像-Image segmentation, iterative method, histogram of statistical computing, binary image
Platform: | Size: 1024 | Author: chen | Hits:

[Windows Developdiedai

Description: C++ 实现高斯——赛德尔迭代算法解矩阵 输入矩阵 求解矩阵-C++ Achieve Gauss- Seidel iterative algorithm for solving matrix solution matrix input matrix
Platform: | Size: 1024 | Author: 花千树 | Hits:

[Mathimatics-Numerical algorithmsdiedai

Description: 计算方法的迭代法的实现,有需要的人可以下载-Iteration method of calculation of the realization of those in need can be downloaded
Platform: | Size: 1024 | Author: whom | Hits:

[Algorithmdiedai

Description: 用雅可比迭代法,塞德尔迭代法,逐次超松弛法求解线性方程组,程序用C语言编写-Jacobi iterative method used, Seidel iteration, successive over-relaxation method to solve linear equations, the program written by C
Platform: | Size: 6144 | Author: 欧阳 | Hits:

[Special Effectsdiedai

Description: 图形图像处理,基于灰度直方图单阈值分割算法的研究-Graphic image processing, histogram-based threshold segmentation algorithm based on a single research
Platform: | Size: 1024 | Author: 章子怡 | Hits:

[CSharpdiedai

Description: 这是一个牛顿迭代函数 最后会输出牛顿迭代的结果 -this is a function of newton diedai the result is a number
Platform: | Size: 1024 | Author: River | Hits:

[Special Effectsdiedai

Description: 本程序给出了迭代法求取最佳阈值,对具有双峰直方图的图像效果良好-This procedure gives the iteration method yields the best threshold, with a bimodal histogram of the image well
Platform: | Size: 363520 | Author: 高圆圆 | Hits:

[Mathimatics-Numerical algorithmsdiedai

Description: 该算法有效解决了线形方程组的在计算机中的数值解法。对一般迭待进行了改进。误差小。收敛速度快-The algorithm solves linear equations in the computer numerical solution. Diego general improvements to be carried out. Little error. Faster convergence
Platform: | Size: 27648 | Author: yy | Hits:
« 12 3 4 5 »

CodeBus www.codebus.net