chirp-Z变换 MATLAB代码.txt

说明：  常用的matlab代码，非线性方程组求解，基本可以满足大学和研究生常用代码(Common Mathematical Codes)

说明：  球形粒子Mie 散射用Matlab编写的Mie theory计算程序。在光子学中运用广泛，使用非常方便(Mie scattering of spherical particles prepared by using Matlab program Mie theory. In the use of photonics in a wide range of very convenient to use)

说明：  复合材料损伤，复合材料层间分层，损伤，刚度退化、衰减(Composite damage, delamination of composite layers, damage, stiffness degradation, attenuation)

一些很有用的数值计算程序：包括多种数值逼近算法的C语言程序，如龙格逼近算法，里米兹一致逼近算法等(Some very useful numerical calculation procedures: including a variety of numerical approximation algorithm for the C language program, such as the Runge approximation algorithm, where meads uniform approximation algorithm)

Finding special triples of the form (n, n + 1, n + 2) Write a program that finds all triples of consecutive positive three-digit integers each of which is the sum of two squares, that is, all triples of the form (n, n + 1, n + 2) such that: • n, n+1 and n+2 are integers at least equal to 100 and at most equal to 999 • eachofn,n+1andn+2isoftheforma2+b2.(Finding special triples of the form (n, n+ 1, n+ 2) Write a program that finds all triples of consecutive positive three-digit integers each of which is the sum of two squares, that is, all triples of the form (n, n+ 1, n+ 2) such that: • n, n+1 and n+2 are integers at least equal to 100 and at most equal to 999 • eachofn,n+1andn+2isoftheforma2+b2.)

面向对象的有限元程序设计 ——空间8结点等参元的分析计算(Object-oriented finite element program design- space 8 node isoparametric element analysis calculation)

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.)

高斯回归建立代理模型行协方差函数的选着的变成(gpml-matlab-v3.1-2010-09-27)

数值方法的5个重要的算法： 1.[Dirich.m] 求解拉普拉斯方程的狄利克雷方法. 用于偏微分方程的数值解 2.[Hamming.m] 汉明方法是用来修正微分方程的多步预测。 3. [Milne.m] 米尔恩 - 辛普森差分方程求解方法，用于预测校正方法。 4. [Rkf45.m]龙格 - 库塔 - 沃尔伯格错误控制和步骤的方法求解微分方程的近似解 5.[Romber.m]著名的龙贝格积分源代码。计算结果存在并显示为下三角矩阵。(Numerical Methods in five of the more important algorithms: 1. [Dirich.m] to solve the Laplace equation Dirichlet method for the numerical solution of partial differential equations 2.[Hamming.m] Hamming method is the multistep forecast corrected differential equations. 3. [Milne.m] the Milne- Simpson method as a differential equation solver used forecast correction method. 4. [Rkf45.m] Runge- Kutta- Wahlberg error control and step method for solving differential equations approximate solution 5. [Romber.m] the famous Romberg integral source code numerical integration, the presence of computable results show a lower triangular matrix.)

★问题描述: 给出平面上的N 个二维点，求出距离最小的2 个点对。本题中距离定义为他们的直 线距离。例如(0,0) (3,4)的距离为5. ★数据输入： 有多组数据，对于每组数据，第一行是一个数字N 表示点的个数。N=0 的时候说明 输入结束。之后N 行，每行有2 个浮点数x_i,y_i 表示第i 个点的坐标。(1<=N<=10000 0,0<=|x_i|,|y_i|<=10^9) ★结果输出: 输出一个浮点数，表示最近点对的距离除以2，保留2 位小数(四舍五入)。