早教吧作业答案频道 -->其他-->
matlabsimulink仿真出错,求高手解答!solveconfiguration高亮,显示错误如下,求高手帮助,不胜感激!NotenoughinputderivativeswereprovidedforoneormoreSimulink-PSConverterblocksassociatedwiththehighlighted
题目详情
matlab simulink仿真出错,求高手解答!
solve configuration 高亮,显示错误如下,求高手帮助,不胜感激!Not enough input derivatives were provided for one or more Simulink-PS Converter blocks associated with the highlighted Solver Configuration block, for the solver chosen. Implicit solvers (ode23t, ode15s, and ode14x) typically require fewer input derivatives than explicit solvers, and local solvers never require any. You can provide more input derivatives by selecting different options (including turning input filtering on or increasing the number of user-provided input derivatives) on the Input Handling tab of Simulink-PS Converter blocks linked below:
...'newdoublesynch/Brake/Input torque/Simulink-PS Converter' (2 required, 0 provided)
...'newdoublesynch/Motor zhhuanju /Simulink-PS Converter' (2 required, 0 provided)
solve configuration 高亮,显示错误如下,求高手帮助,不胜感激!Not enough input derivatives were provided for one or more Simulink-PS Converter blocks associated with the highlighted Solver Configuration block, for the solver chosen. Implicit solvers (ode23t, ode15s, and ode14x) typically require fewer input derivatives than explicit solvers, and local solvers never require any. You can provide more input derivatives by selecting different options (including turning input filtering on or increasing the number of user-provided input derivatives) on the Input Handling tab of Simulink-PS Converter blocks linked below:
...'newdoublesynch/Brake/Input torque/Simulink-PS Converter' (2 required, 0 provided)
...'newdoublesynch/Motor zhhuanju /Simulink-PS Converter' (2 required, 0 provided)
▼优质解答
答案和解析
你是不是用了simMechanics库啊,那就按照要求改下求解器ode23t
这是系统本身的求解的问题
这是系统本身的求解的问题
看了 matlabsimulink...的网友还看了以下:
用所给字母拼成单词.1.a,l,a,d,s.2.a,d,o,s.3.c,o,r,p,n用所给字母拼 2020-05-15 …
A.O(1),O(1)B.O(n),O(1)C.O(n2),O(1)D.O(n),O(n) 2020-05-26 …
若某共价化合物分子中只含有C、H、O、N四种元素,且以n(C)、n(N)、n(O)分别表示C、N、 2020-07-20 …
求给以下算法复杂度排序增长速度由慢到快1)O(n^(3/4))O(log(n)^5)O(2^n)O 2020-07-23 …
设算法的计算时间可用递推关系式T(n)=2T(n/2)+n表示,则该算法的时间复杂度为()A:O( 2020-08-01 …
数据结构的问题6.程序段For(i=n-1;i>0;i--)For(j=1;ja[j+1])a[j] 2020-10-30 …
设A都是n(n>3)阶方阵,且A^2=0,结论错误的是设A都是n(n>3)阶方阵,且A^2=0,则错 2020-11-02 …
程序段for(i=n-1;i>=0;i--)for(j=1;jA[j+1]A[j]与A[j+1]对换 2020-11-26 …
已知两个长度分别为m和n的升序链表若将它们合并为一个长度为m+n的降序链表,则最坏情况下的时间复杂度 2020-11-28 …
下列四种算法的时间复杂度中,执行时间最短.A.O(n)B.O(log2n)C.O(2n)D.O(n2 2020-12-15 …