求解具有自由度的符号方程组 [英] Solving a symbolic equation system with degrees of freedom
本文介绍了求解具有自由度的符号方程组的处理方法,对大家解决问题具有一定的参考价值,需要的朋友们下面随着小编来一起学习吧!
问题描述
我正在尝试解决具有自由度的符号系统.它假设使用参数,但它无法处理一些简单的事情,例如:
I'm trying to solve a symbolic system with degrees of freedom. It supposes to use parameters, but it fails to handle something simple such as:
syms x1 x2 x3 x4 x5 x6 x7 x8 real
con = [
x1 + x2 + x3 + x4 + x5 + x6 + x7 + x8 == 1080
x2 + x3 == 0
x6 + x7 == 0
];
s = solve(con, 'ReturnConditions', 1 ,'PrincipalValue', true)
输出:
Warning: Unable to find explicit solution. For options, see help.
> In solve (line 317)
In testm (line 10)
In run (line 91)
s =
struct with fields:
x1: [0×1 sym]
x2: [0×1 sym]
x3: [0×1 sym]
parameters: [1×0 sym]
conditions: [0×1 sym]
Lucien 的解决方案也适用于此:
Lucien's solution applies to this as well:
推荐答案
也许可以帮到你.
s = solve(con, [x1 x2 x3 x4 x5 x6 x7 x8], 'ReturnConditions', 1 ,'PrincipalValue', true);
这篇关于求解具有自由度的符号方程组的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!
查看全文