伸展树

这个项目是在游戏编程中使用星的一种算法的一个示例。益智游戏是一个非常简单的但游戏，通过了这一项目，你可以知道如何执行一个星级的算法，特别在一个人工的智能游戏。

一个基于主元分析的故障诊断的程序，是一个数值仿真实验

Runge-Kutta-Fehlberg method

数值分析算法Guase_Seidel迭代-numerical analysis algorithm Iterative Guase_Seidel

等离子体PIC模拟-PIC simulation of plasma

One of the world-wide cooperative computing tasks is the "Grand Internet Mersenne Prime Search" -- GIMPS -- striving to find ever-larger prime numbers by examining a particular category of such numbers. A Mersenne number is defined as a number of the form (2p–1), where p is a prime number -- a number divisible only by one and itself. (A number that can be divided by numbers other than itself and one are called "composite" numbers, and each of these can be uniquely represented by the prime numbers that can be multiplied together to generate the composite number — referred to as its prime factors.) Initially it looks as though the Mersenne numbers are all primes. Prime Corresponding Mersenne Number 2 4–1 = 3 -- prime 3 8–1 = 7

利用Java实现的基本PSO,读者要懂得基本的java语句，实现不难，供入门级学习参考使用

header file implementing LU decomposition of a matrix. The file is independent, all the functions required are in the header file

csharp版常见数值计算源码，包括矩阵计算、插值、线性方程和非线性方程等-CSharp version of common-source numerical computation, including the matrix calculation, interpolation, linear equations and nonlinear equations, such as

lapped transforms for images. lapped transform is a very fast algorithm to replace dct.