crc

共轭梯度法是介于最速下降法与牛顿法之间的一个方法，它仅需利用一阶导数信息，但克服了最速下降法收敛慢的缺点，又避免了牛顿法需要存储和计算Hesse矩阵并求逆的缺点，共轭梯度法不仅是解决大型线性方程组最有用的方法之一，也是解大型非线性最优化最有效的算法之一。(Conjugate gradient method is between the steepest descent method and Newton method between a method that only use the first derivative information, but the steepest descent method to overcome the disadvantage of slow convergence, but also avoids the need to store and calculate Newton Hesse matrix and the shortcomings of the inverse, conjugate gradient method is not only linear equations to solve large-scale one of the most useful, large-scale nonlinear optimization solution is also the most efficient algorithms.)

说明：  雷达系统设计有关。西安电子科技大学研究生课程《雷达系统分析》大作业。(Radar system design related. Xi'an University of Electronic Science and Technology graduate course "radar system analysis" major operations.)

说明：  首页-MATLAB-数据处理-一个文件数据处理小程序(Home-MATLAB-data-processing- a small data-processing procedures document)

伽辽金最小二乘无网格法、伽辽金配点无网格法等(伽辽金最小二乘无网格法、伽辽金配点无网格法等，其中许多内容都是作者课题组在国家自然科学基金资助下取得的成果。书中给出了作者用C++研制的面向对象的无网格法程序OMLL，另外各章都给出了相应的MATLAB 程序，以帮助读者理解各种无网格方法的程序实现过程。)

FEM 作业用的一个小程序，用于计算梁的简单变形。(Finite Element Homework)

這是一個可以自動尋找图像中的長方形, 正方形, 圓形, 菱形的程式(1- Read the RGB (colored) image in from user. 2- Convert image from (RGB) colored to gray image. 3- Threshold the image (convert gray image to binary image). 4- Invert the binary image (in order to speed up the time of processing). 5- Find the boundaries concentrate. 6- Determine shapes properties (ratio of dimensions, roundness). 7- Classify shapes according to its properties. )

随机信号的功率谱估计,包括间接法，直接法，weltch法等(Random signal power spectrum estimation)

detection and localisation of objects

绝版MATLAB书籍，关于数字信号处理实现的，书籍是PDF版的，扫描的（已经绝版，只有扫描版的，不是很清晰，但程序可以看见，不喜勿喷），本人看了受益匪浅，很经典，推荐下载(MATLAB print books on digital signal processing to achieve, is the PDF version of the book, scanned (out of print, scan version only, and is not very clear, but the program can be seen, do not like do not spray), I saw the benefit, classic, recommended download)

Program EDFT produce high-resolution N-point DFT for N greater than the length of data vector.