inductor_para_75k

把 Maxwell 方程式在时间和空间领域上进行差分化。利用蛙跳式(Leap frog algorithm)--空间领域内的电场和磁场进行交替计算，通过时间领域上更新来模仿电磁场的变化，达到数值计算的目的。(The Maxwell equations in time and space on the field differencing. Using the leapfrog (Leap frog algorithm)- Space field for alternating electric and magnetic fields calculated by the time domain electromagnetic field is updated to mimic the changes to achieve the purpose of numerical calculation.)

用來計算帶通濾波器相關參數，可以看出響應圖(Band-pass filter is used to calculate the relevant parameters can be seen in Fig response)

计算分维的程序，很好用，可根据需要随意调用(Calculate fractal dimension program, easy to use, can feel free to call)

给出了高斯消元的代码，和程序页面，方便快捷(The code and program page of Gauss elimination are given, which is convenient and quick.)

COMSOL工程案例的英文书籍，亚马逊网站可查，售价不费。(COMSOL project case of English books, Amazon website can be found, the price is not cost.)

ICP迭代最近点算法的各种实现方法，包括四元函数法，最小迭代，等算法，以及ICP迭代最近点算法的实现。(ICP iterative closest point algorithm implementation, including the four-function method, the minimum iteration algorithm, and ICP iterative closest point algorithm.)

针对多径效应的影响，提出了一种基于矩阵束的MIMO 雷达低仰角快速估计方法。该方法同时考虑了发射多径信号和接收多径信号，采用单样本数信号矢量构造了一个前后向矩阵束，并利用两个酉矩阵对该矩阵束进行降维处理，最后采用广义特征值分解的总体最小二乘法来估计目标角度。算法不需要估计数据协方差矩阵，可在低 信噪比和单样本数情况下，有效地克服多径效应，实现同时多目标低仰角估计，相比最大似然算法，避免了谱峰搜索，计算量小。仿真结果验证了该算法的有效性。(To overcome the multipath effect, a fast algorithm for low elevation estimation for MIMO radar via matrix pencil is proposed. The signals both in transmit multipath and receive multipath are considered. Firstly, a forward-backward matrix pencil is formed based on the single-sampled vector. Secondly, the reduced-dimensional processing is applied to the matrix pencil via two unitary matrices. Finally, the generalized eigen-decomposition is employed to estimate the low elevation in multipath environments directly. Without the covariance matrix estimation, the proposed method can overcome multipath effect effectively in case of low SNR and estimate multi-target simultaneously. Compared with Maximum Likelihood (ML) method, it avoids spectrum peak searching and reduces the computational burden. Numerical results verify the effectiveness of this method)

埃特金加速法,一个数值分析中的算法,大家先看看哦(Aitken acceleration method, a numerical analysis of the algorithm, we look at the flash open her cloak)

电磁场与微波技术下的射线追踪技术。应用c语言编程(Electromagnetic Field and Microwave Technology under the ray tracing technique. Application c programming language)

Description 设a[0…n-1]是一个包含n个数的数组，若在i<j的情况下，有a[i]>a[j]，则称(i, j)为a数组的一个逆序对（inversion）。 比如 <2,3,8,6,1> 有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, <2,3,8,6,1> 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.)