chaoliu

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. )

Variational inference for Bayesian variable selection

Average interpolation using cubic B-spline wavelet.

有关SIMULINK的教程，在学校时学习MATLAB是同学给的。(Tutorial of SIMULINK)

用概率算法计算pi的值，linnux环境下使用gcc编译后运行(With the probability of the value of pi algorithm, linnux environment using the gcc compiler to run after)

多用户检测 解相关 mmse 并比较各种检测的效果(Decorrelation mmse multiuser detection test results and compare)

Kode Program Algoritma Nearest Neighbor

This is a article about approximate entropy. It will be helpful for motor behavior and rehabilitation study.

多主成分分析和LDA模型结合算法，用于文本识别。(MPCA: Multilinear Principal Component Analysis of Tensor Objects)

求解jssp问题的一类遗传算法源码，具有很好的收敛性，解决MT10问题(for the JSSP problem)