CurveFitCOMDemo

此为众多Python小案例，可以做学习用。(This is a small case of Python.)

8.1 最小二乘曲线拟合hpir1.c 8.2 切比雪夫曲线拟合hchir.c 8.3 最佳一致逼近的里米兹法hremz.c 8.4 矩形域的最小二乘曲面拟合hpir2.c(8.1 Least-squares curve-fitting hpir1.c 8.2 Chebyshev curve fitting the best uniform approximation hchir.c 8.3 years Meeds law hremz.c 8.4 rectangular domain least-squares surface fitting hpir2.c)

介绍线性算子的基本概念的文章,这是书里面的一个章节(Foundation of linear operator theory)

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

主要用来计算抛物型偏微分方程的数值解，而且通过调用边界函数来计算方程，采用差分编程方式(Mainly used to calculate the parabolic partial differential equations numerical solution, and by calling the function to calculate the equation of the border, using differential programmatically)

说明：  这是简绍耦合矩阵的，为多通带的计算方法，可以方便的设计多通带微带滤波器，(This is Jane Shao coupling matrix for the multi-band calculation method, you can easily design multi-band microstrip filter)

Orthogonal Polynomials Approximation 数值分析，计算正交基多项式的系数 (Given a function f and a set of m >0 distinct points . You are supposed to write a function to approximate f by an orthogonal polynomial using the exact function values at the given m points with a weight assigned to each point . The total error must be no larger than a given tolerance. Format of function int OPA( double (*f)(double t), int m, double x[], double w[], double c[], double*eps ) where the function pointer double (*f)(double t) defines the function f int m is the number of points double x[] contains points double w[] contains the values of a weight function at the given points x[] double c[] contains the coefficients of the approximation polynomial double*eps is passed into the function as the tolerance for the error, and is supposed to be returned as the value of error. The function OPA is supposed to return the degree of the approximation polynomial. Note: a constant Max_n is defined so that if the total error is still not small enough when n = Ma)

通信領域於天線上常運用的波束集成，以matlab寫成。能模擬不同距離造成的波束形狀之不同。也加入部份Dolph-Chebyshev最佳化方法。(A traditional beamformer that can simulate differnt distance from the origin, and some implementation using Dolph-Chebyshev amplitude distribution.)

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

含约束的优化问题求解案例，算法简单，求解很方便实用(Constrained optimization problem solving case, the algorithm is simple, easy to solve, practical)