I need to formally partial-differentiate a given arbitrary function G(z,w) with respect to two other variables z=z(s,t) w=w(s,t) and then to express the p-th-total-order partial derivatives of z with respect to s and t as a polynomial in the partial derivatives of G with respect to z and w and the partial derivatives of w with respect to s and t, divided by the partial derivative of G with respect to z raised to the power 2p+1. The eliminate function allows me to eliminate all partial derivatives of z w.r.t. s and t of total order lower than p.
I'm try to access some external Fortran routines within maple. I have a Fortran datatype of
This is an input parameter, and I believe this will map into a maple Array object, but I'm not sure of the datatype. The help says that the datatype can only be "hardware datatypes" so I take to mean it would have to be of type integer...when I do this I get the error below.
I'm trying to use maple on a Dell with intel video chipset series 4, on a Fedora 11, and I get corrupted 3d graphics. I read this FAQ http://www.maplesoft.com/support/Faqs/detail.aspx?sid=33530
(point 3) but it seems that no solutions exist.
I'm using the intel driver, this is the sheet of xorg.conf
Does Maple have a command for return true or false when querying set membership of an element?
I have sets of random integers, Stuff[k], indexed by k, for example
I need to be able to test if
7 is a member of Stuff: // I should get false
5 is a member of Stuff: // I should get true
There is no such set membership function listed in the Help menu.
I finally figured out a for loop for sequentially removing one set from another (set-theoretic subtraction).
First of all: I'm so sorry, I posted my question to a wrong place ( into the poll).
So I copy here the question and the answer of jakubi and my reply to jakubi.
I would like to solve the following system
x*(2*sin(x)*y^2+x^3*cos(x)+x*cos(x)*y^2) = y*(2*sin(y)*x^2+y*cos(y)*x^2+y^3*cos(y)),
-x*sin(x) = y*sin(y);
Until I have founded only the solutions
x = k*Pi, y = +/- k*Pi; k is any integer.
I'm having a bit of difficulty with the function "eval" I would like it to perform a full evaluation of an expression, but it does not appear to be doing this. When I try to explicitly pass it a value for the evaluation level it doesn't appear to take the integer input, the only way I can get it to work is to nest calls to eval ...[ie eval(eval(exp))]. Below is the code giving me the problem, the problem occurs on the last line...any suggestions would be appreciated
I am trying to write a program that contains multiple subroutine calls. I understand the placement of the single for-do loop to call the "lowest value" subroutine.
Here is program.
I am trying to generate a non-singular Matrix.
> if Determinant(127,KeyMatrix)=0 then
Basically, it asks Maple to return to
again if the current one if not invertible.
however, i have confused myself with RETURN and return
which is should i use?
Here is a strange behavior. I can understand that an integer and its float could be considered different, but the behavior should be the same in or out of a list. In addition it should not depend on the number of trailing zeros. In addition it should not depend on whether the integer is zero or not.
Recently I came across a page that was working with ifactor and it seems op now handles the operations a bit different now.
I have a fairly easy question but I am new to Maple and can't seem to figure it out w/ Maple help or anyone online resources. The problem is list all pairs of integers between 100 and 110 that are relatively prime. (I think) I can make it work by doing:
for k from 100 by 1 to 110 do gcd(k, 100), gcd(k, 101) . . . ; end do
but what if the problem had said pairs of integers from 100 to 1000? I don't understand how to iterate this function for more than one variable. Any help would be appreciated.
AUTHOR: Fereydoon Shekofte
v := ImportMatrix("F:\\xyz.txt", source = delimited, delimiter = " ", format = rectangular, datatype = float, transpose = false, skiplines = 0)
c := ImportMatrix("F:\\face.txt", source = delimited, delimiter = " ", format = rectangular, datatype = integer, transpose = false, skiplines = 0)
MatrixOptions(mi("format"), 'order = C_order'); mi("format")
f := Array(ArrayTools[Reshape](c[1 .. 3864], 1288, 3), order = C_order)
p := Array([seq(geom3d[point](p || i, v[i, 1], v[i, 2], v[i, 3]), i = 1 .. 1063)])
I have been working on a problem related to and using the famous Hadamard-Weierstrass Factorization Theorem (HWFT) for representing an entire function, E(z), with pre-defined zeroes, a(n), which go off to infinity. From HWFT one can represent any meromorphic function with pre-defined poles and zeroes as the ratio of two entire functions.
I am not interested in creating an entire function, but a function F(z) analytic on a disk centered at a pre-defined point such that the analytic continuation, A(z), of F(z) equals pre-defined values
I was reading the manual for Maple 13 and playing with some commands.
There is an equation: sin(x)=cos(x) and you can solve it by the solve command.
If you want all solutions, you just put there AllSolutions attribute and you get
I wonder why there is a tilde (~) behind "_Z1", because each integer satisfies
the equation (there is no need for an assumption).