搜索资源列表
jiefangcheng
- 解N元一次方程组，雅克比迭代法，将方程系数x值和迭代因子代入迭代公式计算-Solution of N-linear equation group, Jacobi iterative method, the equation coefficients of x values and the iterative factor incorporated into the iteration formula
SCM-subroutine-library
- 目前已有若干版本的子程序库公开发表，它们各有特色。本程序库中的开平方算法为快速逼近算法，它能达到牛顿迭代法同样的精度，而速度加快二十倍左右，超过双字节定点除法的速度-At present, a number of published versions of the subroutine library, they have their own characteristics. The library of the square root algorithm for fast approximat
MPI-Jacobi
- 并行计算课程实验，利用MPI实现jacobi迭代-Parallel computing course experiment, the use of MPI to achieve jacobi iteration
Coordinate-rotation-method
- 用坐标轮换法求解目标函数，迭代时采用最优步长。-With coordinate rotation method to solve the objective function, the optimal iteration step.
concurrent-computation
- 多线程计算pi，多线程计算3PCF，MPI实现jacobi迭代，3PCF优化！天津大学计算机学院并行计算课程作业。-Multi-threaded computing pi, multi-threaded computing 3PCF, MPI implementation jacobi iteration, 3PCF optimization! Tianjin University, Computer Science course work in parallel computing.
jacobi
- A: aij, 1<= i,j<=n b: 1<=i<=n x0: intial guess, 1<=i<=n tol: tolerance N maximum number of iterations k: number count of iteration Xm(:,k): X in each k iteration-Jacobi s method: In numerical linear algebra, the
grover_min
- 用GROVER搜无序数据库中的任一个数，把该数找出来，即找出该数在数据库中的下标。由于量子并行性计算的特点，精度高，迭代步数少-GROVER search disorderly database in any of a number, the number to find out, that is, to find out the subscr ipt of the number in the database. Due to the characteristics of quantum par
GS
- Gauss-Seidel方法，是Jacobi方法的一种改进，可以认为是一种不动点迭代-Gauss-Seidel method is an improvement of the Jacobi method, that is a fixed point iteration
Jacobi-over-relaxation
- Jacobi超松弛迭代是不动点迭代的一种，但收敛速度一般来讲并不理想。-Jacobi over relaxation is a fixed point iteration, the convergence rate is not ideal.
collapse
- 采用Master/Worker并行计算一个整数集的Collapse（计算所有数字的和，迭代直到结果只剩一位数）-Master/Worker parallel computation of a set of integers Collapse (calculated all the numbers and iteration until the results of only one number)
Jaccobi-chuanxing
- 这是雅克比迭代的串行算法。主要目的是计算串行所用的时间。-Jacobi iteration serial algorithm. The main purpose is to calculate the time used for the serial.
12
- 包括高斯－塞德尔迭代法和雅可比迭代法，数值计算实验课-Gauss- Seidel iterative method and Jacobi iteration method, numerical experiment course
WindyGridWorldQLearning
- Q-learning (Watkins, 1989) is a simple way for agents to learn how to act optimally in controlled Markovian domains. It amounts to an incremental method for dynamic programming which imposes limited computational demands. It works by successively
Newton-Laphson-iteration-cPP
- 用牛拉法解潮流程序，用c++编写，内含数据-Ox-drawn method for solving flow program, write c++, containing data
Lanczos
- Lanczos迭代算法，计算大型稀疏对称矩阵特征值-Lanczos iteration
diedai1
- 这是一种牛顿迭代法 主要应用于 非线性方程中-This is a Newton iteration method is mainly applied to nonlinear equations
19zhongji
- 这是一种牛顿迭代法 主要应用于 非线性方程中-This is a Newton iteration method is mainly applied to nonlinear equations
Iteration
- 金相图片颗粒边界的提取及合并图片内容和边界信息-Metallography grain boundary extraction and merging picture content and boundary information
code---c
- Economic Load Dispatch using lamda iteration c - code
yakebi-diedai
- 这是一个非常好用而且非常实用的雅克比迭代法用c++实现的算法-This is a very easy to use and very practical Jacobi iteration algorithm implemented with c++