Search - iteration

Search - iteration - List

[File Format] Jacobi-matlab DL : 1: 雅可比(Jocabi)迭代法解线性方程组-Jacobi (Jocabi) iterative method for solving linear equations
Date : 2025-12-31 Size : 5kb User : js
[File Format] AMODIFIEDRAO-BLACKWELLISEDPARTICLEFILTER DL : 0: Rao-Blackwellised Particle Filters (RBPFs) are a class of Particle Filters (PFs) that exploit conditional dependencies between parts of the state to estimate. By doing so, RBPFs can improve the estimation quality while also reducing the overall computational load in comparison to original PFs. However, the computational complexity is still too high for many real-time applications. In this paper, we propose a modified RBPF that requires a single Kalman Filter (KF) iteration per input sample. Comparative experiments show that while good convergence can still be obtained, computational efficiency is always drastically increased, making this algorithm an option to consider for real-time implementations.
Date : 2025-12-31 Size : 119kb User : 阳关
[File Format] pdoteaching.pdf DL : 0: 随机微粒群算法程序pdf 围绕粒子群的当前质心对粒子群重新初始化.这样，每个粒子在随后的迭代中将在新的位置带着粒子在上次搜索中获得的“运动惯性”从而可以在粒子群的运动过程中获得新的位置，增加求得更优解的机会.随着迭代的继续，经过变异的粒子群又将趋向于同一点，当粒子群收敛到一定程度时又进行下一次变异，如此反复，直到迭代结束-Random process pdf particle swarm optimization particle swarm around the current center of mass of the particle swarm reinitialization. In this way, each particle in the next iteration will be in the new location with a particle in the last search was the
Date : 2025-12-31 Size : 3.26mb User : 宏成功
[File Format] 32365 DL : 0: 数值分析matlab部分例题代码：Jacobi迭代法，二分法，幂法，龙贝格算法，插值法-Numerical analysis matlab part of the example code: Jacobi iteration method, bisection method, power method, Romberg algorithm, interpolation
Date : 2025-12-31 Size : 313kb User : 学制
[File Format] FCM-C DL : 0: 模糊C-聚类分析：从随机初始化划分矩阵开始迭代-Fuzzy C-cluster analysis: start from the the random initialization divided matrix iteration
Date : 2025-12-31 Size : 1kb User : leo
[File Format] fractal-use DL : 0: 分形的练习一 ①Koch曲线用复数的方法来迭代Koch曲线 clear i 防止i被重新赋值 A=[0 1] 初始A是连接（0，0）与（1，0）的线段 t=exp(i*pi/3) n=2 n是迭代次数 for j=0:n A=A/3 a=ones(1,2*4^j) A=[A (t*A+a/3) (A/t+(1/2+sqrt(3)/6*i)*a) A+2/3*a] end plot(real(A),imag(A)) axis([0 1 -0.1 0.8]) ②Sierpinski三角形 A=[0 1 0.5 0 0 1] 初始化A n=3 迭代次数 for i=1:n A=A/2 b=zeros(1,3^i) c=ones(1,3^i)/2 A=[A A+[c b] A+[c/2 c]] end for i=1:3^n patch(A(1,3*i-2:3*i),A(2,3*i-2:3*i), b ) patch填充函数 end -Fractal Exercise One The ① Koch curve Plural iteration Koch curve clear i to prevent i is reassigned A = [0 1] initial A is a connection (0,0) and (1,0) of the segments t = exp (i* pi/3) n = 2 n is the number of iterations for j = 0: n A = A/3 a = ones (1,2* 4 ^ j) A = [A (t* A+ a/3) (A/t+ (1/2+ sqrt (3)/6* i)* a) A+2/3* a] end plot (real (A), imag (A)) axis ([0 1-0.1 0.8]) ② Sierpinski triangle A = [0 1 0.5 0 0 1] initialized A n = 3 the number of iterations. for i = 1: n A = A/2 b = zeros (1,3 ^ i) c = ones (1,3 ^ i)/2 A = [A A+ [c b] A+ [c/2 c]] end for i = 1:3 ^ n patch (A (1,3* i-2: 3* i), A (2,3* i-2: 3* i), b ) patch filled function end
Date : 2025-12-31 Size : 43kb User : 郑志森
[File Format] 1 DL : 0: 牛顿迭代法的c语言代码，可以逼近求一些复杂方程的解，比如超越方程的近似解-Newton iteration of the c language code, you can find some of the complex approximation equations, such as the approximate solution of the transcendental equation
Date : 2025-12-31 Size : 12kb User : rose
[File Format] lab06 DL : 0: 编写Gauss-Seidel迭代和SOR迭代的通用程序-Write Gauss-Seidel iteration and SOR iteration general program
Date : 2025-12-31 Size : 1kb User : 梁珊义
[File Format] LOAD_FLOW_STUDIES_02 DL : 0: The GS method is an iterative algorithm for solving non linear algebraic equations. An initial solution vector is assumed, At every subsequent iteration, the solution is updated till convergence is reached. The GS method applied to po
Date : 2025-12-31 Size : 2.83mb User : firaol
[File Format] VaR DL : 0: 用蒙特卡洛模拟来迭代1000次以后，计算10天后的VaR,特色就是对里面的方差和均值进行差分。里面有详细步骤和方法。-Using monte carlo simulation to iteration after 1000 times, calculate the VaR after 10 days,the characteristic of model is that calculating the the variance and mean 不by difference.There are detailed steps and methods
Date : 2025-12-31 Size : 161kb User : 陈凯
[File Format] Damped-Newton-iteration-method DL : 0: 利用阻尼的牛顿法搜寻最小值（可以根据需要对目标函数进行调整）-Using damped Newton method to solve the double parameter optimal value
Date : 2025-12-31 Size : 2kb User : lincj
[File Format] gaosisaideerdiedai DL : 0: 用高斯赛德尔迭代对函数进行求值并使之精度达到一定的要求-With Gauss Seidel iteration of the function is uated and the accuracy can reach a certain requirement
Date : 2025-12-31 Size : 1kb User : 任亚婧
[File Format] An-efficient-augmented- DL : 0: 基于经典的增广拉格朗日乘子法, 对求解一类带有特定结构（主要是针对凸规划）的非光滑等式约束优化问题, 我们提出、分析并测试了一个新算法. 在极小化增广拉格朗日函数的每一步迭代中, 该算法有效结合了带有非单调线性搜索的交替方向技术, 我们建立了算法的收敛性, 并用它来求解在带有全变差正则化的图像恢复问题.-Based on the classic augmented Lagrangian multiplier method, we propose, analyze and test an algorithm for solving a class of equality-constrained nonsmooth optimization problems (chiefly but not necessarily convex programs) with a particular structure. The algorithm effectively combines an alternating direction technique with a nonmonotone line search to minimize the augmented Lagrangian function at each iteration. We establish convergence for this algorithm, and apply it to solving problems in image reconstruction with total variation regularization.
Date : 2025-12-31 Size : 674kb User : hakunalife