newspring

用LBM结合非平衡外推方法实现的圆柱绕流，柱面边界以非平衡外推方法实现。(LBM combined with the extrapolation method of achieving non-equilibrium flow around a cylinder, cylinder boundary to achieve non-equilibrium extrapolation method.)

利用下载的goce原始数据，计算得出含有时间/经纬度/重力梯度格式的程序(Use downloaded goce raw data, calculated with the time/latitude/gravity gradient program formats)

Matlab codes for Robust PCA multivariate control chart(Robust PCA multivariate control chart mainly consists two steps: Step1 Calculates the robust mean and the robust covariance of original dataset using the minimum covariance determinant (MCD). In MCD technique, finding a subset containing half of the data such that its covariance matrix has the lowest determinant, then using this subset to calculate the robust mean and the robust covariance matrix (Hubert, Rousseeuw, & Branden, 2005) Step2 Standardize data using robust mean and robust standard deviation from Step1. Apply PCA analysis, calculate the principalcomponent score matrix Y=ZA, where Z is the robust standardized data matrix, and A is p*p matrix of eigenvectors (also called principalcomponents))

计算流体力学;高精度7阶二维weno格式;矢通量分裂方法(Vector flux splitting in 7 order two dimensional WENO scheme)

共扼梯度法的Matlab源程序，寻找非线性或线性方程的极值(conjugate gradient method of Matlab source to find nonlinear equations or linear Extreme)

说明：  独立分析 主成分分析 可以提取矩阵独立成分与主成分，显示空间特征与时间特征以及对应的奇异分析用于计算能进行奇异值分解等。主要用于数值的提取计算等。(It can extract the independent and principal components of matrix, display the spatial and temporal characteristics, and use the corresponding singular analysis to calculate the singular value decomposition. It is mainly used for extraction and calculation of numerical value.)

采用有限元离散计算一维声子、光子能带，参数见文件源码内(Calculated using the finite element discrete one-dimensional phonon, photon energy band, within the parameters see document source)

该文件解决了电磁场和天线问题计算当中的近远场转换的问题，它也可以应用在一般散射问题的求解中。(this file contains an algorithm that could solve problems within the EM and antenna near to far field questions. Also, it could be used in general scattering problems.)

三角网格以及矩形网格剖分. 实现等参单元以及误差L H 范数收敛阶估计.(Triangular meshes and rectangular meshes are subdivided to achieve convergence order estimation of error L H norm.)

说明：  Description 设a[0…n-1]是一个包含n个数的数组，若在ia[j]，则称(i, j)为a数组的一个逆序对（inversion）。 比如 有5个逆序对。请采用类似“合并排序算法”的分治思路以O(nlogn)的效率来实现逆序对的统计。 一个n个元素序列的逆序对个数由三部分构成： （1）它的左半部分逆序对的个数，（2）加上右半部分逆序对的个数，（3）再加上左半部分元素大于右半部分元素的数量。 其中前两部分（1）和（2）由递归来实现。要保证算法最后效率O(nlogn)，第三部分（3）应该如何实现？ 此题请勿采用O(n^2)的简单枚举算法来实现。 并思考如下问题： （1）怎样的数组含有最多的逆序对？最多的又是多少个呢？ （2）插入排序的运行时间和数组中逆序对的个数有关系吗？什么关系？ 输入格式 第一行：n，表示接下来要输入n个元素，n不超过10000。 第二行：n个元素序列。 输出格式 逆序对的个数。 输入样例 5 2 3 8 6 1 输出样例 5(Set a[0... N-1] is a n array containing n numbers. If there is a [i] > a [j] i n the case of I < j, then (i, j) is a n inversion pair of a array. For example, has five reverse pairs. Please use the idea of "merge sorting algorithm" to achieve the statistics of inverse pairs with O (nlogn) efficiency. The number of inverse pairs of a sequence of n elements consists of three parts: (1) The number of reverse pairs in the left half, (2) the number of reverse pairs in the right half, (3) the number of elements in the left half is greater than that in the right half. The first two parts (1) and (2) are implemented by recursion. To ensure the final efficiency of the algorithm O (nlogn), how should the third part (3) be implemented? Do not use O (n ^ 2) simple enumeration algorithm to solve this problem.)