linear-equations

欧拉角与四元数 欧拉角与四元数 欧拉角与四元数 欧拉角与四元数 欧拉角与四元数(you you you you you you you you you you you you you you you you my )

只是一个课堂上做的九九乘法表，可能很多人做过(Just a class to do multiplication table, many people may have done)

说明：  用C语言编写的Fluent UDF实例，包含Adjust宏，profile宏等八个实例教程，快速上手(The UDF is for computational fluid dynamics software Fluent, it concludes the Profile.c,the Adjust.c)

homagrapy matrix to find the homagrapy matrix from two pictures, first you need to get a set of coorlation vector

伪随机序列（N=4的M序列）的C语言编程实现，可以应用于相关分析法和最小二乘辨识的输入信号。(Pseudo-random sequence (N = 4 M-sequence) of the C programming language, can be used in correlation analysis and least squares identification of the input signal.)

数值分析算法，该压缩包含有雅克比迭代算法、弦割法法及综合评测法等(Numerical analysis algorithms, the compression Jacobi iteration algorithm, France and France chord cutting and comprehensive evaluation method)

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)

基于配电网络辐射型的前推回代潮流计算程序，包括分层等内容(And backward substitution based on the radiation type of distribution network before flow calculation procedures, including the contents of the stratification)

本程序包括：DFT（离散傅里叶变换），FFT（快速傅里叶变换），IFFT（快速傅里叶逆变换），conv（卷积：圆周卷积、线性卷积），主要应用于信号处理，既可以对实序列做上述操作，也可以对复序列。(This process includes: DFT (Discrete Fourier Transform), FFT (fast Fourier transform), IFFT (inverse fast Fourier transform), conv (convolution: circular convolution, linear convolution), mainly used signal processing, either on the actual sequence to do the operation, can also be complex sequence.)

列句25宫的所有组合。 每行,每列,和对角线 数字和为25。(sentence of 25 out of all the combinations Palace. Each line, each and diagonal figures and 25.)