登录
首页 » matlab » CPA

CPA

于 2014-11-18 发布 文件大小:4KB
0 251
下载积分: 1 下载次数: 12

代码说明:

  啁啾脉冲放大中的多通放大进行数值计算,并计算其横截面光强分布。可以用于进一步计算和确定系统参数(Chirped pulse amplification of multiple amplification through numerical calculation, and calculates the cross-sectional intensity distribution. And can be used in further calculations to determine the system parameters. Ti:saphirre amplification.multipass)

文件列表:

CPA.m,13670,2014-11-03

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

发表评论

0 个回复

  • PQ-chaoliujisuan
    利用快速解耦法进行电力系统潮流计算,对配电网进行潮流计算(Use of PQ decomposition method for the electric power flow calculation system)
    2012-04-26 09:42:35下载
    积分:1
  • t_tide_v1.2beta
    t_tide潮流分离更新新版本。可以针对潮汐与海流进行有针对性分离。(t_tide trend separation to update the new version. Targeted separation for tides and currents.)
    2013-03-14 19:50:37下载
    积分:1
  • static2d
    有限元二维静力计算程序,采用四节点线性单元,可以显示变形和应力云图。(Finite element analysis program for 2D problems)
    2013-05-18 12:20:48下载
    积分:1
  • MATLAB
    数学中的通径分析问题,主要用于数学实验方面,计算数学中的数据分析(Path analysis of mathematical problems in)
    2011-05-28 10:32:01下载
    积分:1
  • GOCEPARSER
    利用下载的goce原始数据,计算得出含有时间/经纬度/重力梯度格式的程序(Use downloaded goce raw data, calculated with the time/latitude/gravity gradient program formats)
    2013-08-25 16:44:04下载
    积分:1
  • eular_ode
    欧拉法解常微分方程的MATLAB程序M文件。与大家分享(Euler method for solving the M-file of Ordinary Differential Equations MATLAB program. To share with you)
    2012-03-20 12:01:04下载
    积分:1
  • clc
    一维热传导模型,一维稳态热传导模型,有限差分法(One dimensional heat conduction model)
    2018-09-15 08:40:17下载
    积分:1
  • chebyshevnihe
    说明:  数值分析中的chebyshev拟合程序,学习数值分析的同学可以参考参考(Numerical Analysis of chebyshev fit program, students study and numerical analysis can refer to reference)
    2011-03-24 15:07:01下载
    积分:1
  • aitejin
    艾特金迭代法求解线性方程组源代码,在程序中修改方程就可以(Aitkin iterative method for solving linear equations source code, the equation can be modified in the program)
    2012-06-03 16:08:11下载
    积分: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今日下载