UMAT-Example

用欧几里得算法求两个自然数的最大公约数通过c语言实现(Using Euclidean Algorithms to Find the Maximum Common Number of Two Natural NumbersRealization by C Language)

说明：  矩阵计算英文版第4版，经典，经典，很不错！！！！！请下载！！！！！！(Matrix Computing English Version 4, classic, classic, very good!!!! Please download!!!!!!)

里面包含了随机矩阵理论里经典的仿真，如marcenko-pastur law,tracy-widom law等(It contains some classical simulationa in the random matrix theory，such as marcenko-pastur law,tracy-widom law)

首先根据高斯白噪声频率充满整个频带的特性，通过双树复小波包变换对高斯白噪声进行分解，利用频带能量泄漏的定量分析方法，验证了双树复小波包变换具有较低的频带能量泄漏特性；其次利用双树复小波包变换逐层分解信号，对每层分解所得分量求其FFT谱的峭度，得到基于双树复小波包变换的谱峭度图，根据图中峭度最大的原则，可以自动准确的选择信号分解最佳层数和最佳分量；最后将基于双树复小波包变换的谱峭度图的故障诊断方法应用于实际工程中，对齿轮故障振动信号进行分析，选择最佳分解层数和分量后利用希尔伯特包络解调，有效准确地提取了故障特征信息，验证了方法的可行性和有效性(The parameters of a filter were determined by experience, and that has a great influence on the results of signal processing. The discrete wavelet packet transform has a larger energy leakage of frequency band, which obviously affected the results of the envelope demodulation. It is necessary to have a method with a lower energy leakage of the frequency band before envelope demodulation. The dual tree complex wavelet packet transform (DT-CWPT) was a new signal processing method that had many good qualities. Because the energy leakage of the frequency band was smaller when the signal was decomposed by a dual tree complex wavelet packet transform, the dual tree complex wavelet packet transform was used to extract the fault feature information in the field of fault diagnosis. In this paper, first, according to the characteristics of Gaussian white noise, whose frequency was full of the whole frequency band, Gaussian white noise was decomposed by a dual-tree complex wavel)

世界上最好的微积分教材，搞程序的，研究的，数学的都应该了解，这个是James.Stewart的Calculus第七版，英文原版，彩色的，值得珍藏。(The world' s best calculus textbook, engage in programs, research, mathematics should understand that this is James.Stewart seventh edition of Calculus, English original, colorful and worth treasuring.)

关于走迷宫算法的实现程序，完全采用C++语言实现，可以运行(Maze algorithm program, fully C++ language, you can run)

数学最优问题中，拉格朗日乘数法（以数学家约瑟夫·路易斯·拉格朗日命名）是一种寻找变量受一个或多个条件所限制的多元函数的极值的方法。(In the mathematical optimization problem, the Lagrange multiplier method (named by the mathematician Joseph Luis Lagrange) is a method of finding the extremum of a multivariate function which is restricted by one or more conditions.)

Algo2-2.c C program for implementing Algorithm 2.2 Algorithm translated to C by: Dr. Norman Fahrer IBM and Macintosh verification by: Daniel Mathews NUMERICAL METHODS: C Programs, (c) John H. Mathews 1995 To accompany the text: NUMERICAL METHODS for Mathematics, Science and Engineering, 2nd Ed, 1992 Prentice Hall, Englewood Cliffs, New Jersey, 07632, U.S.A. Prentice Hall, Inc. USA, Canada, Mexico ISBN 0-13-624990-6 Prentice Hall, International Editions: ISBN 0-13-625047-5 This free software is compliments of the author. E-mail address: in "mathews@fullerton.edu" Algorithm 2.2 (Bisection Method). Section 2.2, Bracketing Methods for Locating a Root, Page 61

考虑果蝇算法的缺陷，提出了基于混沌算法的果蝇算法，这是代码。(Code of Fruit fly algorithm based on Chaos Algorithm)

一维等离子体的plrc—fdtd算法程序(one-dimensional plasma plrc- fdtd Algorithm)