Main Page | Report this Page
 
   
Science Forum Index  »  Math - Numerical Analysis Forum  »  Minimum Potential of Electrons on a Hypersphere
Page 1 of 1    
Author Message
tlhiv
Posted: Wed Dec 06, 2006 1:40 pm
Guest
I'm trying to determine a numerical method for calculating the position
of k electrons on a (n-1) hypersphere in R^n (n<k<2n) in such a way
that the potential energy of the system is minimized. This is a known
hard problem even when n=3, but I'm not looking for exact solutions. I
just want to determine a good way of coding up a programming language
like C or Fortran or Matlab to iterate until the points settle in their
equilibrium position.

Can anyone shed any insight into how to numerically solve this problem?
I'm interested in n<=80.

Thanks,

Troy Henderson
Peter Spellucci
Posted: Wed Dec 06, 2006 1:40 pm
Guest
In article <1165426816.931546.106200@n67g2000cwd.googlegroups.com>,
"tlhiv" <thenders@gmail.com> writes:
Quote:
I'm trying to determine a numerical method for calculating the position
of k electrons on a (n-1) hypersphere in R^n (n<k<2n) in such a way
that the potential energy of the system is minimized. This is a known
hard problem even when n=3, but I'm not looking for exact solutions. I
just want to determine a good way of coding up a programming language
like C or Fortran or Matlab to iterate until the points settle in their
equilibrium position.

Can anyone shed any insight into how to numerically solve this problem?
I'm interested in n<=80.

Thanks,

Troy Henderson


you can write this as a nonlinear optimization problem . the need of
the nonlinear equality constraint can be avoided by using n-dim spherical
coordinates at the cost of using box constraints and getting an even higher
nonlinearity. since there will be local minimizer, you need a global minimizer
which will be hard if the dimension is as large as you indicate. but maybe that
simulated annealing does the job.
out there are ready to use codes for this.
check out
http://plato.la.asu.edu/guide.html
under "global optimization"
hth
peter
Pierre Asselin
Posted: Wed Dec 06, 2006 4:32 pm
Guest
Peter Spellucci <spellucci@fb04373.mathematik.tu-darmstadt.de> wrote:

Quote:
In article <1165426816.931546.106200@n67g2000cwd.googlegroups.com>,
"tlhiv" <thenders@gmail.com> writes:
I'm trying to determine a numerical method for calculating the position
of k electrons on a (n-1) hypersphere in R^n (n<k<2n) in such a way
that the potential energy of the system is minimized.

you can write this as a nonlinear optimization problem . the need of
the nonlinear equality constraint can be avoided by using n-dim spherical
coordinates at the cost of using box constraints and getting an even higher
nonlinearity.

I was thinking the same thing, but that he should use stereographic
coordinates. Given u_1, u_2, ... u_{n-1},

x_k = 2u_k / (1 + ||u||^2) for 1 <= k < n,

x_n = (1 - ||u||^2) / (1 + ||u||^2) for k=n

is a general point on the sphere ||x||=1 in R^n. The coordinates
are singular at the south pole, x= [0,0 ... 0,1] maps to u=
infinity, but are regular everywhere else. The OP could pin one
of his electrons at the south pole with no loss of generality
and parametrize the others by u coordinates.

In case it matters, the inverse mapping is

u_k = x_k / (1+x_n) (given ||x||=1)


--
pa at panix dot com
Julian V. Noble
Posted: Wed Dec 06, 2006 5:21 pm
Guest
Peter Spellucci wrote:
Quote:
In article <1165426816.931546.106200@n67g2000cwd.googlegroups.com>,
"tlhiv" <thenders@gmail.com> writes:
I'm trying to determine a numerical method for calculating the position
of k electrons on a (n-1) hypersphere in R^n (n<k<2n) in such a way
that the potential energy of the system is minimized. This is a known
hard problem even when n=3, but I'm not looking for exact solutions. I
just want to determine a good way of coding up a programming language
like C or Fortran or Matlab to iterate until the points settle in their
equilibrium position.

Can anyone shed any insight into how to numerically solve this problem?
I'm interested in n<=80.

Thanks,

Troy Henderson


you can write this as a nonlinear optimization problem . the need of
the nonlinear equality constraint can be avoided by using n-dim spherical
coordinates at the cost of using box constraints and getting an even higher
nonlinearity. since there will be local minimizer, you need a global minimizer
which will be hard if the dimension is as large as you indicate. but maybe that
simulated annealing does the job.
out there are ready to use codes for this.
check out
http://plato.la.asu.edu/guide.html
under "global optimization"
hth
peter

My only caveat to what Peter has said is that you should use
Cartesian coordinates to calculate distances. Otherwise the pro-
fusion of trigonometric functions will slow things up inordinately.

I presume you are using V = e^2 / r, where r is the inter-electron
distance (not the distance along a great hyper circle) and e the
electron charge. You constrain them to be on a hyper sphere by
requiring the square of any position vector to be R^2.

Note that fp square root takes the same time as a fp division,
a lot faster than computing transcendentals.

--
Julian V. Noble
Professor Emeritus of Physics
University of Virginia
tlhiv
Posted: Wed Dec 06, 2006 5:36 pm
Guest
Thanks for the replies. However, I was looking for an actual "plan of
attack" because I've not done any (non-)linear optimzation. I'm very
fluent in programming, and perfectly fluent in solving linear systems
of equations.

If anyone has an idea for pseudocode, I'd be much appreciative.

Troy
Pierre Asselin
Posted: Thu Dec 07, 2006 5:03 am
Guest
Pierre Asselin <pa@see.signature.invalid> wrote:

Quote:
[ stereographic projection ] The coordinates
are singular at the south pole, x= [0,0 ... 0,1] maps to u=
infinity, but are regular everywhere else.

I meant x= [0,0 ... 0, -1].

--
pa at panix dot com
rusty
Posted: Thu Dec 07, 2006 5:44 am
Guest
"Peter Spellucci" <spellucci@fb04373.mathematik.tu-darmstadt.de> wrote in
message news:el74hb$hdj$1@fb04373.mathematik.tu-darmstadt.de...
Quote:

In article <1165426816.931546.106200@n67g2000cwd.googlegroups.com>,
"tlhiv" <thenders@gmail.com> writes:
I'm trying to determine a numerical method for calculating the position
of k electrons on a (n-1) hypersphere in R^n (n<k<2n) in such a way
that the potential energy of the system is minimized. This is a known
hard problem even when n=3, but I'm not looking for exact solutions. I
just want to determine a good way of coding up a programming language
like C or Fortran or Matlab to iterate until the points settle in their
equilibrium position.

Can anyone shed any insight into how to numerically solve this problem?
I'm interested in n<=80.

Thanks,

Troy Henderson


you can write this as a nonlinear optimization problem . the need of
the nonlinear equality constraint can be avoided by using n-dim spherical
coordinates at the cost of using box constraints and getting an even
higher
nonlinearity. since there will be local minimizer, you need a global
minimizer
which will be hard if the dimension is as large as you indicate. but maybe
that
simulated annealing does the job.


Grassman Spaces might be a good approximation to start off an iterative
method:
"Packing Lines, Planes, etc., Packings in Grassmannian Spaces"
http://www.research.att.com/~njas/doc/grass.pdf

john2
Julian V. Noble
Posted: Fri Dec 08, 2006 1:34 pm
Guest
tlhiv wrote:
Quote:
Thanks for the replies. However, I was looking for an actual "plan of
attack" because I've not done any (non-)linear optimzation. I'm very
fluent in programming, and perfectly fluent in solving linear systems
of equations.

If anyone has an idea for pseudocode, I'd be much appreciative.

Troy


You might want to try downhill simplex or simulated annealing.
There are also conjugate gradient optimizers around of varying
sophistication, depending on what the surface looks like.

--
Julian V. Noble
Professor Emeritus of Physics
University of Virginia
D. Baruth
Posted: Fri Dec 08, 2006 6:41 pm
Guest
: > In article <1165426816.931546.106200@n67g2000cwd.googlegroups.com>,
: > "tlhiv" <thenders@gmail.com> writes:
: > >I'm trying to determine a numerical method for calculating the position
: > >of k electrons on a (n-1) hypersphere in R^n (n<k<2n) in such a way
: > >that the potential energy of the system is minimized.

Real electrons can not be located at definite positions.
How does your potential look? What are the dimensions
you are using?

D. Baruth



--
Posted via a free Usenet account from http://www.teranews.com
John Herman
Posted: Sat Dec 09, 2006 11:35 am
Guest
This is a naive question but I was wondering if the solution for 80 electrons
close to the solution for 79? In other words, is starting with a lower
dimensional problem and working up to the dimension needed reasonable?

In article <el74hb$hdj$1@fb04373.mathematik.tu-darmstadt.de>,
spellucci@fb04373.mathematik.tu-darmstadt.de (Peter Spellucci) wrote:
Quote:

In article <1165426816.931546.106200@n67g2000cwd.googlegroups.com>,
"tlhiv" <thenders@gmail.com> writes:
I'm trying to determine a numerical method for calculating the position
of k electrons on a (n-1) hypersphere in R^n (n<k<2n) in such a way
that the potential energy of the system is minimized. This is a known
hard problem even when n=3, but I'm not looking for exact solutions. I
just want to determine a good way of coding up a programming language
like C or Fortran or Matlab to iterate until the points settle in their
equilibrium position.

Can anyone shed any insight into how to numerically solve this problem?
I'm interested in n<=80.

Thanks,

Troy Henderson


you can write this as a nonlinear optimization problem . the need of
the nonlinear equality constraint can be avoided by using n-dim spherical
coordinates at the cost of using box constraints and getting an even higher
nonlinearity. since there will be local minimizer, you need a global minimizer
which will be hard if the dimension is as large as you indicate. but maybe that
simulated annealing does the job.
out there are ready to use codes for this.
check out
http://plato.la.asu.edu/guide.html
under "global optimization"
hth
peter
D. Baruth
Posted: Sat Dec 09, 2006 3:29 pm
Guest
How doese your solution look for one "electron" (or two)?

D. Baruth


John Herman <John_W_Herman@yahoo.com> wrote in message news:bJAeh.52353$Fg.6292@tornado.socal.rr.com...
: This is a naive question but I was wondering if the solution for 80 electrons
: close to the solution for 79? In other words, is starting with a lower
: dimensional problem and working up to the dimension needed reasonable?





--
Posted via a free Usenet account from http://www.teranews.com
John Herman
Posted: Sat Dec 09, 2006 10:53 pm
Guest
I was just wondering if a solution was found for 79, would that be a help in
solving the problem for 80 electrion. Or would it be necessary to start over
again for 9- electrons. So I was thinking that start with 3, then 4, ... and
so on until the desired degree is obtained.

In article <457b018b$0$15452$88260bb3@free.teranews.com>, "D. Baruth"
<SeeBelow@ThisDocument.com> wrote:
Quote:
How doese your solution look for one "electron" (or two)?

D. Baruth


John Herman <John_W_Herman@yahoo.com> wrote in message
news:bJAeh.52353$Fg.6292@tornado.socal.rr.com...
: This is a naive question but I was wondering if the solution for 80 electrons
: close to the solution for 79? In other words, is starting with a lower
: dimensional problem and working up to the dimension needed reasonable?




Peter Spellucci
Posted: Mon Dec 11, 2006 2:41 am
Guest
In article <bJAeh.52353$Fg.6292@tornado.socal.rr.com>,
John_W_Herman@yahoo.com (John Herman) writes:
Quote:
This is a naive question but I was wondering if the solution for 80 electrons
close to the solution for 79? In other words, is starting with a lower
dimensional problem and working up to the dimension needed reasonable?

this should work if you move all points a little towards the one fixed

and place the intial guess of the new point in the "freed" area.
but for much smaller number of varaibles this is quite questionable.
hope it works
peter

Quote:
In article <el74hb$hdj$1@fb04373.mathematik.tu-darmstadt.de>,
spellucci@fb04373.mathematik.tu-darmstadt.de (Peter Spellucci) wrote:

In article <1165426816.931546.106200@n67g2000cwd.googlegroups.com>,
"tlhiv" <thenders@gmail.com> writes:
I'm trying to determine a numerical method for calculating the position
of k electrons on a (n-1) hypersphere in R^n (n<k<2n) in such a way
that the potential energy of the system is minimized. This is a known
hard problem even when n=3, but I'm not looking for exact solutions. I
just want to determine a good way of coding up a programming language
like C or Fortran or Matlab to iterate until the points settle in their
equilibrium position.

Can anyone shed any insight into how to numerically solve this problem?
I'm interested in n<=80.

Thanks,

Troy Henderson


you can write this as a nonlinear optimization problem . the need of
the nonlinear equality constraint can be avoided by using n-dim spherical
coordinates at the cost of using box constraints and getting an even higher
nonlinearity. since there will be local minimizer, you need a global minimizer
which will be hard if the dimension is as large as you indicate. but maybe that
simulated annealing does the job.
out there are ready to use codes for this.
check out
http://plato.la.asu.edu/guide.html
under "global optimization"
hth
peter
Paul J Gans
Posted: Wed Dec 13, 2006 6:10 am
Guest
John Herman <John_W_Herman@yahoo.com> wrote:
Quote:
I was just wondering if a solution was found for 79, would that be a help in
solving the problem for 80 electrion. Or would it be necessary to start over
again for 9- electrons. So I was thinking that start with 3, then 4, ... and
so on until the desired degree is obtained.

I think that part of the problem is that in some dimensions for
some numbers of electrons the solution might not be stable.

That is there may be several relative minima separated by low
potential barriers and the various minima may be very close in
energy if not equal.

Thus it isn't sufficient to find a potential minimum. It has
to be tested for stability as well.

--
--- Paul J. Gans
 
Page 1 of 1       All times are GMT - 5 Hours
The time now is Fri Nov 21, 2008 1:16 am