登录
首页 » matlab » sem2d_friction_plastic

sem2d_friction_plastic

于 2011-11-21 发布 文件大小:4KB
0 193
下载积分: 1 下载次数: 17

代码说明:

  Spectral Element Method to solve the 2D SH wave equation,strain weakening (plasticity) in the bulk,paraxial absorbing boundary conditions and zero initial conditions in a structured undeformed grid.

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

发表评论

0 个回复

  • PTP_Switches_Ethernet
    1588高精度时间同步协议(PTP协议)的学习总结,希望对大家有所帮助(1588 Precision Time Synchronization Protocol (PTP protocol) study concluded, I hope to be helpful)
    2010-05-14 11:09:11下载
    积分:1
  • Matrixandlinearequations
    矩阵与线性代数方程组中 线性方程的数值解 矩阵分解 矩阵求逆 (Matrices and linear algebraic equations in the numerical solution of linear equations matrix inverse matrix decomposition)
    2010-11-30 13:30:53下载
    积分:1
  • vector_control
    基于MATLAB-SIMULINK的异步电机电机转速双闭环调速系统(Based on MATLAB-SIMULINK of Induction Motor motor speed dual-loop speed control system)
    2016-05-11 16:50:51下载
    积分:1
  • fresnel
    此代码为三维菲涅耳全息图的再现代码,但是有部分错误还未完全研究明白(This code for the three Wei Feinie ears hologram reproduction code, but some of the error is not fully understood)
    2010-11-03 10:29:29下载
    积分:1
  • FastMatchTemplate
    Fast template matching code with c++
    2011-09-27 22:35:01下载
    积分:1
  • Kalman
    对于一个含有明显噪声的心电信号进行卡尔曼滤波处理,最大程度地 “还原”信号,达到去除噪声的目的。卡尔曼滤波(看成维纳滤波的一种实现方法)的特点如下: a) 是根据上一状态的估计值X(n-1)和当前状态的观测值Z(n)推出当前状态的估计值X(n)的滤波方法,不需要用过去的全部观测值。 b) 它是用状态方程和递推方法进行估计的,因而卡尔曼滤波对信号的平稳性和时不变性不做要求。 c) 使用全部观测值保证平稳性。(Kalman in matlab,if you need it,please download it.)
    2021-01-09 10:28:51下载
    积分:1
  • edge-detect-matlab
    实现图像的边缘检测功能,会生成六种不同的结果。(Image edge detection function, will generate six different results.)
    2008-05-27 11:57:12下载
    积分:1
  • MatlabSpectralMethods
    说明:  MATLAB国外经典,英文学习好的可以下载学习啊。(MATLAB foreign classics, and English learning good study can be downloaded ah.)
    2008-11-25 16:40:54下载
    积分:1
  • sc-fdma-dasar
    untuk sc-fdma dasar gan
    2013-01-13 14:42:43下载
    积分:1
  • tsp-matlab
    The travelling salesman problem (TSP) or travelling salesperson problem asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.
    2013-10-22 00:42:51下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载