搜索结果

找到约 21 项符合 iteration 的查询结果

数学计算 Using Jacobi method and Gauss-Seidel iterative methods to solve the following system The require

Using Jacobi method and Gauss-Seidel iterative methods to solve the following system The required precision is &#61541 &#61472 =0.00001, and the maximum iteration number N=25. Compare the number of iterations and the convergence of these two methods
https://www.eeworm.com/dl/641/256146.html
下载: 169
查看: 1103

技术资料 LuaXML 源码

LuaXML provides a minimal set of functions for the processing of XML data in Lua. It offers a very simple and natural mapping between the XML data format and Lua tables, which allows one to parse XML data just using Lua's normal table access and iteration methods.
https://www.eeworm.com/dl/998387.html
下载: 2
查看: 94

数学计算 数值线性代数的Matlab应用程序包 共13个程序函数

数值线性代数的Matlab应用程序包 共13个程序函数,每个程序函数有相应的例子函数一一对应,以*Example.m命名 程序名称 用途 Method 方法 GrmSch.m QR因子分解 classical Gram-Schmidt orthogonalization 格拉母-斯密特 MGrmSch.m QR因子分解 modified Gram-Schmidt iteration 修正格拉母-斯密特 househol ...
https://www.eeworm.com/dl/641/297087.html
下载: 165
查看: 1399

文章/文档 A fractal is generally "a rough or fragmented geometric shape that can be split into parts, each of

A fractal is generally "a rough or fragmented geometric shape that can be split into parts, each of which is (at least approximately) a reduced-size copy of the whole,"[1] a property called self-similarity. The term was coined by Beno&#238 t Mandelbrot in 1975 and was derived from the Latin fractus ...
https://www.eeworm.com/dl/652/469453.html
下载: 36
查看: 1071

数值算法/人工智能 program to solve a finite difference discretization of Helmholtz equation : (

program to solve a finite difference discretization of Helmholtz equation : (d2/dx2)u + (d2/dy2)u - alpha u = f using Jacobi iterative method. COMMENTS: OpenMP version 3: 1 PR outside the iteration loop, 4 Barriers Directives are used in this c ...
https://www.eeworm.com/dl/518/453199.html
下载: 94
查看: 1074

生物技术 This a Bayesian ICA algorithm for the linear instantaneous mixing model with additive Gaussian noise

This a Bayesian ICA algorithm for the linear instantaneous mixing model with additive Gaussian noise [1]. The inference problem is solved by ML-II, i.e. the sources are found by integration over the source posterior and the noise covariance and mixing matrix are found by maximization of the marginal ...
https://www.eeworm.com/dl/670/134878.html
下载: 101
查看: 1155

文件格式 Rao-Blackwellised Particle Filters (RBPFs) are a class of Particle Filters (PFs) that exploit condi

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. Howev ...
https://www.eeworm.com/dl/639/241532.html
下载: 52
查看: 1096

人工智能/神经网络 % Train a two layer neural network with the Levenberg-Marquardt % method. % % If desired, it is p

% 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, % ...
https://www.eeworm.com/dl/650/384092.html
下载: 168
查看: 1068

matlab例程 % EM algorithm for k multidimensional Gaussian mixture estimation % % Inputs: % X(n,d) - input da

% EM algorithm for k multidimensional Gaussian mixture estimation % % Inputs: % X(n,d) - input data, n=number of observations, d=dimension of variable % k - maximum number of Gaussian components allowed % ltol - percentage of the log likelihood difference between 2 iterations ([] for none) % ...
https://www.eeworm.com/dl/665/303904.html
下载: 148
查看: 1193

人工智能/神经网络 function [U,center,result,w,obj_fcn]= fenlei(data) [data_n,in_n] = size(data) m= 2 % Exponent fo

function [U,center,result,w,obj_fcn]= fenlei(data) [data_n,in_n] = size(data) m= 2 % Exponent for U max_iter = 100 % Max. iteration min_impro =1e-5 % Min. improvement c=3 [center, U, obj_fcn] = fcm(data, c) for i=1:max_iter if F(U)>0.98 break else w_new=eye(in_n,in_n) center1=sum(cent ...
https://www.eeworm.com/dl/650/377003.html
下载: 132
查看: 1073