登录
首页 » matlab » readzygodat2_pjz

readzygodat2_pjz

于 2021-03-08 发布 文件大小:2KB
0 180
下载积分: 1 下载次数: 29

代码说明:

  读取zygo干涉仪中的dat格式数据,并转化为矩阵格式(Reads the dat format data in the Zygo interferometer and transforms it into a matrix format.)

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

发表评论

0 个回复

  • jeimai
    混沌的判断指标Lyapunov指数计算,与理论分析结果相比,可实现对二维数据的聚类。( Chaos indicator for Lyapunov index calculation, Compared with the results of theoretical analysis, Can realize the two-dimensional data clustering.)
    2017-04-09 11:56:37下载
    积分:1
  • gmres
    gmres 方法。视图求解线性方程组A*x=b的解x。nXn的稀疏矩阵A必须是方程且应是大型稀疏矩阵。列向量b的长度必须为n。(gmres method. View solving linear equations A* x = b the solution x. nXn sparse matrix A must be equation and should be large sparse matrix. The length of the column vector b must be to n.)
    2013-09-13 16:29:56下载
    积分:1
  • UMAT_Hashin3D_T-N
    基于ABAQUS的hashin和Tong-Norrius准则的umat子程序(Umat subroutine based on the Hashin and Tong-Norrius guidelines of ABAQUS)
    2020-10-26 23:00:00下载
    积分:1
  • Riemann-problems
    求解Riemann 问题精确解的Fortran程序(Exact solution of Riemann problem solving Fortran program)
    2014-06-10 00:08:48下载
    积分:1
  • gravity_direct_problem
    重力异常正演代码,请好好使用它。帮助学习。。。。(Gravity anomaly forward code, please use it well. Help learn)
    2019-03-21 09:39:57下载
    积分:1
  • Matrix Computations 4th edition.pdf
    矩阵计算英文版第4版,经典,经典,很不错!!!!!请下载!!!!!!(Matrix Computing English Version 4, classic, classic, very good!!!! Please download!!!!!!)
    2020-06-23 22:20:02下载
    积分:1
  • newton
    牛顿迭代求根法和牛顿-steffensen加速法(Newton method for root-solving problems. Newton-Steffenson is also included.)
    2011-12-21 23:53:13下载
    积分:1
  • Particle_Filter
    粒子滤波程序,仿真实现自由度机器人对目标的跟踪,使用kalman滤波估计总雅可比矩阵J,噪声为非高斯噪声(Particle filter procedure, simulation robot tracking of targets, the use of kalman filter estimated total Jacobian matrix J, the noise of non-Gaussian noise)
    2008-12-15 10:37:55下载
    积分:1
  • hartigansSLC_OpenCV
    hartigans Sequential Leader Clustering Algorithm in terms of OpenCV (ver.1.1) Sequential Leader algorithm: Hartigan, J. A. (1975), Clustering Algorithms. John Wiley and Sons, Inc., New York, NY. 1. Select maximum cluster "radius" 2. Start with zero clusters 3. Add each item to be clustered to: * Closest cluster if distance <= r * New cluster if distance to closest cluster > r 4. Compute new center from members in cluster 5. Empty the clusters (keeping the centers) 6. Return to step 3 (until no changes are made)
    2010-02-25 19:28:25下载
    积分:1
  • Umat_ElasticPlastic_Explicit
    Abaqus UMAT code 适用于平面应变,轴对称弹塑性本构关系,也适用于大应变情况,使用显示积分算法。(Abaqus UMAT code applies to plane strain, axisymmetric elastoplastic constitutive relation, also applicable to large strain, using the integration algorithm.)
    2013-03-30 03:46:43下载
    积分:1
  • 696518资源总数
  • 106164会员总数
  • 18今日下载