登录
首页 » matlab » P92_ODE_EulerMethod

P92_ODE_EulerMethod

于 2014-10-15 发布 文件大小:1KB
0 224
下载积分: 1 下载次数: 1

代码说明:

  Euler method used for solving ordinary differential equation.

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

发表评论

0 个回复

  • fdtd_1d_src_oneway
    一维单方向高斯点源传输设置的FDTD实现(Set the direction of the one-dimensional Gaussian point source transmission FDTD implementation)
    2013-01-22 17:11:33下载
    积分:1
  • FEIKONGStateflow
    由我自己建立的Matlab2012b无人机飞行控制系统模型,并与SIMULINK的Stateflow工具在一起,实现了飞行控制,由Stateflow提供了控制策略,由SIMULINK构建了无人机模型的被控对象,并结合PID控制,实现全过程的监控(Matlab2012b UAV flight control system model created by my own, and with the simulink in Stateflow tools together to form one of its flight, a control model provides control policy consists stateflow, UAV model built by the simulink as a controlled object, combined with PID control and monitoring of the whole process of realization)
    2020-12-28 16:09:01下载
    积分:1
  • PCM
    说明:  利用Matlab仿真脉冲编码调制(PCM)及A律、μ律PCM对声音进行压缩编解码过程。 脉冲编码调制(PCM,Pulse Code Modulation)是一种将模拟语音信号转换成数字信号的编码方式。波形编码器的作用是对采样后的信号样本进行量化和编码。从数学上来看,量化过程就是把一个连续幅度值的无限数集合映射成一个离散幅度值的有限数集合,编码就是用一组二进制数来表示这些映射后的有限数。国际标准化的PCM采用折叠二进制码,符合长途电话质量。根据量化方法的不同,PCM可分为均匀量化PCM和对数PCM两大类,对数PCM中,2Aμ律和律编码都已被定为国际标准。(Matlab simulation using pulse code modulation (PCM) and the A law, μ law PCM codec for voice compression process. Pulse Code Modulation (PCM, Pulse Code Modulation) is an analog voice signal into digital signal encoding. The role of the encoder waveform is sampled signal sample quantization and coding. From the mathematical point of view, the process is to quantify the magnitude of the value of a continuous set of infinite number of maps into a finite number of discrete set of amplitude values​ ​ , encoding is to use a set of binary digits, said after a limited number of these maps. By folding the International Standardization of PCM binary code, in line with long-distance telephone quality. According to the different quantitative methods, PCM can be divided into uniform quantization PCM PCM and the number of two categories, on the number of PCM in, 2Aμ law and legal codes have been designated as international standards.)
    2011-04-14 12:06:33下载
    积分:1
  • 73325228-05-Reporte-Reduccion-de-diagrama-de-bloq
    MATLAB DIAGRAMAS N BLOQUES
    2013-05-08 16:51:24下载
    积分:1
  • dwt_svd_mfile
    matlab数字水印程序m文件程序,用的是小波变换中的dwt方法,并且把小波变换分成了四个子带,选择的LL子带。svd算法与dwt相结合,加密方法是混沌加密。与我刚才上传的dwt_svd_GUI.rar是一个程序,一个是gui的,一个是m文件。(m digital watermarking matlab program documentation procedures, using a wavelet transform method in the dwt and the wavelet transform is divided into four sub-band, choose the LL sub-band. svd algorithm with a combination of dwt, encryption method is chaotic encryption. I have just uploaded a dwt_svd_GUI.rar procedures, one is the gui, one m file.)
    2021-04-08 17:19:00下载
    积分:1
  • nested_examples
    Basic matlab codes 2
    2011-01-30 17:01:00下载
    积分:1
  • spider20060724
    机器学习和模式识别工具包spider。内容很丰富。包含svm 决策树(C45,J48)、svm、knn、adaboost、bagging、hmm(隐马尔科夫模型)、随机树(random forest)等(Machine learning and pattern recognition toolkit spider. Very rich in contents. Tree contains svm (C45, J48), svm, knn, adaboost, bagging, hmm (hidden Markov model), random trees (random forest), etc.)
    2013-11-02 21:13:57下载
    积分:1
  • bubd
    function [mubnd,var,dc,dr,gcr,grc] = bubd(m,blk,Dinitbnd,Ginitbnd,pmu,diagnose,clevel)
    2015-02-13 17:56:17下载
    积分:1
  • FastICA_23
    fastICA完整matlab代码,有详细fastICA算法代码介绍(fastICA complete matlab code, a detailed description fastICA algorithm code)
    2010-06-03 22:14:02下载
    积分:1
  • WindyGridWorldQLearning
    Q-learning (Watkins, 1989) is a simple way for agents to learn how to act optimally in controlled Markovian domains. It amounts to an incremental method for dynamic programming which imposes limited computational demands. It works by successively improving its evaluations of the quality of particular actions at particular states. This paper presents and proves in detail a convergence theorem for Q,-learning based on that outlined in Watkins (1989). We show that Q-learning converges to the optimum action-values with probability 1 so long as all actions are repeatedly sampled in all states and the action-values are represented discretely. We also sketch extensions to the cases of non-discounted, but absorbing, Markov environments, and where many Q values can be changed each iteration, rather than just one.
    2013-04-19 14:23:35下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载