170 Alphabetical Listing
solve()
Catalog >
For polynomial systems, computation time
or memory exhaustion may depend strongly
on the order in which you list solution
variables. If your initial choice exhausts
memory or your patience, try rearranging
the variables in the equations and/or
varOrGuess list.
If you do not include any guesses and if any
equation is non-polynomial in any variable
but all equations are linear in the solution
variables, solve() uses Gaussian elimination
to attempt to determine all real solutions.
If a system is neither polynomial in all of its
variables nor linear in its solution variables,
solve() determines at most one solution
using an approximate iterative method. To
do so, the number of solution variables
must equal the number of equations, and
all other variables in the equations must
simplify to numbers.
To see the entire result, press £ and then
use ¡and¢ to move the cursor.
Each solution variable starts at its guessed
value if there is one; otherwise, it starts at
0.0.
Use guesses to seek additional solutions
one by one. For convergence, a guess may
have to be rather close to a solution.
SortA
Catalog >
SortA List1[, List2] [, List3]...
SortA Vector1[, Vector2] [, Vector3]...
Sorts the elements of the first argument in
ascending order.
If you include additional arguments, sorts
the elements of each so that their new
positions match the new positions of the
elements in the first argument.
All arguments must be names of lists or
vectors. All arguments must have equal
dimensions.
To Next Page
Loading...
Need help?
General
Weight and Dimensions
