weixin_47616793的博客

计算最小二乘法时，对三维的点集用直线拟合。会遇到解冗余的方程AX=b的问题。此时A‘AX=A’b的解法很实用。但是A’A的逆矩阵，编程难。备忘其逻辑结构如下。

\def\MapleOutput#1{{\begin{center}\begin{math}\color{MapleBlue}{#1}\end{math}\end{center}}}你要粘贴过来的maple代码\MapleOutput{a:=0}其中的\color{MapleBlue}删除了也没事。

restart; gg := proc (n) g := Array(1 … n, 1 … n); for k to n do for t to n do if t < k then g[k, t] := p[abs(k-t)] elif k = t then g[k, t] := 1 end if end do end do; g end proc;Warning, g is implicitly declared local to procedure ggWarning, k is impl.

with(combinat); seq(11*numbcomb(10-k, k-1)/k, k = 2 … 5);44, 77, 55, 11\begin{equation}\sum_{k_{1}+2 k_{2}+\ldots+n k_{n}=k} \frac{\left(k_{1}+k_{2}+\ldots+k_{n}-1\right) !}{k_{1} ! k_{2} ! \ldots k_{n} !} s_{1}{k_{1}}\left(-s_{2}\right){k_{2}} \ldots.

a := [7, 30, 77, 156, 275, 442]; b := [7, 9, 11, 13, 15, 17];a.*b;Error, invalid matrix/vector productTypesetting:-mambiguous(aperiodsdot, Typesetting:-merror(invalid matrix/vector product))ba[1];73seq(a[k]/((2k+1)b[k]), k = 1 … 6);1, 2, 3, 4.

with(PolynomialIdeals); vray := 6m2*b*d+10*m4d2+8*m4ec-14m5*d*e+m2c2+17*m6e2-2*m3cd+b2-2*m3be; J := PolynomialIdeal(c-md+4m^2e, b-em3+3*d*m2); Q := PolynomialIdeal((c-md+4m2*e)2, (b-em3+3*d*m2)^2, (c-md+4m2*e)*(b-e*m3+3dm^2)); IdealMembership(vray, Q);tr.

a[k] := seq(x[i]^k, i = 1 … 7);k k k k k k kx[1] , x[2] , x[3] , x[4] , x[5] , x[6] , x[7]b[k] := sum(x[i]^k, i = 1 … 7);k k k k k k kx[1] + x[2] + x[3] + x[4] + x[5] + x[6] + x[.

这里写自定义目录标题