搜索资源列表
ptfsf
- The tar file contains the following files: ptfsf.c: heart of the perfect TFSF code ptfsf.h: header file for same ptfsf-demo.c: FDTD code which demonstrates use of perfect TFSF code. Essentially this program used to generate results shown
firstmark
- 完整的第一类椭圆积分源程序，非常实用的vc源代码-integrity of the first class of elliptic integral source, a very practical vc source code
Work1
- 北航数值分析大作业第一题：矩阵的QR分解求特征向量。代码是我在理学院本科期间写的，所有结果已经过Matlab及Mathematica验证，保证算法正确实现。-Numerical analysis of Beihang great job the first question: QR decomposition of matrix eigenvector. Code is written during my undergraduate logical Institute, all results
tuoyuanjifen
- 数值算法里面求第一类椭圆积分的算法程序源码，-Numerical algorithms which seek first elliptic integral of the algorithm source code,
szsbxt
- 关于矩阵类库的VC++源代码 因为已经保存了训练好的网络权值，所以第一次使用识别程序时，可以直接运行\\Release目录下的可执行文件-On the matrix class library VC++ Source code since it has been preserved trained network weights, so the identification procedures used for the first time, you can directly run th
DelaunayNet
- 在测绘或地图学中，经常会需要用高程点生成DEM，一般首先由这些点按最小原则生成三角网，此代码即是根据任意多个点生成Delaunay三角网功能。-In the mapping or cartography often elevation point will need to generate DEM, generally the first point from these principles by the smallest triangulation generated, the code t
First
- Fortran code to solve wave equation with multiple methods
PROGRAM9
- 振动作业 分析多自由度问题 求解多维问题的特征值也特征向量 线性叠加法分析受迫振动的第一步-matlab code for solve the eignvalue the first step of analysis the multiply degree of freedom forced vibration
PDD-code
- 并行计算PDD源代码，可用于求解三对角线性方程组，该算法是孙先河在上世纪提出的，因其具有良好的可扩展性而沿用至今-Parallel computing PDD source code can be used for solving tridiagonal linear equations, the algorithm is the first of its kind, Sun made in the last century, because of their good scalability
CODES
- This file conclude of five codes , four of them in Mathematica program and one in C++. 1. Erk4.nb. this code represent the explicit Runge Kutta method of order four for solving first order ODE. 2. RK45.nb This code represent the Embedded Runge Ku
v
- 变分方法及其应用，在研究偏微分方程的应用前，先看看其基础理论，对于代码的具体实现以及公式推导都会有帮助-Variational method and its application, the application of partial differential equations in the study before the first look at its basic theory, for the specific implementation code and the formula
FFT
- 傅里叶变换的C程序，实现时域抽取的基2FFT，算法先对输入数据序列进行码位倒置，输出为正序-Fourier transform of C program, to achieve time-domain extraction of base 2FFT, algorithm on the input data sequence of first code bit inverted, the output for the positive sequence
check
- 有15个数按由小到大顺序放在一个数组中，输入一个数，要求用折半查找法找出该数是数组中的第几个元素的值，如果该数不在数组中，则打印出无此数 的C程序代码 谢谢！！！ -15 the number of small to large order placed by an array, enter a number, asked to use binary search method to find the number is the first of several elements of the
fortran6
- 这是关于何光渝书上对应的源代码，源代码是对应书上第六章-This is a book about He Guangyu corresponding source code, source code is written corresponding to the first six chapters
Pressure-Star
- This an fortran code that used in cfd codes.if you are looking to this code at first should know about this code. It is a simple methof of solvinf navier-stokes cide.its part of calculating PStar.
c-source-code
- 有一对兔子，从出生后第3个月起每个月都生一对兔子，小兔子长到第三个月 后每个月又生一对兔子，假如兔子都不死，问每个月的兔子总数为多少？ -One pair of rabbits, one pair of rabbits are born from the month from 3 months after birth, the little rabbit long gave birth to the first three months after the month of the rabbit
code
- 问题描述： 在一个操场的四周摆放着n 堆石子。现要将石子有次序地合并成一堆。规定每次至少选2 堆最多选k堆石子合并成新的一堆，合并的费用为新的一堆的石子数。试设计一个算法，计算出将n堆石子合并成一堆的最大总费用和最小总费用。 编程任务： 对于给定n堆石子,编程计算合并成一堆的最大总费用和最小总费用。 Input 测试数据的第1 行有2个正整数n和k，表示有n堆石子，每次至少选2堆最多选k堆石子合并。第2行有n个数，分别表示每堆石子的个数。 O
Heap-Sort-Algorithm-Pseudo-Code
- The heapsort algorithm can be divided into two parts. In the first step, a heap is built out of the data. In the second step, a sorted array is created by repeatedly removing the largest element from the heap, and inserting it into the arra
code
- 清华大学张旭东老师的《现在信号处理》第一次大作业的代码，题目多年未变，代码正确高效。-This code is programed for for the first project for modern signal processing ,which is tought by Zhang Xudong in Qinghua University.
the code
- 泊松分酒问题的一般解 用BFS进行广度优先搜索 实现简单(The general solution of Poisson's wine problem is implemented by BFS, which is simple in breadth first search)