-
FFT
提供函数能进行1维2维的FFT，输入输出的序列长度应为2的整数次方倍(Provides functions can be one-dimensional two-dimensional FFT, sequence length input and output should be an integer power of 2 times)
- 2014-01-07 22:10:34下载
- 积分：1
-
wolfe
wolfe程序模块的C++算法，可以重复使用,对于解决一维搜索是很好的..(C++ algorithm wolfe program modules can be reused for solving one-dimensional search is good ..)
- 2014-02-25 15:11:57下载
- 积分：1
-
1
本书用c语言编写了科研和工程中最常用的166个算法,这些算法包括复数 运算、... 4.3.1 【算法23】求一般复矩阵的逆 4.3.2 【算法24】求对称正定矩阵的(good study)
- 2013-11-06 21:28:17下载
- 积分：1
-
boble
改进的冒泡排序的VC++源程序，希望大家能够从中受益！(improved Bubble Sort VC source, we hope to benefit from!)
- 2006-06-29 10:33:36下载
- 积分：1
-
2d
说明： 用FORTRAN语言实现二维欧拉方程的求解，采用二阶MUSCL迎风格式()
- 2007-09-10 14:30:45下载
- 积分：1
-
82859165cifa
编程序，按如下要求来求解n元一次线性方程组（假设方程组具有唯一解）。 （1）方程个数n之值由用户通过键盘输入； （2）方程组存放在“增广矩阵”A之中，而n行n+1列的A存储空间通过new来动态分配，且A的各元素值也由用户通过键盘输入
(Allocation procedures, the following requirements to solve the n-a system of linear equations (assuming a unique solution of equations). (1) the number n of the value equation by the user through the keyboard input (2) equations stored in the augmented matrix A, while n line n+ 1 column A storage space through the new dynamically allocated, and A The value of each element by the user through the keyboard input)
- 2011-06-21 22:50:34下载
- 积分：1
-
EMD
利用emd算法解决经验模式分解的一些存在的端点效应问题。 有效的解决了问题。(Using emd algorithm to solve some of the empirical mode decomposition end effects exist. Effective solution to the problem.)
- 2020-10-19 16:27:25下载
- 积分：1
-
oofem-2.4
有限元计算开源库，可以用于计算动力、静力、磁场等等方面的计算(Finite element calculation open source library)
- 2017-12-06 12:01:58下载
- 积分：1
-
poisson
poisson生成器，可以生成泊松分布的随机数，需要的就下载吧(poisson sasadas)
- 2011-12-07 01:10:52下载
- 积分：1
-
na7
Orthogonal Polynomials Approximation
数值分析，计算正交基多项式的系数
(Given a function f and a set of m >0 distinct points . You are supposed to write a function to approximate f by an orthogonal polynomial using the exact function values at the given m points with a weight assigned to each point . The total error must be no larger than a given tolerance.
Format of function
int OPA( double (*f)(double t), int m, double x[], double w[], double c[], double*eps )
where the function pointer double (*f)(double t) defines the function f int m is the number of points double x[] contains points double w[] contains the values of a weight function at the given points x[] double c[] contains the coefficients of the approximation polynomial double*eps is passed into the function as the tolerance for the error, and is supposed to be returned as the value of error. The function OPA is supposed to return the degree of the approximation polynomial.
Note: a constant Max_n is defined so that if the total error is still not small enough when n = Ma)
- 2011-11-27 11:47:21下载
- 积分：1
