qiuxinhaopiyudebijiao

牛顿迭代法，用于求解非线性方程，具体使用方法见程序内部说明。(Newton iteration for solving nonlinear equations, the specific use of the procedure see the internal note.)

电容层析成像的ART算法演示实例,并带有详细的说明(An Example of ART Algorithm for Electrical Capacitance Tomography)

导线网平差程序，参数约束，通过设定不同的PX达到经典自由网，普通自由网，拟稳平差效果，算例(Wire net adjustment procedures, parameters, constraints, and examples)

罚函数法 它将有约束最优化问题转化为求解无约束最优化问题: 其中M为足够大的正数, 起"惩罚"作用, 称之为罚因子, F(x, M )称为罚函数.(hunhefahanshufa)

用matlab编写的cholesky分解程序，希望对大家有些帮助(Matlab prepared using Cholesky decomposition procedures, in the hope that some U.S. help)

求解四元三次方程组，通过在VC++的编程环境，实现计算的高速运行(Solving four yuan cubic equations by VC++ programming environment, to achieve high-speed operation calculated)

算法优化非常好，几乎没有循环，Relief计算分类权重，包括四元数的各种计算。( Algorithm optimization is very good, almost no circulation, Relief computing classification weight, Including quaternion various calculations.)

说明：  曲线的三次样条插值，在非首尾节点处具有三次光滑性质(Curve cubic spline interpolation, in both nodes with non-smooth nature of the three)

基于matlab的人工免疫遗传算法的编程（附注释）希望可以帮到大家 (Based on artificial immune genetic algorithm matlab programming (with comments) the desire to help people)

1. 牛顿迭代法 function [x,i]=newtonmethod(x0,f,ep,Nmax) 牛顿法求非线性方程根 x0是输入初始值, f是输入函数, 精度要求ep, Nmax为最大迭代次数 x是输出迭代序列,i是迭代次数 2. 二分法 function [x,k]=bisection(a,b,f,ep) 二分法解非线性方程 输入区间[a,b],函数f和误差ep, Nmax为最大二分次数 x为输出近似根, k为二分次数 ( Newton s law and the dichotomy)