Need Help with Obtaining individual x-y coordinate...

I am an ophthalmologist and a novice in programing. I am having a problem obtaining the x-y coordinate equations for each of the fitted Splines.  I can send the raw data and MapleSoft work sheet for which I need the individual spline equations, in x-y coodinates not parametric format and also need to be able to plot the splines on the raw data. I will pay for the service. Can you please obtain the x-y Cartesian equations for each of the fitted Splines and give me a step-wise method for obtaining them?  I am unable to attach the raw data and the worksheet to this email.  Please send me your personal email so that I can send them.

With my best,
Ron
Ronald A Schachar MD , PhD
7241 Encelia Drive
La Jolla, CA 92037
Cell: (858) 784-1705
Email: ron@2ras.com

why ModuleCopy requires _self added to reference l...

WHen using _self in object, help says

"As of Maple 2021, if the method has a formal parameter named _self, references
to its object's local or exported variables may be written without prefixing them.
That is, _self:-variable may be written as just variable. Maple will
add the self:- prefix internally when the method is simplified."

And the above is true for all static methods inside an object module, except for ModuleCopy which is also static.

It seems ModuleCopy is special. But why?  I am thinking it is because at time this is called, the object itself does not yet exist, but for all other methods, the object by then is fully constructed. But wanted to be sure.

Here is an example

```restart;

person := module()
option object;
local  m_name::string;
local  m_age::integer;
export ModuleCopy :: static := proc(_self :: person
, proto :: person, name::string, age::integer,\$
)
m_age := age;
m_name := name;
end proc;

export name::static:= proc(_self, \$);
RETURN(m_name); #no need to write _self:-m_name;
end proc;

export age::static:= proc(_self, \$);
RETURN(m_age); #no need to write _self:-m_age;
end proc;

export set_name::static:= proc(_self, name, \$);
m_name := name;   #no need to write _self:-m_name := name
NULL;
end proc;

export process::static:=proc(_self,\$)
print("name is ",m_name," age is ",m_age);
end proc;

end module:
```

And now

```
o:=Object(person,"me",10);

Error, static procedure `ModuleCopy` refers to non-static local or export `m_age::integer` in surrounding scope
```

Changing ModuleCopy to

```export ModuleCopy :: static := proc(_self :: person
, proto :: person, name::string, age::integer,\$
)
_self:-m_age := age;
_self:-m_name := name;
end proc;
```

Now there is no error. But notice that in all other static methods, I can write  m_name directly without using _self:-m_name;

I looked at help page for ModuleCopy but see no mention of this.

Why ModuleCopy is different?

Maple 2023.2 on windows 10

Inline equaitons...

Can you generate equation numbers for inline equations?

Isolating Components of a Cylindical type Vector...

Folks,

What is the simplist Maple code needed to isolate a vector that has two components?  See below:

Vector[column](2, [25.00000000*pi*r/(r^2 + z^2), 25.00000000*pi*z/(r^2 + z^2)])

I want to get the magnitude of this vector which is simply the square root of the sum of the squares of the individual components as shown above.

How do I do that?

Chris

How do I substitute the base of an ifactor result?...

I wish to substitute only the base of the  expression like the following

 (1)

 (2)

 (3)

I wish my results to be

 (4)

such that

 (5)

 (6)

If there a way to do that? I understand that there is a command  which gives me more control, but the form of the result is rather inconvenient. I hope there is a more direct way to do the aforementioned operation.

In Maple 2023 I haven't been able to sign in to the Maple Cloud.
In Maple 2022 there was no problem. In fact in my Maple 2022.2 I'm actually signed in right now.

The toolbar in 2023.2 has a grayed out icon saying "Sign in". Nothing happens if I click on it.

PS. I'm also signed in right now to Maple 2021.2. So the problem couldn't be that I cannot be logged in to more than one Maple release.

Why does MmaTranslator:-Mma:-PolynomialReduce not ...

According to the documentation of `MmaTranslator:-Mma:-PolynomialReduce`, this command yields . However,

```restart;
MmaTranslator:-Mma:-PolynomialReduce(x**2+y**2,{x-y,y+a});
=
[         2    2]
[[0, 0], x  + y ]

```
```In[1]:= PolynomialReduce[x^2+y^2,{x-y,y+a}](*Mathematica*)

Out[1]= {{x + y, -2 a + 2 y}, 2 a^2}```

The output of both is the same as that of Mma; only the result given by Maple is inconsistent with Mathematica's.

The example above is so simple that the desired result can be found simply by hand. Here is a larger example:
Given two polynomials .txt and .txt, as well as a list of polynomials .txt, I would like to evaluate

```# Suppose that one has downloaded these three files.
poly1, poly2 := fscanf("poly1.txt", "%a")[], fscanf("poly2.txt", "%a")[]:
MmaTranslator:-Mma:-PolynomialReduce((a - poly1)*(a - poly2), pList);```

But its result is just “[[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], ]”, while when a＝0 it should be “[[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 2, 1, 1, 1, 1, 0, 0, 0, 1, 2, 1, 0, 2, 2, 3, 1, 1, 1, 2, 1, 0, 0, 0, 1, 1, 2, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0], 0]”.
So why does  return a distinct value?

Solving for a product of two terms....

How would I solve for the product of two terms ( s*V or s^2*V). This is a simple example but I would be applying this on much higher order equations.

V = Vx/(a*s^2 + b*s + c)

How to reset a default variable name?...

Hi:

I am using solve(...,allsolutions)

and Maple is giving me the default "_Z1~" as part of the solution. No problem.

But when I go back and run the same statement again without a restart, it gives me "_Z2~" and my program fails because it is looking to substitute a value for "_Z1".

How do I reset the naming convention without restarting so I can get the same output each time I run the same statement. (BTW: The same thing happens with Veil where it increments the indices of the Veil symbol each time you run the same statement)..

Thank you.

why solution changes when using dsolve with couple...

I am really confused by this behavior. Should the solution be different when calling dsolve(ode) vs. dsolve(ode,[x(t),y(t)]) where here ode is list of two coupled first order ode's?

Maple shows the solutions in reverse order in one case vs. the other. I do not see why adding [x(t),y(t)] should make x(t) solution now y(t)'s and y(t) solution now x(t)'s.  Here is an example

Here is worksheet. I just find the out changing very confusing. Should not the same solution for x(t) and y(t) remain the same regardless of adding the second option as list of not? What is the logic behaind this change or order, and how it one to know which is the correct one as they look different.

 > interface(version);

 > Physics:-Version();

 > restart;

 > ode :=[diff(x(t), t) = (3*x(t))/2 + 2*y(t), diff(y(t), t) = x(t)/2 + y(t)]

 > simplify(dsolve(ode,[x(t),y(t)]));

 > simplify(dsolve(ode));

 > #when using SET instead of LIST, then same solutions come out as above simplify(dsolve(ode,{x(t),y(t)}));

 >

How to get mouse position...

I want to creat an interactive document for students. When user clicks in a coordinate-system a point shall come up. For this I need the relative (or absolute) coordinates of the actual mouse position. I cannot find the command for this. In other languages it is like getmousex, getmousey. Can anyone help, please?

Is there an "easy" way to extend Maple's standard ...

As a part of my learning curve, I am trying to play with extending Maple's BernsteinBasis, which has only a limited support right now (BernsteinBasis - Maple Help (maplesoft.com)).

My goal is to implement basis operation on polynomials in Bernstein basis, so that derivatives, integrals and products of polynomials in  BernsteinBasis would be again expressed in BernsteinBasis.

While it looks like it is relatively easy to extend diff procedure, by using `diff/BernsteinBasis`, I didn't find anything similar for the int. Is there something like `int/BernsteinBasis`?

The problem is that when I am trying to implement my own int procedure in a module that  would extend standard int, it seems I need to manually implement logic for (at very least) linearity, so that int(p(x) + q(x), x) would decay into int(p(x), x) + int(q(x), x ) (I probably don't need more complex rewriting rules). So before trying this approach, is there any easy way such as with diff?

 > restart;
 (1)
 > # General formula diff(BernsteinBasis(k, n, a, b, x), x);
 (2)
 > # In expressions diff(2*x*BernsteinBasis(1, 2, 0, 1, x) + BernsteinBasis(2, 2, 0, 1, x), x);
 (3)
 > # Convertion to MatrixPolynomialObject works p := diff(BernsteinBasis(1, 2, 0, 1, x) + BernsteinBasis(2, 2, 0, 1, x), x); P := convert(p, MatrixPolynomialObject, x); P:-Value(a);
 (4)

# Now, integrataion
with(BernsteinPolynomials);

 (5)
 > # Still works int(x^2, x);
 (6)
 > # Not implemented but will be added later... int(BernsteinBasis(1, 2, 0, 1, x), x);
 (7)
 > # This is the problem: how to implement basis properties such as linearity? int(2 * BernsteinBasis(1, 2, 0, 1, x), x);
 (8)
 >

```BernsteinPolynomials := module()
description "Basic operations in Bernstein basis";
option package;
global BernsteinBasis, `diff/BernsteinBasis`;
export int;

BernsteinBasis := proc(k, n, a, b, x)
description "Bernstein basis polynomial";
if k::numeric then
if k < 0 then
return 0;
end if
end if;
if n::numeric then
if n < 0 then
return 0;
end if;
if k::numeric then
if k > n then
return 0;
end if;
end if;
end if;
'procname'(_passed)
end proc;

`diff/BernsteinBasis` := proc()
description "Derivative of the Bernstein basis polynomial in the Bernstein basis";
if _npassed = 6 then
if _passed[-1] = _passed[-2] then
_passed[2] * BernsteinBasis(_passed[1] - 1, _passed[2] - 1, _passed[3], _passed[4], _passed[5]) / (_passed[4] - _passed[3]) -
_passed[2] * BernsteinBasis(_passed[1], _passed[2] - 1, _passed[3], _passed[4], _passed[5]) / (_passed[4] - _passed[3]);
end if;
end if;
end proc;

int := proc()
description "Integral of the Bernstein basis polynomial in the Bernstein basis";
if type(_passed[1], 'specfunc'(anything, BernsteinBasis)) then
print("Will be implemented here...");
end if;
:-int(_passed)
end proc;

end module;
```

error from allvalues. Is this to be expected? igcd...

In my code, without knowing what the expression is, other than it has RootOf, the code called allvalues and got internal error

Error, (in SolveTools:-Basis) invalid input: igcd received 5/7, which is not valid for its 2nd argument

Is this to be expected depending on the input, or is this some internal problem I need to report?

```restart;
expr:=RootOf(R^4*b+R^2*a*_Z+2*_Z^2-exp(RootOf(tanh(1/2*(a^2-8*b)^(1/2)*(4*S-_Z)/a)^2*R^4*a^2-8*tanh(1/2*(a^2-8*b)^(1/2)*(4*S-_Z)/a)^2*R^4*b-R^4*a^2+8*R^4*b-8*exp(_Z))))

allvalues(expr)
```

Error, (in SolveTools:-Basis) invalid input: igcd received 5/7, which is not valid for its 2nd argument

Maple 2023.2 on windows 10

ps.  Reported to Maplesoft

General `convert/elsymfun` like SymPy's “symmetriz...

In an old question, @mbras asked for a "partial" ``convert/elsymfun``. However, SymPy's `sympy.polys.rings.PolyElement.symmetrize` seems to provide more examples that cannot be handled by the program that appeared in that question.
For instance,

```>>> from sympy import var
>>> var('x:z,p:r')
(x, y, z, p, q, r)
>>> from sympy.polys.polyfuncs import symmetrize
>>> symmetrize(x**2-(y**2+2**z),[y,x],formal=True,symbols=[p+p,q*q])[0]
-2**z - 4*p**2 + 2*q**2
>>> symmetrize(x*x*y+y*y*z+z*z*x,[y,x,z],formal=True,symbols=[p,q,r])
(0, x**2*y + x*z**2 + y**2*z, [(p, x + y + z), (q, x*y + x*z + y*z), (r, x*y*z)])```

Though I can , can't the built-in  be generalized to such expressions (in other words, write the polynomial part of input as a symmetric part and a remainder with (named, if need be) elementary symmetric polynomials)?

Besides, since any symmetric polynomial can also be expressed in terms of the complete symmetric polynomials, is there a similar  command in Maple?

why infolevel stops working second time on some od...

I wonder if this a bug or Am I overlooking something?

I set infolevel[dsolve]:=5; and first time calling dsolve(ode), it works as expected. It prints on the screen the trace and steps it did.  But when I repeat the command dsolve, now it only prints one line and the rest of info that were printed before no longer show.

Should not the same information be printed each time? This is what happens on another example I tried. It seems infolevel does not work the same depending on the ode being solved?  Here is a worksheet attached to show the above.

Is there a workaround to make it display same information each time?

Maple 2023.2 on windows 10.

 >
 > restart;

 > interface(version);

 > ode:=[2*diff(x(t),t)+diff(y(t),t)=x(t)+y(t)+t,diff(x(t),t)+diff(y(t),t)=2*x(t)+3*y(t)+exp(t)]; infolevel[dsolve]:=5; dsolve(ode);

-> Solving each unknown as a function of the next ones using the order: [y(t), x(t)]

-> Calling odsolve with the ODE diff(diff(y(x) x) x) = 4*(diff(y(x) x))-y(x)-3*x+1 y(x) singsol = none

Methods for second order ODEs:

--- Trying classification methods ---

trying high order exact linear fully integrable

trying differential order: 2; linear nonhomogeneous with symmetry [0,1]

trying a double symmetry of the form [xi=0, eta=F(x)]

-> Try solving first the homogeneous part of the ODE

checking if the LODE has constant coefficients

<- constant coefficients successful

-> Determining now a particular solution to the non-homogeneous ODE

trying a rational particular solution

<- rational particular solution successful

<- solving first the homogeneous part of the ODE successful

 > dsolve(ode);

-> Solving each unknown as a function of the next ones using the order: [y(t), x(t)]

 > infolevel[dsolve]:=5;

 > dsolve(ode);

-> Solving each unknown as a function of the next ones using the order: [y(t), x(t)]

 > dsolve(ode);

-> Solving each unknown as a function of the next ones using the order: [y(t), x(t)]

 > ode:=diff(y(x),x\$2)+y(x)=sin(x); dsolve(ode);

Methods for second order ODEs:

--- Trying classification methods ---

trying high order exact linear fully integrable

trying differential order: 2; linear nonhomogeneous with symmetry [0,1]

trying a double symmetry of the form [xi=0, eta=F(x)]

-> Try solving first the homogeneous part of the ODE

checking if the LODE has constant coefficients

<- constant coefficients successful

-> Determining now a particular solution to the non-homogeneous ODE

building a particular solution using variation of parameters

<- solving first the homogeneous part of the ODE successful

 > dsolve(ode);

Methods for second order ODEs:

--- Trying classification methods ---

trying high order exact linear fully integrable

trying differential order: 2; linear nonhomogeneous with symmetry [0,1]

trying a double symmetry of the form [xi=0, eta=F(x)]

-> Try solving first the homogeneous part of the ODE

checking if the LODE has constant coefficients

<- constant coefficients successful

-> Determining now a particular solution to the non-homogeneous ODE

building a particular solution using variation of parameters

<- solving first the homogeneous part of the ODE successful

 >

On a side note. the first line of the display is hard to read. Any one know what it is supposed to mean by the space between the 1 and y(x) at the end there?

Another example where infolevel changes on second call to dsolve: The first call gives more information which is lost in the second call. There does not seem to be a way to fix this at user level.

 > restart;

 > ode:=diff(y(x),x)+(a*x+y(x))*y(x)^2=0: infolevel[dsolve]:=5: dsolve(ode)

Methods for first order ODEs:

--- Trying classification methods ---

trying 1st order linear

trying Bernoulli

trying separable

trying inverse linear

trying homogeneous types:

trying Chini

differential order: 1; looking for linear symmetries

trying exact

trying Abel

The relative invariant s3 is: -1/27*a*(2*a^2*x^3-9)

The first absolute invariant s5^3/s3^5 is: 729*a^4*x^6*(2*a^2*x^3-15)^3/(2*a^2*x^3-9)^5

The second absolute invariant s3*s7/s5^2 is: 5/3/a^2*(2*a^2*x^3-9)/x^3*(2*a^4*x^6-21*a^2*x^3+18)/(2*a^2*x^3-15)^2

...checking Abel class AIL (45)

...checking Abel class AIL (310)

...checking Abel class AIR (36)

inverse of the transformation solving the problem is: {t = 1/2*(-2*a^2)^(1/3)*x, u(t) = -(-2*a^2)^(1/3)/a*y(x)}

<- Abel successful

 > dsolve(ode)

Methods for first order ODEs:

--- Trying classification methods ---

trying 1st order linear

trying Bernoulli

trying separable

trying inverse linear

trying homogeneous types:

trying Chini

differential order: 1; looking for linear symmetries

trying exact

trying Abel

<- Abel successful

 >