Eli Brosh wrote:
Thank you for your answers,
The answer is obviously not a convex hull since the shape of hysteresis
loops is not convex.
Currently, it seems to me that the best proposal is to use some known
formula for the hysteresis loop and treat the problem as a curve fitting
exercise.
Can
Thank you for your answers,
The answer is obviously not a convex hull since the shape of hysteresis
loops is not convex.
Currently, it seems to me that the best proposal is to use some known
formula for the hysteresis loop and treat the problem as a curve fitting
exercise.
I now realize that the or
On Feb 4, 1:31 am, Eli Brosh wrote:
> I have a scanned digitized graph of a magnetic hysteresis loop.
> That is, I have a list of points [(H0,B0),(H1,B1)(Hn,Bn)]
> however, the points are not ordered in any meaningful way.
> In order to calculate the hysteresis loss, which is the area enclose
> I think there is no persistent homology implemented in Sage, is it?
I don't think so, but it might make a really great senior project to
implement some basic stuff, as there are now several accessible
introductions at the late-undergrad/early-grad level. Also, do you
know if any of the current
Eli Brosh wrote:
Hello,
I have an interesting problem and I hope it is possible to solve it
using sage.
I have a scanned digitized graph of a magnetic hysteresis loop.
That is, I have a list of points [(H0,B0),(H1,B1)(Hn,Bn)]
however, the points are not ordered in any meaningful way.
In order
Hi Eli!
I wrote:
[...]
> But back to Eli's question: If the data are sufficiently nice, then it
> may be worth a try to join each data point with its two nearest
> neighbours. Perhaps some hand work will be needed to adjust things,
> but I don't think that there is any algorithm that is as good as
Hi Nathann!
On Feb 4, 8:43 am, Nathann Cohen wrote:
> Hello
>
> Could you be by any chance trying to compute the convex hull of a set
> of points ?
>
> http://en.wikipedia.org/wiki/Convex_hull
>
If I imagine the typical shape of a hysteresis (see the pictures at
http://en.wikipedia.org/wiki
On Thu, 4 Feb 2010 00:43:10 -0800 (PST), Nathann Cohen
wrote:
> Could you be by any chance trying to compute the convex hull of a set
> of points ?
In which case you would want to do for example:
sage: poly = Polyhedron(vertices=[(0, 0), (3, 0), (0, 3), (1, 1)])
sage: poly
A 2-dimensional polyh
Hello
Could you be by any chance trying to compute the convex hull of a set
of points ?
http://en.wikipedia.org/wiki/Convex_hull
Nathann
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegrou
