Search - iteration

Search - iteration - List

[Algorithm] 2D Jacobi Iteration - OpenMP DL : 0: An Implementation of 2D Jacobi Iteration using OpenMP in UNIX environment.

Update : 2009-02-18 Size : 43.54kb Publisher : franksun1984
[AI-NN-PR] srcV0624 DL : 1: 这个代码是policy iteration算法关于强化学习的. 请您用winzip 解压缩-policy iteration algorithm for enhanced learning. Please use winzip decompress
Update : 2025-02-17 Size : 18kb Publisher : 柳春
[matlab] SORxx DL : 0: 雅可比、塞德尔和SOR迭代法的原理。代法的原雅可比、塞德尔和SOR迭代法的原理。理。-Jacobian, Seidel and SOR Diez Jacobian, Seidel SOR iteration method and the principle. On behalf of the original law Jacobian, Seidel SOR iteration method and the principle. Jimmy.
Update : 2025-02-17 Size : 2kb Publisher : 张名
[matlab] Gauss_Seidel_iterative DL : 0: 迭代法是解线性代数方程组的另一类方法，特别适用于解大型稀疏线性方程组。它的基本思想是针对求解问题预先设计好某种迭代格式，从而产生求解问题的近似解迭代序列，在迭代序列收敛于精确解的情况下，按精度要求取某个迭代值作为问题解的近似值。迭代法具有原始系数举证始终不变，算法简单，编写程序较方便，所需存储单元较少的优点。-iterative method was the linear algebraic equations of the other methods, particularly applicable to the large sparse linear equations. The basic idea is to solve the problem in advance against the design iteration some good format, thereby creating problems for the approximate solution of iterative sequence, the iterative sequence converges to the exact solution, precision demanded by a certain value as a question iterative solution approximation. Iteration with the original proof coefficient remains unchanged, the algorithm is simple, the preparation process more convenient, less required storage unit advantages.
Update : 2025-02-17 Size : 1kb Publisher : 江理彬
[Algorithm] jacobi DL : 0: 这是一段使用并行方式运算的jacobi迭代，目的是为了说明MPI使用过程中的对称消息发送的方式，矩阵经迭代多次后，其结果是一个16*16的方阵，元素都为8-This is a way to use parallel computing jacobi iteration, in order to explain the purpose of use in the process of MPI message symmetrical manner, after repeated matrix by iteration, the result is a 16* 16 square matrix, elements are 8
Update : 2025-02-17 Size : 1kb Publisher : 邓超
[Algorithm] Gauss-Seidel DL : 0: Using Jacobi method and Gauss-Seidel iterative methods to solve the following system The required precision is   =0.00001, and the maximum iteration number N=25. Compare the number of iterations and the convergence of these two methods
Update : 2025-02-17 Size : 77kb Publisher : 吕鹏
[3G develop] MDPtoolbox DL : 1: The MDP toolbox proposes functions related to the resolution of discrete-time Markov Decision Process : finite horizon, value iteration, policy iteration, linear programming algorithms with some variants. The functions (m-functions) were developped with MATLAB v6.0 (one of the functions requires the Mathworks Optimization Toolbox) by the decision team of the Biometry and Artificial Intelligence Unit of INRA Toulouse (France). The version 2.0 (February 2005) handles sparse matrices and contains an example
Update : 2025-02-17 Size : 2.32mb Publisher : 劉德華
[matlab] budongdian DL : 0: 此程序为解非线性方程组的不动点迭代法，在MATLAB执行.-This procedure for the solution of nonlinear equations of the fixed point iteration method, in the MATLAB implementation.
Update : 2025-02-17 Size : 1kb Publisher : yang
[Mathimatics-Numerical algorithms] newtonsuanfa DL : 0: 牛顿迭代的matlab源代码，用于方程方程组的求解 -Newton iteration matlab source code for the equation of equations
Update : 2025-02-17 Size : 1kb Publisher : 曹睿
[MPI] MATLAB DL : 0: 牛顿迭代方法计算算法示例，可以通过这个来写出其他的计算方法-Newton iteration method algorithm for example, you can write this to the calculation of other
Update : 2025-02-17 Size : 1kb Publisher : 李黎
[AI-NN-PR] marq DL : 0: ％ Train a two layer neural network with the Levenberg-Marquardt ％ method. ％％ If desired, it is possible to use regularization by ％ weight decay. Also pruned (ie. not fully connected) networks can ％ be trained. ％％ Given a set of corresponding input-output pairs and an initial ％ network, ％ [W1,W2,critvec,iteration,lambda]=marq(NetDef,W1,W2,PHI,Y,trparms) ％ trains the network with the Levenberg-Marquardt method. ％％ The activation functions can be either linear or tanh. The ％ network architecture is defined by the matrix NetDef which ％ has two rows. The first row specifies the hidden layer and the ％ second row specifies the output layer.- Train a two layer neural network with the Levenberg-Marquardt method. If desired, it is possible to use regularization by weight decay. Also pruned (ie. not fully connected) networks can be trained. Given a set of corresponding input-output pairs and an initial network, [W1, W2, critvec, iteration, lambda] = marq (NetDef, W1, W2, PHI, Y, trparms) trains the network with the Levenberg-Marquardt method . The activation functions can be either linear or tanh. The network architecture is defined by the matrix NetDef which has two rows. The first row specifies the hidden layer and the second row specifies the output layer.
Update : 2025-02-17 Size : 3kb Publisher : 张镇
[Algorithm] niudundiedai DL : 0: vc6.0,牛顿迭代法的源代码，数值分析-vc6.0, Newton iteration of the source code, numerical analysis
Update : 2025-02-17 Size : 181kb Publisher : minminjiang
[matlab] fixed_point DL : 0: Fixed-Point iteration-Function fixed_point(p0, N) approximates the solution of an equation f(x) = 0, rewritten in the form x = g(x), which is a sub-function the user has to enter. the call to the function fixed_point(p0, N) returns the root of the equation f(x),i.e. the fixed-point of g(x), if the procedure is successful or a sequence of iterates in case something goes wrong. p0 is the initial approximation and N the maximum number of iterations. If, after N iterations, condition |x(k)- x(k-1)| < tol is not satisfied, all iterated values will be displayed, accompanied by a message asking the user to either change p0 in case of divergence or enter another g(x) that does not lead to complex numbers arithmetics. Reasons for the program to go wrong are the divergence of iterates and/or appearance of complex numbers for example with functions involving sqrt(x) when one of the iterates is negative.
Update : 2025-02-17 Size : 1kb Publisher : 王怀东
[JSP/Java] linear_solution DL : 0: 原创的线性方程组求解程序，包括Jacobi迭代，高斯消去法，Gauss-Seidel迭代三种求解算法。-Original procedure for solving linear equations, including the Jacobi iteration, Gauss elimination method, Gauss-Seidel iterative algorithm three.
Update : 2025-02-17 Size : 6kb Publisher : 熊君君
[Algorithm] Third DL : 0: Solving linear equations using iteration. Seidels and Biggest incline methods
Update : 2025-02-17 Size : 3kb Publisher : Vaidas Zid
[matlab] general DL : 0: Code For Lambda-iteration method of solving Economic dispatch problem
Update : 2025-02-17 Size : 1kb Publisher : saumyagautam2007
[matlab] code DL : 0: （1）用Doolittle三角分解（LU）法解方程组。（2）分别用Jacobi迭代, Gauss-Seidel迭代法解方程组。 -(1) Triangle Doolittle decomposition (LU) Solving equations. (2), respectively, with Jacobi iteration, Gauss-Seidel iteration method for solution of equations.
Update : 2025-02-17 Size : 2kb Publisher : 娜娜
[Other] seg DL : 0: 图像处理中各种阈值分割的基本算法的实现，包括双峰法迭代法大金法（ostu）-A variety of image processing in the basic threshold segmentation algorithm, including the bimodal method， iteration method， Daikin (ostu), etc.
Update : 2025-02-17 Size : 3kb Publisher : 大禹
[Algorithm] iteration DL : 0: 雅可比迭代法,塞德尔迭代法,逐次超松弛法求解线性方程组-iteration code
Update : 2025-02-17 Size : 2kb Publisher : Snake
[Other] lambda iteration DL : 0: lambda iteration used for economic load dispatch
Update : 2025-02-17 Size : 24kb Publisher : pertiwi

« 12 3 4 5 6 7 8 9 10 ... 50 »