I'm trying to do some symbolic / algebraic calculations in wxMaxima. But I'm having syntax problems.
Question. Let 'n' and 'm' be previously stipulated. What is the syntax / 'command line', as well as a suitable recursive procedure, to define an 'A (i, j, k)' function of three integer variables 'i', 'j', and 'k' in the wxMaxima language ?
I would like the variables 'i' and 'j' to cycle through all integers from '1' to 'n'. And let the variable 'k' span all integers from '0' to 'm'.
The goal is to use the outputs 'A (k) (i, j)' as symbolic variables for agronomic calculations.
Update 11/08/2016 14h21 (UTC-3)
My main area of expertise is theoretical mathematics. I have some experience with algorithms structured at theoretical level and very little familiarity with programming languages, compilers and their respective interfaces. So I apologize if this question is too easy or does not fit the Stackoverflow perspective.
My attempts can be downloaded from the following links: teste4 and teste3 .
Update 09/08/2016 9:30 AM (UTC-3) . Being a bit more detailed with what I mean by algebraic / symbolic calculation. I have a total of symbols (of all products n m symbols) of symbolic variables 'A (k) (ij)' indexed by 'i', 'j' and 'k' with the property that A (k) (i, j) = A (k) (j, i). In an explicit way:
If k = 1 we have the symmetric matrix A (1) of order nxn with sibotic inputs A (1) (i, j);
(1) (1) (1) (1.2), A (1) (1.3), ..., A (1) (1, n) p> (2), A (1) (2.2), A (1) (2.3), ..., A (1) (2, n) p> A (1) (3), A (1) (3,2), A (1) (3,3), ..., A (1) (3, n) p>| .............................................. ..................... |
(1, n), A (1) (2, n), A (1) (3, n), ..., A (1) (n, n) p>If k = 2 we have the matrix A (2) of order nxn with sibotic inputs A (2) (i, j);
A (2) (1), A (2) (1,2), A (2) (1.3), ..., A (2) (1, n) p> (2) (2) (2) (2.2), A (2) (2.3), ..., A (2) (2, n) p> A (2) (3), A (2) (3,2), A (2) (3,3), ..., A (2) (3, n) p>| .............................................. ....................... |
A (2) (n, 1), A (2) (n, 2), A (2) (n, 3) ..., A (2) (n, n) >And so on until we arrive at the matrix A (m) of order nxn with sibotic inputs A (m) (i, j);
A (m) (1.1), A (m) (1.2), A (m) (1.3), ..., A (m) (1, n) p> A (m) (2), A (m) (2), A (m) p> (3), A (m) (3), A (m) (3), A (m) p>| .............................................. ...................... |
(n, n), A (m) (n), A (m) (n) p>
I searched for various tutorials on the internet without success.
I hope I have achieved the clarity necessary for an objective response.