Error

 4 Pages<1234>
 Previous Topic Next Topic
 Jean Giraud #21 Posted : 22 October 2018 23:13:15(UTC) Rank: Advanced MemberGroups: Registered Joined: 04/07/2015(UTC)Posts: 4,584Was thanked: 778 time(s) in 618 post(s) Originally Posted by: Razonar Hi Jean. Try this, in the last portable version (0.99.6839.38235):Syntax is incorrect ... 6839 is totally not compatible 6179.Hard to explain: first time Draghilev was offered it did open 5346 !About the coding below, is it the latest way to code 6839 ?What kind of coding is that ? Remember the Alex projectI re-coded it all and worked fine.Cheers ... Jean
 Razonar #22 Posted : 23 October 2018 00:30:59(UTC) Rank: Advanced MemberGroups: Registered Joined: 28/08/2014(UTC)Posts: 464Was thanked: 263 time(s) in 163 post(s) Originally Posted by: алексей_алексей Razonar, you are not talking about the method of Draghilev, but about your understanding of it. This is not the same thing. Sure. Doesn't same thing apply to you too?Originally Posted by: алексей_алексей ... And: what is the relation to the essence have the lengths of the arcs, parametrization...? A lot. For instance, from the paper that you give as reference ( https://vk.com/doc242471809_437831729 ) can read:......"From the course of mathematical analysis, we know that the length of the arc does not depend on the choice of the parameter t, and it increases with t. The value t = 0 corresponds to the selected starting point, from which the curve will be constructed in both directions, in the “positive” direction the integration step will be positive, and in the “negative” direction - negative. To solve (2a), we can apply the standard algorithm for the numerical solution of the Cauchy problem to construct the curve (1)."..."We construct the curve (1), assuming that the length of the arc of the curve itself is the independent variable. The coordinates of the points of the curve will be obtained as a solution to the Cauchy problem for a system of ordinary differential equations, the initial data for which will be the coordinates of the previously known point belonging to this curve"But the final parametrization isn't along the arc length.Best regards.Alvaro.
 Razonar #23 Posted : 23 October 2018 00:43:47(UTC) Rank: Advanced MemberGroups: Registered Joined: 28/08/2014(UTC)Posts: 464Was thanked: 263 time(s) in 163 post(s) Originally Posted by: Jean Giraud Originally Posted by: Razonar Hi Jean. Try this, in the last portable version (0.99.6839.38235):About the coding below, is it the latest way to code 6839 ?What kind of coding is that ? Hi Jean. What you see is the unicode code for some ornaments. I use them because I don't like the use of x#, y# ... etc for each variable in the definition and body of the SMath procedures. Maybe you don't have the unicode version of Courier New font.Best regards.Alvaro.
 Davide Carpi #24 Posted : 23 October 2018 01:00:26(UTC) Rank: Advanced MemberGroups: Registered, Advanced MemberJoined: 13/01/2012(UTC)Posts: 2,254Location: ItalyWas thanked: 1142 time(s) in 747 post(s) Originally Posted by: Razonar Maybe you don't have the unicode version of Courier New font.Special characters mode is available since Version 0.99.6617, hence can't be rendered correctly in Jean's 0.98.6179 (no matter what fonts he has)Please note that decorations aren't really needed since 0.98.6325 when Clear() was made built-in and that is enough to isolate line() procedures from external variables (useful in Jean's 0.98.6179, though)Edited by user 23 October 2018 01:27:24(UTC)  | Reason: Not specified If you like my plugins please consider a donation to SMath Studio; for personal contributions to me: paypal.me/dcprojects 1 user thanked Davide Carpi for this useful post. on 23/10/2018(UTC)
 Razonar #25 Posted : 23 October 2018 02:00:14(UTC) Rank: Advanced MemberGroups: Registered Joined: 28/08/2014(UTC)Posts: 464Was thanked: 263 time(s) in 163 post(s) Originally Posted by: Davide Carpi Please note that decorations aren't really needed since 0.98.6325 when Clear() was made built-in and that is enough to isolate line() procedures from external variables (useful in Jean's 0.98.6179, though)Hi Davide. Thanks for confirm that, I still using both.Best regards.Alvaro.
 алексей_алексей #26 Posted : 23 October 2018 18:25:34(UTC) Rank: MemberGroups: Registered Joined: 30/09/2012(UTC)Posts: 27Was thanked: 10 time(s) in 5 post(s) Originally Posted by: Razonar ...But the final parametrization isn't along the arc length....What is the meaning of your messages? Using the arc length as an independent variable is a well-known technique and is not directly related to the Draghilev method, but can be used in the implementation of the method. For example, I widely use this technique. This is achieved by simple normalization of the variable of integration by the magnitude (dx^2 + dy^2 + dz^2)^0.5, in the case of 3d.Yes, I hope you understand that the curve itself is always unambiguous?Edited by user 23 October 2018 18:31:25(UTC)  | Reason: Not specified
 Jean Giraud #28 Posted : 24 October 2018 06:16:01(UTC) Rank: Advanced MemberGroups: Registered Joined: 04/07/2015(UTC)Posts: 4,584Was thanked: 778 time(s) in 618 post(s) Originally Posted by: алексей_алексей I hope you understand that the curve itself is always unambiguous?Unambiguous curves are baby stuff.In Engineering, we rarely have have such ideal maths formulae whereas the projectis generally a suite to data sets best approximated from optimizing model.On the other hand, practical arc length depends upon built-in numerical integrator(s).In the attached, observe the native Smath Simpson vs Smath-Romberg.On the other end the contract may require double check from independent methods.The attached includes Legendre [one of the most used from reference]Cheers ... Jean Integrate Wisely [Arc Lagrange].sm (47kb) downloaded 23 time(s).
 алексей_алексей #29 Posted : 24 October 2018 20:51:56(UTC) Rank: MemberGroups: Registered Joined: 30/09/2012(UTC)Posts: 27Was thanked: 10 time(s) in 5 post(s) Razonar."We construct the curve (1), предположив=suggesting (not assuming) that the length of the arc of the curve itself is the independent variable. The coordinates of the points of the curve will be obtained as a solution to the Cauchy problem for a system of ordinary differential equations, the initial data for which will be the coordinates of the previously known point belonging to this curve"By the way, where did you find the "parameterization" in the description?“But the final parametrization isn't along the arc length.”I do not have and do not use SMath.Both the circumference and the length of any closed smooth curve can be constructed either by any part, or by any repetitions, giving the coordinates of points a unique dependence on the arc length. The coordinates of the points are functions of the arc length.Guys, everything works by fundamentals of elementary mathematics and works in areas that were very complex before the advent of the Draghilev method. Good luck to you in understanding and mastering the Method.
 алексей_алексей #30 Posted : 24 October 2018 21:57:36(UTC) Rank: MemberGroups: Registered Joined: 30/09/2012(UTC)Posts: 27Was thanked: 10 time(s) in 5 post(s) Originally Posted by: алексей_алексей I do not have and do not use SMath.It seems to me that SMath does not yet has the capabilities, such as Maple, to execute some examples.For example, Method Draghilev, however: Edited by user 05 April 2019 21:00:11(UTC)  | Reason: Not specified
 Razonar #31 Posted : 24 October 2018 23:34:10(UTC) Rank: Advanced MemberGroups: Registered Joined: 28/08/2014(UTC)Posts: 464Was thanked: 263 time(s) in 163 post(s) Originally Posted by: Jean Giraud ...If you find some volunteers to code Tom G. Mathcad contour ... please feel free....Hi Jean. Problem for code in SMath this procedure it's about that NaN is unavaible in SMath. Here you can see what happens without NaN, and a workaround of that: https://en.smath.info/fo...12539_Implicit-Plot.aspx iplotq.sm (41kb) downloaded 46 time(s).The iplot routine is from uni works in mathdcad.Best regards.Alvaro.Edited by user 24 October 2018 23:37:04(UTC)  | Reason: Not specified
 Ber7 #32 Posted : 28 October 2018 18:00:46(UTC) Rank: Advanced MemberGroups: Registered Joined: 15/07/2010(UTC)Posts: 343Location: Beer-ShevaWas thanked: 447 time(s) in 240 post(s) Dragilev method for equations with a parameter.Equations borrowed from Jean Giraud . JeanContour1.sm (12kb) downloaded 24 time(s). Jean.sm (12kb) downloaded 25 time(s).Edited by user 05 November 2018 12:50:12(UTC)  | Reason: Not specified 1 user thanked Ber7 for this useful post. on 29/10/2018(UTC)
 Jean Giraud #33 Posted : 29 October 2018 18:03:17(UTC) Rank: Advanced MemberGroups: Registered Joined: 04/07/2015(UTC)Posts: 4,584Was thanked: 778 time(s) in 618 post(s) Originally Posted by: Ber7 Dragilev method for equations with a parameter.Equations borrowed from Jean Giraud .Thanks Ber7 ... Electron function works fine.Loop function fails, Maple SS 6179 seems in cause [RootOf].Tried to doctor, not to avail , Ah !Jean
 Jean Giraud #34 Posted : 30 October 2018 00:51:50(UTC) Rank: Advanced MemberGroups: Registered Joined: 04/07/2015(UTC)Posts: 4,584Was thanked: 778 time(s) in 618 post(s) ... doctored: few cut/paste has like re-installed the codes,Can't get the complete loop as yours, but pleased with other contours.Thanks again ... gorgeous Draghilev/Ber7
 Ber7 #35 Posted : 30 October 2018 07:56:02(UTC) Rank: Advanced MemberGroups: Registered Joined: 15/07/2010(UTC)Posts: 343Location: Beer-ShevaWas thanked: 447 time(s) in 240 post(s) Jean, try without a maple. Jeansolve.sm (12kb) downloaded 22 time(s).
 Jean Giraud #36 Posted : 01 November 2018 03:43:58(UTC) Rank: Advanced MemberGroups: Registered Joined: 04/07/2015(UTC)Posts: 4,584Was thanked: 778 time(s) in 618 post(s) Originally Posted by: Ber7 Jean, try without a maple.It works fine but can't nicely complete the 0 level loop.It can be done otherwise for the interest of exporting.This LaceLoop origin from Mathsoft Collaboratory... why ?Mathcad 11 contour plot does nothing except absolute scrap.So intriguing, that Tom G. made his own superb contour program. Jean Draghilev's Contour_2 Ber7 [Loop NO maple].sm (86kb) downloaded 20 time(s). Draghilev's Contour_2 Ber7 [Loop Reconciliation].sm (87kb) downloaded 19 time(s).
 Ber7 #37 Posted : 01 November 2018 17:23:59(UTC) Rank: Advanced MemberGroups: Registered Joined: 15/07/2010(UTC)Posts: 343Location: Beer-ShevaWas thanked: 447 time(s) in 240 post(s) Point chart. You can see that the distance between the points is the same(Version 0.99.6839) Version 0.99.6839.sm (12kb) downloaded 20 time(s).
 Jean Giraud #38 Posted : 02 November 2018 19:53:33(UTC) Rank: Advanced MemberGroups: Registered Joined: 04/07/2015(UTC)Posts: 4,584Was thanked: 778 time(s) in 618 post(s) Thanks Ber7 for the Draghilev parametric method.I'm in peace with myself from the attached reconciliation.Bigger image in the document.Jean Draghilev's Contour_2 Ber7 [Loop Reconciliation] Copy.sm (153kb) downloaded 22 time(s).
 Ber7 #39 Posted : 08 November 2018 20:19:37(UTC) Rank: Advanced MemberGroups: Registered Joined: 15/07/2010(UTC)Posts: 343Location: Beer-ShevaWas thanked: 447 time(s) in 240 post(s) The parameterization by Draghilev method.The starting point is taken near the bifurcation point (0,0). ContourTifoleum.sm (17kb) downloaded 20 time(s).
 Razonar #40 Posted : 08 November 2018 21:59:20(UTC) Rank: Advanced MemberGroups: Registered Joined: 28/08/2014(UTC)Posts: 464Was thanked: 263 time(s) in 163 post(s) Originally Posted by: Ber7 Point chart. You can see that the distance between the points is the same(Version 0.99.6839)Hi Ber. Great discover! If you can translate that as a general result, this is, you can relate the distance between points and the parameter, it could be an important theoretical result, given access to parametrize the curve between two given points. The starting point (x0,y0) or (x0,y0,z0) with t=0, and with that relation you can know previously for which t=t1 you touch another curve point (x1,y1). Further you can evaluate with the parametric formulas areas (double or triple integrals), path integrals, fluxes integrals, frenet vectors, and others with parametric formulations, which are more stable and accurate numerically than those from cartesian forms. Also, maybe you can investigate the symbolics results, using dsolve from maple or maxima instead the numeric rkfixed solutions for inspect how the parametrization is constructed.I see that that you divide by the jacobian determinant, which I guess result in the parametrization by the arc lenght curve. As a minor observation you can improve that, avoiding transposition under the square root, accessing jacobian elements by the SMath el(n) with only one argument for matrices.Best regards.Alvaro.
 Users browsing this topic
 Similar Topics Draghilev method revisited [Isocurves] (Samples) by Jean Giraud 27/03/2019 18:17:33(UTC)
 4 Pages<1234>
Forum Jump
You cannot post new topics in this forum.
You cannot reply to topics in this forum.
You cannot delete your posts in this forum.
You cannot edit your posts in this forum.
You cannot create polls in this forum.
You cannot vote in polls in this forum.