Advanced Search

MaplePrimes Questions

invalid input: simplify/Jacobi/JacobiDN expects it...

Asked by: nm 8552
simplify jacobi incomplete-question
May 25 2023
1  1

I am not able to make a MWE for this error, as it only shows in the debugger. So it seems Maple internal memory changes or some other library is loaded to cause this. Inside the debugger, I get to a function which does this

DBG> simplify(JacobiDN(x,k)^2*n)

Error, invalid input: simplify/Jacobi/JacobiDN expects its 1st argument, k, to be of type posint, but received 0

Version 2023 on windows 10

In a worksheet, the above works just fine

restart;
simplify(JacobiDN(x,k)^2*n)

Back to the debugger, if I write (2*n) instead of 2*n, then the error goes away

DBG> simplify(JacobiDN(x,k)^(2*n))
JacobiDN(x,k)^(2*n)

The values of x,k,n are all symbols and have no values in the code running:

I have no idea why this happend when I run the code only. It think x is zero in the above for some reason.

Sorry can't make MWE, I wish I can. Something strange happens when I run the code that does not show otherwise. 

Any suggestions how to invetigate this more? Stepping into the simplify code it fails in

DBG> next
`simplify/check_constant`:
   3   return type(r,'And(constant,Or(Not(function),satisfies(f -> evalb(op(f)
         <> NULL))))')

DBG> r
JacobiDN(x,k)^2*n^2

DBG> type(r,'And(constant,Or(Not(function),satisfies(f -> evalb(op(f)          <> NULL))))')
false

DBG> step
`simplify/Jacobi`
`simplify/do`:
  84               userinfo(1,simplify,'applying',new_simp,
                     `function to expression`);

 85               new_r := new_simp(r,symb_mode);  

Here it generate the error.

It has nothing to do with simplify. Here is a call to integrate which gives same error

DBG> lhs(ode)
diff(diff(xi(x),x),x)-k^2*JacobiSN(x,k)*JacobiCN(x,k)/JacobiDN(x,k)*diff(xi(x),x)+(-k^2*JacobiCN(x,k)^2+k^2*JacobiSN(x,k)^2-k^4*JacobiSN(x,k)^2*JacobiCN(x,k)^2/JacobiDN(x,k)^2-JacobiSN(x,k)^2*k^2*n^2+n^2)*xi(x)

DBG> int(lhs(ode),x)
Error, invalid input: simplify/Jacobi/JacobiDN expects its 1st argument, k, to be of type posint, but received 0

DBG> x
x

DBG> k
k

DBG> xi(x)
xi(x)

 

Why do I get this sequence returned from alias and...

Asked by: C_R 1960
alias
May 25 2023
1  4 
alias(b = JacobiCN(sqrt(2)*sqrt(x), sqrt(2)*_Z/2)^2);
                          lessthan, b

I could not find an explanation on the help page.

I would have expected simply b as the return value.

Update:
A worksheet that generates the output


 

RootOf(JacobiCN(sqrt(2)*sqrt(x), (1/2)*sqrt(2)*_Z)^2*_Z^2+_Z^2-2)

RootOf(JacobiCN(2^(1/2)*x^(1/2), (1/2)*2^(1/2)*_Z)^2*_Z^2+_Z^2-2)

 (1)

plot(RootOf(JacobiCN(2^(1/2)*x^(1/2), (1/2)*2^(1/2)*_Z)^2*_Z^2+_Z^2-2), x = 0 .. 5)

  

convert(JacobiCN(sqrt(2)*sqrt(x), (1/2)*sqrt(2)*_Z)^2, Elliptic_related)

1-JacobiSN(2^(1/2)*x^(1/2), (1/2)*2^(1/2)*_Z)^2

 (2)

convert(RootOf(JacobiCN(2^(1/2)*x^(1/2), (1/2)*2^(1/2)*_Z)^2*_Z^2+_Z^2-2), Elliptic_related)

RootOf(JacobiSN(2^(1/2)*x^(1/2), (1/2)*2^(1/2)*_Z)^2*_Z^2-2*_Z^2+2)

 (3)

alias(b = JacobiSN(sqrt(2)*sqrt(x), (1/2)*sqrt(2)*_Z))

lessthan, b

 (4)

``

Download alias_with_lessthan_output.mw

How to solve this one?...

Asked by: Harry Xu 20
differentiation homework do-my-homework-for-me
May 25 2023
0  3

geometry:-projection, :-ParallelLine on segment...

Asked by: Anthrazit 750
projection geometry parallelline
May 24 2023
0  2

Apparently functions working on lines do not work on segments.

I can't see any logical explanation why that should be so.

Please consider expanding functionality in future Maple versions.

segprojection.mw

Question about the Maplesim version that created a...

Asked by: C_R 1960
May 24 2023
0  2

Is there a way to determine the version of MapleSim used to create a model from the model file or within MapleSim when an older model was loaded?

Windows 11 and Maple 2020...

Asked by: dagbo 5
windows11
May 24 2023
1  2

Hei

Vet noen om Windows 11 støtter Maple 2020? Eller støttes det bare av Windows 10.

Difference between seq(f,n) and seq(f,1..n)?...

Asked by: sursumCorda 922
seq
May 24 2023
0  4

If I understand right, the form  is equivalent to  (where the optional index variable is omitted), which produces a sequence of n occurrences of y. But how to explain the following output (of p1())? 

> 

restart;
> 

kernelopts(version)

`Maple 2023.0, X86 64 WINDOWS, Mar 06 2023, Build ID 1689885`

 (1)
> 

p0 := proc()
    local a := 1, b := 2;
    seq('assign(('a', 'b') = (a + 1, 2*b))', 1 .. 3);
    print(a, b)
end:
> 

p1 := proc()
    local a := 1, b := 2;
    seq('assign(('a', 'b') = (a + 1, 2*b))', 3);
    print(a, b)
end:
> 

p2 := proc()
    local a := 1, b := 2;
    'assign(('a', 'b') = (a + 1, 2*b))' $ 3;
    print(a, b)
end:
> 

p3 := proc()
    local a := 1, b := 2;
    to 3 do
        assign(('a', 'b') = (a + 1, 2*b))
    od;
    print(a, b)
end:
> 

p0()
> 

p1()
> 

p2()
> 

p3()

4, 16

  

5, 32

  

4, 16

  

4, 16

 (2)


Download singular_behaviour_of_`seq`.mw

Main code: 

p1 := proc()
    local a := 1, b := 2;
    seq('assign(('a', 'b') = (a + 1, 2*b))', 3);
    print(a, b)
end:
p1():

How to reach a polynomial?...

Asked by: delvin 35
degree
May 24 2023
0  17

How can an equation containing a logarithmic function be converted into a polynomial?

Setting spacetime indices 0,1,2,3 instead of 1,2,3...

Asked by: Jamie128 165
physics
May 23 2023
2  1

Is there a way in the physics package to get my index to run from 0 to 3 instead of 1 to 4/0?

How to plot and dualaxisplot from a loop?...

Asked by: MaPal93 90
dualaxisplot arrayplot plotting
May 23 2023
1  12

Hi,

I have a data structure/plotting question. How do I plot the 3 lambdas (singleaxis) and the 6 betas (dualaxis) for 12 calibrations (1000 runs each)? All the details are in the script 230523_different-calibrations.mw. Thank you!

For the beta plots and subplots, please follow the dualaxis example output format at the bottom of my script for each of the 12 calibrations.

For the lambda plots, I'd like to combine a few of them as follows (each plot with lambda_1 subplot, lambda_2 subplot, and lambda_3 subplot - note that the lambda plot example at the bottom of the script is dualaxis but I just need singleaxis):

PLOT 1 (singleaxis): lambda_1, _2, _3 for ncal2 and ncal3 (superimposed, 2 data series for each subplot)

PLOT 2 (singleaxis):  lambda_1, _2, _3 for ncal7 and ncal8 (superimposed, 2 data series for each subplot)

PLOT 3 (singleaxis):  lambda_1, _2, _3 for ncal4, ncal5, ncal6 (superimposed, 3 data series for each subplot)

PLOT 4 (singleaxis):  lambda_1, _2, _3 for ncal9, ncal10, ncal11 (superimposed, 3 data series for each subplot)

matrix equation ...

Asked by: yangtheary 215
linear-algebra characteristic_polynomial
May 23 2023
0  1

how to do loop with 2 formula...

Asked by: syahirah rahimi 15
do-loop duplicate-question
May 23 2023
1  2


there’s few redundant values. I just want the positive values. How it can be done?

> 

restart
> 

NULL
> 

n := [80, 79, 83, 84, 83, 83, 81, 85, 86, 86, 83, 82, 83, 84, 81, 80, 83, 79, 82, 81, 85]

[80, 79, 83, 84, 83, 83, 81, 85, 86, 86, 83, 82, 83, 84, 81, 80, 83, 79, 82, 81, 85]

 (1)
> 

``
> 

nops(n)

21

 (2)
> 

for i from 3 to 17 do f[i] := n[i-2]-3*n[i-1]+3*n[i]; i = i+1; f[i+1] := n[i-2]+4*n[i-1]-6*n[i]+n[i+1] end do

92

  

3 = 4

  

-18

  

82

  

4 = 5

  

-10

  

80

  

5 = 6

  

4

  

84

  

6 = 7

  

-1

  

77

  

7 = 8

  

14

  

95

  

8 = 9

  

-17

  

84

  

9 = 10

  

-9

  

85

  

10 = 11

  

-4

  

77

  

11 = 12

  

14

  

83

  

12 = 13

  

9

  

86

  

13 = 14

  

-3

  

85

  

14 = 15

  

-9

  

74

  

15 = 16

  

13

  

81

  

16 = 17

  

11

  

90

  

17 = 18

  

-18

 (3)
> 

``
> 

NULL


 

Download fyp_2.mw

How to create Random question with Grading Package...

Asked by: jalal 380
grading
May 22 2023
0  11

Hi,

I am exploring the Grading package in Maple, and I want to create a random question about limits. (Question 9). Any ideas for the correct code? Thank you

QUIZZTestMaple.mw

seq slower than proc ...

Asked by: Harry Garst 229
performance programming linear-algebra
May 22 2023
1  5

I learned about Dodgson calculation of the determinant only recently (https://en.m.wikipedia.org/wiki/Dodgson_condensation).
I am only interested in symbolic expressions of the determinant.
Furthermore, I compared several methods. Not surprisingly, the build in method is the fastest. But why is the seq method slower than the proc method for the Dodgson method? Is there anything I could do to program it more efficiently?
 

> 

restart; with(LinearAlgebra)
> 

with(combinat); with(GroupTheory)
> 

DetDef := proc (A) local i, n, sigma; description "Jeremy Johnson. Downloaded from https://www.cs.drexel.edu/~jjohnson/2016-17/winter/cs300/lectures/determinant.mw"; n := RowDimension(A); add(PermParity(Perm(sigma))*mul(A[i, sigma[i]], i = 1 .. n), `in`(sigma, permute([`$`(1 .. n)]))) end proc
> 

InnerMatrix := proc (M::Matrix) SubMatrix(M, 2 .. RowDimension(M)-1, 2 .. ColumnDimension(M)-1) end proc
> 

MatrixDet := proc (M::Matrix) local C, n, i, j; n := RowDimension(M)-1; C := Matrix(n, n); seq(seq(assign('C[i, j]', Determinant(M([i, i+1], [j, j+1]))), j = 1 .. n), i = 1 .. n); return C end proc
> 

Dodgson := proc(M::Matrix)
 MatrixDet(M);
InnerMatrix(M) ^~ (-1) *~ MatrixDet(MatrixDet(M));
do if 1 < RowDimension(%) then InnerMatrix(`%%`) ^~ (-1) *~ MatrixDet(%);
end if;
until RowDimension(%) = 1;
Trace(%):
end proc:
> 

Dodgsonseq := proc (E::Matrix) local w, dim, Z; dim := RowDimension(E); Z[dim] := E; Z[dim-1] := MatrixDet(E); Z[dim-2] := `~`[`*`](`~`[`^`](InnerMatrix(E), -1), MatrixDet(MatrixDet(E))); seq(assign('Z[w-1]', `~`[`*`](`~`[`^`](InnerMatrix(Z[w+1]), -1), MatrixDet(Z[w]))), w = dim-1 .. 1, -1); Trace(Z[1]) end proc
> 

LaPlace := proc (M::Matrix) local c; add((-1)^(c+1)*M[1, c]*Minor(M, 1, c), c = 1 .. ColumnDimension(M)) end proc
> 

dim := 7; A := Matrix(dim, dim, shape = symmetric, symbol = a)

7

 (1)
> 

start_time := time(); st := time[real](); Det1 := abs(A); CPUtime_used_Build_in_Determinant := time()-start_time; REALtime_used_Build_in_Determinant := time[real]()-st; start_time := time(); st := time[real](); Det2 := DetDef(A); CPUtime_used_Jeremy_Johnson_Determinant := time()-start_time; REALtime_used_Jeremy_Johnson_Determinant := time[real]()-st; start_time := time(); st := time[real](); Det3 := Dodgsonseq(A); CPUtime_usedDodgsonseq := time()-start_time; REALCPUtime_usedDodgsonseq := time[real]()-st; start_time := time(); st := time[real](); Det4 := Dodgson(A); CPUtime_usedDodgson := time()-start_time; REALtime_usedDodgson := time[real]()-st; start_time := time(); st := time[real](); Det5 := LaPlace(A); CPUtime_usedLaPlace := time()-start_time; REALtime_usedLaPlace := time[real]()-st; simplify(Det1-Det2); simplify(Det1-Det3); simplify(Det1-Det4); simplify(Det1-Det5)
``

0.32e-1

  

0.34e-1

  

0.93e-1

  

.108

  

47.094

  

41.295

  

40.766

  

38.158

  

0.31e-1

  

0.50e-1

  

0

  

0

  

0

  

0

 (2)

Download test_Determinants_symbolic.mw

Maple 2023 toolbox regarding...

Asked by: vs140580 490
upgrade toolbox chemistry
May 22 2023
0  2

I had purchached reseach licience Maple 2022 towards the end of 2022 only and Quantum Chemistry Toolbox I purchased in Feb 2022 only.

Now i find significant update in toolbox in just 3 months. Now guide me how should i address this issuse.

I had to take loan in india to buy the toolbox.

It is only 3 months.

Can you suggest me how solve the problem to get the update without spending again.

What is the way guide someone.

First 77 78 79 80 81 82 83 Last Page 79 of 2308