资源列表
Anderson
- Anderson的计算流体力学入门第九章源程序，Fortran编写-Anderson' s Introduction to Computational Fluid Dynamics Chapter IX source, Fortran write
simple
- 突然扩张管道中流动问题，用C语言编写有注释，学习CFD比较有参考价值.-A sudden expansion pipe flow problem, using C language with a comment, have more to learn CFD reference value.
Lagrange
- 数据插值的基本出发点是根据函数f(x)的一组数据{xi,f(xi)}(i=0,1,…,n),按照插值条件构造简单易算的函数P(x)去近似f(x)。本代码用高级程序设计语言实现Lagrange插值，-The basic starting point of data interpolation is based on the function f (x) of a set of data (xi, f (xi)) (i = 0,1, ..., n), constructed in accordanc
strassen
- 1.实现时间复杂度为 Ο （nlg7） strassen矩阵乘法 2. 实现时间复杂度为 Ο(n3) 常规矩阵乘法 3. 能随机生成矩阵 4. 分析比较不同输入规模下的strassen算法与常规矩阵乘法的运行时间-1. To achieve the time complexity of Ο (nlg7) strassen matrix multiplication 2. To achieve the time complexity of Ο (n3) General matrix m
largenumber
- 关于VB大数加法,减法,乘法,除法,乘方,MOD,阶乘运算,-Large numbers on the VB addition, subtraction, multiplication, division, involution, MOD, factorial calculations,
football
- Descr iption 2008六月激动人心的欧洲杯就要开始了，来直世界各地的人们都会涌向主办国瑞士和奥地利。由于比赛是在不同的城市进行，为了使球迷们能够尽快的到达各个城市，主办方决定在城市之间修建铁路来满足需要，铁路线当然越短越好喽。现在你的任务是帮助主办方选择最优的修建方案。 Input 输入的第一行是一个数n(2 <= n <= 50 )，表示城市的数目。 后面是一个n * n的矩阵A，A[i][j]表示第i个城市和第j个城市的路径(0 <= A[
usaco_dec09
- usaco december 09 solutions that i submitted during contest and got ACC. BRONZE division.
codekole
- ga code in matlab with good method
Lyapunov
- It is a Fortuan Based codes to calculate Lyapunov Exponnent! It is especially useful in chaotic signal processing!
Conway
- Conway The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970.[1] It is the best-known example of a cellular automaton.
SimpleMonteCarloModel
- we shall study the pricing of derivatives using Monte Carlo simulation.We do this not to study the intricacies of Monte Carlo but because it provides many convenient examples of concepts that can be abstracted.
Segmentationusingeigenvectors
- this slide provide to studying about eigenvector