Gauss-Newton algorithm
2015-06-12 16:04
302 查看
function [x,minf] = minGN(f,x0,var,eps) format long; if nargin == 3 eps = 1.0e-6; end S = transpose(f)*f; k = length(f); n = length(x0); x0 = transpose(x0); tol = 1; A = jacobian(f,var); while tol>eps Fx = zeros(k,1); for i=1:k Fx(i,1) = Funval(f(i),var,x0); end Sx = Funval(S,var,x0); Ax = Funval(A,var,x0); gSx = transpose(Ax)*Fx; dx = -transpose(Ax)*Ax\gSx; x0 = x0 + dx; tol = norm(dx); end x = x0; minf = Funval(S,var,x); format short;
相关文章推荐
- Lucas-Kanade algorithm
- 【Perceptron Learning Algorithm】林轩田机器学习基石
- 安全攻击:webgoat课程笔记
- Django 开启 服务提示错误error 10013
- golang发送xlsx文件到浏览器端
- django自定义过滤器函数
- Analysis of Algorithms-InsertSort
- django migration使用指南
- 【BZOJ】【1419】Red is good
- 写到世界充满爱:专访 RSSHub 作者 DIYgod
- 【连载】GO语言系列1.Rockchip RK3288, GO!GO!!GO!!!
- VIEWGOOD(远古)视频医疗示教解决方案
- HDOJ 3966 Aragorn's Story
- Algorithm --> 最长公共子序列(LCS)
- Google LOGO现代舞舞蹈动画
- Ubuntu 12.04安装Google Chrome(转)
- Django 处理模糊搜索结果
- 如何让创业公司走上敏捷开发之路
- django类视图浅析
- Google Volley框架源码走读