什么算法解决C＃中的任何方程系统？

本文介绍了什么算法解决C＃中的任何方程系统？的处理方法，对大家解决问题具有一定的参考价值，需要的朋友们下面随着小编来一起学习吧！ 问题描述

我有一个多变量的方程系统，如： f1（x1，x2，x3，...，xn）= 0 f2（x1 ，x2，x3，...，xn）= 0 ..... fn（x1，x2，x3，...，xn）= 0 那里，f1，f2，...，fn是x1，x2，...，xn的函数，它们是参数（方程式的变量）。 我想通过C＃解决这个系统，解决它的算法是什么？谢谢。

I have an equation system with multi-variable, as: f1(x1, x2, x3,..., xn)=0 f2(x1, x2, x3,..., xn)=0 ..... fn(x1, x2, x3,..., xn)=0 There, f1, f2,..., fn are functions with x1, x2,..., xn which are parameters (variables of the equation system). I want to solve this system by C#, what algorithm to solve it? Thanks.

推荐答案

请看我对这个问题的评论：它转变为一个非常棘手的问题。没有一种常见的算法;算法将取决于函数类，仅适用于某些类别的函数，并且，在一般情况下，甚至解决方案的概念也无法在数学上定义。 你可以在这里开始： en.wikipedia/wiki /List_of_numerical_libraries#.NET_Framework_languages_C.23.2C_F.23_and_VB.NET [ ^ ]。

-SA

Please see my comment to the question: it my turn into a really difficult problem. There is no one common algorithm; the algorithm would depend on the class of functions, applicable only to certain classed of functions, and, in general case, even the notion of the solution cannot be mathematically defined. You can start, say, here: en.wikipedia/wiki/List_of_numerical_libraries#.NET_Framework_languages_C.23.2C_F.23_and_VB.NET[^].

—SA

除了谢尔盖之外，您可能会发现阅读标题为数字食谱在CISBN 0-521-43108-5的书可能会帮助您找到系数值的方法。在Google上搜索这本书，我不会发布链接，因为很多链接都是盗版版本。 你会发现这是一个非常困难的编程领域，如果你不关心解决方程需要多长时间，那么你不应该有太多问题，但我最近研究了一个时间受限的最小化求解器（必须在100ms或更短的时间内解决）对于比你复杂得多的方程式。我们最终走向了另一个方向，因为MP-LP求解器在我们的目标设备上花了太长时间。 In addition to Sergey, you may find that reading the book titled "Numerical Recipes in C" ISBN 0-521-43108-5 may help you with methods to find the values of the coefficients. Search for the book on Google, I won't post the link because a lot of the links are bootleg versions. You will find though that this is a very difficult area of programming, if you aren't concerned about how long it takes to solve your equations then you shouldn't have too many problems but I recently worked on a minimization solver that was constrained for time (had to solve in 100ms or less) for equations that are much more complicated than you have. We ended up going a different direction because an MP-LP solver took too long on our target equipment.