Dr. David Harrington

6003 Reputation

21 Badges

19 years, 302 days
University of Victoria
Professor or university staff
Victoria, British Columbia, Canada

Social Networks and Content at Maplesoft.com

I am a professor of chemistry at the University of Victoria, BC, Canada, where my research areas are electrochemistry and surface science. I have been a user of Maple since about 1990.

MaplePrimes Activity

These are replies submitted by dharr

I haven't given much thought to your main question. But you spend a lot of calculation time figuring out the arcs of circles, especially start and end angles. If you just plot full circles and hide the bits outside the unit circle, then this can be done faster. (Though if you want to ultimately color in the regions, I'm not certain this is a good approach.)


@MaPal93 I gave some more thought to the structure of the betas in terms of the lambdas, and found some interesting things. In the expression for lambda__1:

there are no lambda__1's except in the determinant of Q. So if one could prove the numerator was always positive (the demoninator is positive), then the system seems internally consistent - any positive lambda__2 and lambda__3 would make the expression positive and then lambda__1 would be positive. Yet no positive solution can be found for all three equations.

For the calibration system, the signs of betas are as required, and the numerator is positive for positive lambdas.

Thanks for the best answer.


@MaPal93 The explanation was added to the MatrixNew8.mw file.

As for the signs of the beta's, since they contain lambda's it might be possible to use the known signs to narrow down the possibilties for the lamba's, but my first look at that didn't yield anything obvious. In general it is harder to decide the conditions for something to be positive or negative than zero.


I can see how you compute explicitly the relationship between the lambdas and the Xs, but not the one between the lambdas and the betas?

I added some explanation to hopefully clarify this.

Both relationships are interesting, but I am still not sure if they trivially follow from the conjectures or if they can have some deeper interpretation.

They both arise because the problem was extended from 2 components (2-vectors and 2x2 matrices) by adding a row that was the sum of the first two, and not independent, but lambda__3 was introduced separately. Whether this is significant or not is not clear to me.

Once the required X_max and beta quatities are found, then there are some relationships between them and it may be possible to further simplify the problem (but the solution is just the same). I'll try to give this some more thought.

Did you say that there could be a chance for real and positive solutions given that beta_11, beta_22, beta_31, beta_32 are expected to be positive, while beta_12 and beta_21 negative? This combination does not violate the relationship between betas and lambdas but I don't know how to use the expected signs of the betas to get to cases allowing real and positive lambdas.

I didn't mean to imply anything about that case.

Finally, I see you edited your second last comment ("think more about the cases where the denominators are zero"). For rho__v = 0, sigma__v1 = sigma__v2, sigma__e1 = sigma__e2 then I guess we obtain beta_31= - beta_32, beta_21= - beta_22, beta_11= - beta_12...I am not sure why you want me to think more about these cases...

Sorry, I added that edit as a reminder to myself to think about singular solutions, and did give it some thought. For example if 0 = 0*lambda__2 then lambda__2 can be anything. PolynomialSystem and Maple generally do not consider cases where the parameters may have special relationships that might give special solutions. They can be found using for example Triangularize with output=lazard, but since you want general relationships I don't think this is a profitable way to go.

 @MaPal93 Another simple relationship, which may be obvious to you from the formulation of the problem is

where the X__i are the values at the maximum.



@dharr Elsewhere (and at the bottom of the attached worksheet), the calibration case was shown not to have any positive solutions, thus providing a counterexample for the original conjecture. What can be shown more generally?

I worked up the rest of the problem into a matrix based form.


Ultimately it turns into a problem about the signs of diagonal elements that doesn't have clear-cut answers. However, along the way (assuming the lambda's were positive) I derived a (to me) surprising simple result:

So if there is some reason to believe the betas are positive, then the lambdas can't be positive and we have arrived at a contradiction, disproving the conjecture that there exists a positive solution (for all cases). If the betas can have any sign then one has to work harder. Looking at the key expressions for the three lambdas:

The denominators are quadratic forms of positive semidefinite matrices and therefore are non-negative. So for positive lambdas we need positive numerators. For the calibration case with rho__v zero and sigma__v1 = sigma__v2, this immediately leads to beta__11 positive, beta__22 positive and beta__31+beta__32 positive. Perhaps this can be worked out more fully into some contradiction between the signs of betas and lambdas, or some cases allowing positive solutions.

For real solutions other than positive ones, the matrix approach doesn't have much to say, since positive lambdas were key to making Q positive definite. For that reason, it is not clear to me how the original conjecture could be modified.

Edit: thnk more about the cases where the denominators are zero.


@delvin I don't know much about these functions, but I presume you need JacobiSN(zeta[1]*phi,ell) etc where ell is the modulus for your situation.

@MaPal93 The conditions on lambda__2 arise fairly naturally from just making sure that there are no zero denominators in the solutions, so I think you just need to first find the solutions and then just look at how the conditions relate to the solutions. Here's my analysis, which leads only to complex solutions  :(


@MaPal93 I would suggest complete workup with your calibration system without putting in numerical values for what I called parameters (@mmcdara's "remain" variables). Since the restrictions on lambda__2 are not that onerous, just find when the quadratic equation in Edit: corrected: lambda__3 has real, positive solutions, remove any that don't obey the conditions on lambda__2, and then work out lambda__1 for the OK lambda__2's, and see if/when they are positive.

Maybe this case is simple enough that solve/parametric can do this for you.

Once you understand the calibration system, then you can try some less restrictive ones, where the conditions and components might be more complicated.

@mmcdara I followed only this thread4 (different from the other 4!), and worked extensively on a matrix formulation, but got no response so I lost interest. I know very little statistics, but think that sometimes a matrix formulation can be easier than working with polynomials. Like you, I somehow expect that there must be an easier way, and I am slowly grasping the interrelationships between the different quantities.

This time the matrix Q has a lot fewer lambda's in, and so there might be a better chance of some solutions that are tractable. So I was willing to work a bit more on it.

@MaPal93 Perhaps you can provide @mmcdara with the notes you sent me, or upload them here.

@MaPal93 In the earlier problem, (separate thread), I recall that PolynomialSystems sometimes produced three components, so you had to solve the third, then the second, then the first, whereas above there are fewer "restrictions" (badly chosen word) since you can choose lambda__2 and lambda__3 arbitrarily. Since you are still working on a simpler calibration system, perhaps there will be more components for other cases. Anyway, I'll shortly post a separate answer that solves the calibration system without the denominators problem (and has two components).

@acer Fantastic. Vote up.

@emersondiaz I assume you are talking about the dsolve(DE,...) solution. Your worksheet doesn't reproduce the error you mention (I instead get a message about a singulaity) so I don't know how you got that. So here are some comments:

1. The default method automatically adjust the stepsize, so you should not use the stepsize option.

2. If your equations occur with many diffferent timescales (or rscales here), then you may need a stiff solver - add stiff=true (I routinely use this).

3. Terms in the equations and the numbers you are interested in for r and R are many orders of magnitude away from 1 (10^6 and 10^45 appear with 10^(-31). For example (r^2 - 1.690735000*10^37*r + 0.81). So the equations need to be rescaled (non-dimensionalize would be typical, or use a different unit solution) to avoid these numbers.

Point 3 is the most important point.

@NIMA112 You want now to solve a PDE on two regions with matching conditions at the common boundary, Eqs 6.30-6.33. As far as I know, Maple's numerical PDE solver only handles single rectangular regions. A Tool like COMSOL is probably better suted to this. Or you could follow the procedure given to find the complicated series solution; I didn't try to understand that in detail.

First 12 13 14 15 16 17 18 Last Page 14 of 62