登录
首页 » Unix_Linux » Numerical_Recipes_in_C.source_code

Numerical_Recipes_in_C.source_code

于 2016-03-29 发布 文件大小:199KB
0 326
下载积分: 1 下载次数: 16

代码说明:

  数值计算程序库,C语言版,Numerical Recipes in C,包含很多基本的数值计算子程序(Digital program library, C language version, Numerical Recipes in C)

文件列表:

complex.h,815,2003-05-17
nr.h,31471,2003-05-17
nrutil.h,3330,2003-05-17
recipies
........\addint.c,654,2000-02-29
........\airy.c,1044,2000-02-29
........\amebsa.c,1841,2000-02-29
........\amoeba.c,1548,2000-02-29
........\amotry.c,504,2000-02-29
........\amotsa.c,742,2000-02-29
........\anneal.c,1778,2000-02-29
........\anorm2.c,173,2000-02-29
........\arcmak.c,803,2000-02-29
........\arcode.c,2490,2000-02-29
........\arcsum.c,357,2000-02-29
........\asolve.c,197,2000-02-29
........\atimes.c,368,2000-02-29
........\avevar.c,274,2000-02-29
........\balanc.c,649,2000-02-29
........\banbks.c,490,2000-02-29
........\bandec.c,842,2000-02-29
........\banmul.c,302,2000-02-29
........\bcucof.c,1044,2000-02-29
........\bcuint.c,815,2000-02-29
........\beschb.c,649,2000-02-29
........\bessi.c,644,2000-02-29
........\bessi0.c,443,2000-02-29
........\bessi1.c,486,2000-02-29
........\bessik.c,2536,2000-02-29
........\bessj.c,939,2000-02-29
........\bessj0.c,683,2000-02-29
........\bessj1.c,705,2000-02-29
........\bessjy.c,3274,2000-02-29
........\bessk.c,318,2000-02-29
........\bessk0.c,438,2000-02-29
........\bessk1.c,446,2000-02-29
........\bessy.c,318,2000-02-29
........\bessy0.c,721,2000-02-29
........\beta.c,124,2000-02-29
........\betacf.c,820,2000-02-29
........\betai.c,441,2000-02-29
........\bico.c,128,2000-02-29
........\bksub.c,427,2000-02-29
........\bnldev.c,1001,2000-02-29
........\brent.c,1451,2000-02-29
........\broydn.c,4072,2000-02-29
........\bsstep.c,3222,2000-02-29
........\caldat.c,555,2000-02-29
........\chder.c,240,2000-02-29
........\chebev.c,321,2000-02-29
........\chebft.c,494,2000-02-29
........\chebpc.c,433,2000-02-29
........\chint.c,285,2000-02-29
........\chixy.c,570,2000-02-29
........\choldc.c,351,2000-02-29
........\cholsl.c,280,2000-02-29
........\chsone.c,412,2000-02-29
........\chstwo.c,390,2000-02-29
........\cisi.c,1496,2000-02-29
........\cntab1.c,996,2000-02-29
........\cntab2.c,1006,2000-02-29
........\complex.c,2018,2000-02-29
........\complex.h,815,2000-02-29
........\convlv.c,1026,2000-02-29
........\copy.c,127,2000-02-29
........\correl.c,567,2000-02-29
........\cosft1.c,637,2000-02-29
........\cosft2.c,1288,2000-02-29
........\covsrt.c,389,2000-02-29
........\crank.c,348,2000-02-29
........\cyclic.c,756,2000-02-29
........\daub4.c,931,2000-02-29
........\dawson.c,766,2000-02-29
........\dbrent.c,1911,2000-02-29
........\ddpoly.c,330,2000-02-29
........\decchk.c,692,2000-02-29
........\df1dim.c,442,2000-02-29
........\dfour1.c,927,2000-02-29
........\dfpmin.c,2326,2000-02-29
........\dfridr.c,942,2000-02-29
........\dftcor.c,1963,2000-02-29
........\dftint.c,1701,2000-02-29
........\difeq.c,1636,2000-02-29
........\dlinmin.c,939,2000-02-29
........\dpythag.c,280,2000-02-29
........\drealft.c,1027,2000-02-29
........\dsprsax.c,321,2000-02-29
........\dsprstx.c,359,2000-02-29
........\dsvbksb.c,424,2000-02-29
........\dsvdcmp.c,3577,2000-02-29
........\eclass.c,310,2000-02-29
........\eclazz.c,263,2000-02-29
........\ei.c,787,2000-02-29
........\eigsrt.c,280,2000-02-29
........\elle.c,309,2000-02-29
........\ellf.c,221,2000-02-29
........\ellpi.c,350,2000-02-29
........\elmhes.c,594,2000-02-29
........\erfcc.c,298,2000-02-29
........\erff.c,109,2000-02-29

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • Floating-point-complex-radix-2-decimation-in-time-
    浮点复数基2时分FFT完成适当的FFT,输出改写输入缓冲器。(floating-point complex FFT-based two hours to complete the FFT output rewritten input buffer.)
    2006-08-07 14:19:25下载
    积分:1
  • frft
    说明:  分数傅里叶变换程序,这个是二维分数阶傅里叶变化程序。(Fractional Fourier transform procedure, this is a two-dimensional fractional Fourier change process.)
    2010-03-20 21:39:35下载
    积分:1
  • CPPsimplex
    单纯形法,求解线性规划问题的通用方法。单纯形是美国数学家G.B.丹齐克于1947年首先提出来的。它的理论根据是:线性规划问题的可行域是 n维向量空间Rn中的多面凸集,其最优值如果存在必在该凸集的某顶点处达到。顶点所对应的可行解称为基本可行解。单纯形法的基本思想是:先找出一个基本可行解,对它进行鉴别,看是否是最优解;若不是,则按照一定法则转换到另一改进的基本可行解,再鉴别;若仍不是,则再转换,按此重复进行。因基本可行解的个数有限,故经有限次转换必能得出问题的最优解。如果问题无最优解也可用此法判别。 (Simplex method for the minimum)
    2011-09-18 22:57:30下载
    积分:1
  • jifen
    分别用梯形法和矩形法求定积分,附加应用实例(, Respectively, with the trapezoidal method and the rectangle method to find definite integrals, additional application examples)
    2012-11-28 22:16:59下载
    积分:1
  • udf
    计算fluent相变的udf模型,包括气相到液相,液相到气相的双向传递。(Calculate the udf model of fluent phase transition)
    2020-11-21 15:09:35下载
    积分:1
  • UDS-unsteady
    关于用户自定义标量输运(UDS)中非定态情况下的代码源项,主要用于非稳定流动的物质输运的耦合(On the code of the user-defined scalar transport (UDS) Central Africa steady state case the source terms, mainly for non-steady flow of the coupling of mass transport)
    2021-03-02 15:09:34下载
    积分:1
  • TSP--problem--solution
    TSP最短路径 最少时间 数学建模 (TSP shortest path at least time mathematical modeling)
    2012-03-08 17:59:01下载
    积分:1
  • chazhi
    对格朗日、分段线性、三次样条插值方法的运用。(Grange, piecewise linear, cubic spline interpolation method to use.)
    2012-07-01 02:23:18下载
    积分:1
  • fft
    用DFT 函数计算电压u, 电流i的基波(f1=50 Hz)的有效值和相位; 用FFT函数分别计算电压u和电流i 所包含的直流,基波和谐波的有效值和初相角; 可计算基波(f1=50 Hz)和各次谐波的功率p和功率因数con?.(The effective value and phase of fundamental wave (f1 = 50 Hz) of voltage U and current I are calculated by DFT function. The effective values and initial phase angles of DC, fundamental and harmonic waves contained in voltage U and current I are calculated by FFT function, respectively. The power P and power factor con of fundamental wave (f1 = 50 Hz) and harmonics can be calculated.)
    2019-03-28 15:48:19下载
    积分:1
  • KFFT
    计算离散傅里叶变换的一种快速算法,简称FFT。快速傅里叶变换是1965年由J.W.库利和T.W.图基提出的。采用这种算法能使计算机计算离散傅里叶变换所需要的乘法次数大为减少,特别是被变换的抽样点数N越多,FFT算法计算量的节省就越显著。(A computing discrete Fourier transform fast algorithm, referred to as FFT. Fast Fourier Transform in 1965 by the JW Cooley and TW Tuji Ti out. Using this algorithm enables a computer to calculate the number of multiplications needed for the discrete Fourier transform greatly reduced, especially sampling points N is transformed more and save FFT algorithm to calculate the amount of the more remarkable.)
    2013-12-18 22:32:50下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载