Timeline for Solving system of equations involving complex variables
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 15, 2023 at 19:33 | comment | added | Daniel Lichtblau | There are ways to compute Groebner bases using linear algebra. Look up, for example, the F4 method (due to Faugere). | |
| Apr 15, 2023 at 7:50 | comment | added | user64494 | Sorry, your statement "Gaussian elimination e.g. for linear systems is a way to get the GroebnerBasis. It is working without any assumptions" does not correspondent to reality (see, e.g. Wiki). In particular, I'd like to quote "Gröbner basis computation can be seen as a multivariate, non-linear generalization of both Euclid's algorithm for computing polynomial greatest common divisors, and Gaussian elimination for linear systems" . | |
| Apr 15, 2023 at 3:41 | comment | added | Roland F | Gaussian elimination e.g. for linear systems is a way to get the GroebnerBasis. It is working without any assumptions. As always in Mathematica, symbols implicitely are assumed to be complex valued except 0,oo as default. Thats the reason why no simplification on arbitrary powers, logs and arc functions is attempted without explicit assumptions. | |
| Apr 14, 2023 at 18:41 | comment | added | user64494 | If you look in the documentation, you read "Possible settings for CoefficientDomain are InexactNumbers, Rationals, RationalFunctions, and Polynomials[x]". There are no complex numbers there. | |
| Apr 14, 2023 at 17:48 | history | answered | Roland F | CC BY-SA 4.0 |