代码搜索结果
找到约 10,000 项符合
6 的代码
examp6_6.m
syms x y;
[x,y]=solve('x^2/2+x+3/2+2/y+5/(2*y^2)+3/x^3=0',...
'y/2+3/(2*x)+1/x^4+5*y^4','x,y');
size(x)
err=[x.^2/2+x+3/2+2./y+5./(2*y.^2)+3./x.^3,y/2+3./(2*x)+1./x.^4+5*y.^4];
norm(double(
fig6_6.m
clear all
taup = 1;
b =20.;
up_down = 1.;
taux = -1.5*taup:.01:1.5*taup;
fd = 0.;
mu = up_down * b / 2. / taup;
ii = 0.;
for tau = -1.5*taup:.01:1.5*taup
ii = ii + 1;
val1 = 1. - abs(t
lind6-6.c
#include
void main()
{
long a,b,c,n;
for(n=100;n
ex6_6.m
A=[-0.2,0.5,0,0,0;0,-0.5,1.6,0,0;0,0,-14.3,85.8,0;
0,0,0,-33.3,100;0,0,0,0,-10];
B=[0; 0; 0; 0; 30]; Q=diag([1,0,0,0,0]); R=1;
C=[1,0,0,0,0]; D=0; [K,P]=lqr(A,B,Q,R)
Ac=A-B*K; step(ss(Ac,B,C
例6_6.cpp
#include
//按层次遍历二叉链表
typedef char elemtype;
struct bitree
{
elemtype data;
bitree *lchild,*rchild;
};
bitree *create()//建立二叉链表
{ bitree *q[100]; //定义q数组作为队列存放二叉链表中结点
listing 6-6.java
import javax.microedition.midlet.*;
import javax.microedition.lcdui.*;
public class CheckBoxes extends MIDlet implements CommandListener
{
private Display display;
private Form form;
priv
bo6-6.cpp
// bo6-6.cpp 二叉树的三叉链表存储(存储结构由c6-7.h定义)的基本操作(21个)
Status InitBiTree(BiPTree &T)
{ // 操作结果: 构造空二叉树T
T=NULL;
return OK;
}
void DestroyBiTree(BiPTree &T)
{ // 初始条件: 二叉树T存在。操作结果: 销毁二叉树