Semigroup with involution: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
Newer edit →
en>SchreiberBike
Repairing links to disambiguation pages - You can help! - Reverse
 
en>Yobot
m DEFAULTSORT with special characters using AWB (9585)
Line 1: Line 1:
If you present photography effectively, it helps you look much more properly at the globe around you. It is thus, on these grounds that compel various web service provider companies to integrate the same in their packages too. Should you go with simple HTML or use a platform like Wordpress. In the recent years, there has been a notable rise in the number of companies hiring Indian Word - Press developers. You can easily customize the titles of the posts in Word - Press blog in a way that only title comes in the new post link and not the date or category of posts. <br><br>purcase and download - WPZOOM Tribune wordpress Theme, find and use the WPZOOM Discount Code. You do not catch a user's attention through big and large pictures that usually takes a millennium to load up. This plugin allows a blogger get more Facebook fans on the related fan page. By purchasing Word - Press weblogs you can acquire your very own domain title and have total command of your web site. Moreover, many Word - Press themes need to be purchased and designing your own WP site can be boring. <br><br>Digital photography is a innovative effort, if you removethe stress to catch every position and viewpoint of a place, you free yourself up to be more innovative and your outcomes will be much better. Now if we talk about them one by one then -wordpress blog customization means customization of your blog such as installation of wordpress on your server by wordpress developer which will help you to acquire the SEO friendly blog application integrated with your site design as well as separate blog administration panel for starting up your own business blog,which demands a experienced wordpress designer. Whether or not it's an viewers on your web page, your social media pages, or your web page, those who have a present and effective viewers of "fans" are best best for provide provides, reductions, and deals to help re-invigorate their viewers and add to their main point here. You can allow visitors to post comments, or you can even allow your visitors to register and create their own personal blogs. Article Source: Stevens works in Internet and Network Marketing. <br><br>Additionally Word - Press add a default theme named Twenty Fourteen. And, that is all the opposition events with nationalistic agenda in favor of the individuals of Pakistan marching collectively in the battle in opposition to radicalism. The templates are designed to be stand alone pages that have a different look and feel from the rest of your website. The company gains commission from the customers' payment. This includes enriching the content with proper key words, tactfully defining the tags and URL. <br><br>Internet is not only the source for information, it is also one of the source for passive income. I'm a large fan of using Word - Press to create pretty much any sort of web page. In simple words, this step can be interpreted as the planning phase of entire PSD to wordpress conversion process.  If you beloved this write-up and you would like to receive much more info with regards to [http://urlon.com.br/backup_plugin_939678 wordpress dropbox backup] kindly visit our web site. It is a fact that Smartphone using online customers do not waste much of their time in struggling with drop down menus. The 2010 voting took place from July 7 through August 31, 2010.
The '''distance of closest approach''' of two objects is the distance between their centers when they are externally tangent. The objects may be geometric shapes or physical particles with well defined boundaries.   The distance of closest approach is sometimes referred to as the contact distance.
 
For the simplest objects, spheres, the distance of closest approach is simply the sum of their radii. For non-spherical objects, the distance of closest approach is a function of the orientation of the objects, and its calculation can be difficult. The maximum packing density of hard particles, an important problem of ongoing interest,<ref>S. Torquato and Y. Jiao, [http://www.nature.com/nature/journal/v460/n7257/full/nature08239.html Nature 460, 876-879, 2009]</ref> depends on their distance of closest approach.
 
The interactions of particles typically depend on their separation, and the distance of closest approach plays an important role in determining the behavior of condensed matter systems.
 
The [[excluded volume]] of particles (the volume excluded to the centers of other particles due to the presence of one) is a key parameter in such descriptions,;<ref>T.L. Hill, An Introduction to Statistical Thermodynamics  (Addison Wesley, London, 1960)</ref><ref>T.A. Witten,  and P.A. Pincus, Structured Fluids (Oxford University Press, Oxford, 2004)</ref>  the distance of closest approach is required to calculate the excluded volume.    The excluded volume for identical spheres is just four times the volume of one [[sphere]].  For other [[anisotropic]] objects, the excluded volume depends on orientation, and its calculation can be surprising difficult.<ref>Forces, Growth and Form in Soft Condensed Matter: At the Interface between Physics and Biology, ed. A.T. Skjeltrop and A.V. Belushkin, (NATO Science Series II: Mathematics, Physics and Chemistry, 2009),</ref> The simplest shapes after spheres are ellipses and ellipsoids; these have received [http://www.cnn.com/2004/TECH/science/02/16/science.candy.reut/ considerable attention],<ref>A. Donev, F.H. Stillinger, P.M. Chaikin and S.  Torquato,  Phys. Rev. Lett. 92, 255506 (2004)</ref> yet their excluded volume is not known.  Vieillard Baron was able to provide an overlap criterion for two ellipses. His results were useful for computer simulations of hard particle systems and for [[packing problem]]s using [[Monte Carlo]] simulations.
 
[[File:Ellipses.png|thumb|250px|right|Two externally tangent ellipses]]
 
The one anisotropic shape whose excluded volume can be expressed analytically is the spherocylinder; the solution of this problem is a classic work by Onsager.<ref>L. Onsager, Ann NY Acad Sci, 51, 627 (1949)</ref> The problem was tackled by considering the distance between two line segments, which are the center lines of the capped cylinders.  Results for other shapes are not readily available.  
The orientation dependence of the distance of closest approach has surprising consequences. Systems of hard particles, whose interactions are only entropic, can become ordered.  Hard spherocylinders form not only orientationally ordered nematic, but also positionally ordered smectic phases.<ref>D. Frenkel, J. Phys. Chem. 91, 4912-4916 (1987)</ref> Here, the system gives up some (orientational and even positional) disorder to gain disorder and [[entropy]] elsewhere.
 
==Distance of closest approach of two ellipses==
 
Vieillard Baron first investigated this problem, although he did not obtain a result for the distance of closest approach, he derived the overlap criterion for two ellipses.  His results were useful  for  the study of the phase behavior of hard particles and for  the [[packing problem]] using [[Monte Carlo]] simulations. Although overlap criteria have been developed,<ref>J. Vieillard-Baron, "Phase transition of the classical hard ellipse system" J. Chem. Phys., 56(10), 4729 (1972).</ref><ref>J. W. Perram and M. S. Wertheim, "Statistical mechanics of hard ellipsoids. I. overlap algorithm and the contact function", J. Comput. Phys., 58, 409 (1985).</ref> analytic solutions for the distance of closest approach and the location of the point of contact have only recently become available.<ref>X. Zheng and P. Palffy-Muhoray, "Distance of closest approach of two arbitrary hard ellipses in two dimensions", [http://www.e-lc.org/docs/2007_01_17_00_46_52 electronic Liquid Crystal Communications], 2007</ref><ref>X. Zheng and P. Palffy-Muhoray, "Distance of closest approach of two arbitrary hard ellipses in two dimensions", Phys. Rev. E, 75, 061709 (2007).</ref> The details of the calculations are provided in Ref.<ref>X. Zheng and P. Palffy-Muhoray, [http://www.math.kent.edu/~zheng/ellipse.pdf Complete version containing contact point algorithm, May 4, 2009.]</ref> The [[Fortran 90]] subroutine is provided in Ref.<ref>[http://www.math.kent.edu/~zheng/ellipses.f90  Fortran90 subroutine for contact distance and contact point for 2D ellipses] by X. Zheng and P. Palffy-Muhoray, May 2009.</ref>
 
===The method===
The procedure consists of three steps:
# [[Transformation (geometry)|Transformation]] of the two [[tangent]] [[ellipse]]s <math>E_1</math> and <math>E_2</math>, whose centers are joined by the [[Euclidean vector|vector]] '''<math>d</math>''', into a [[circle]] <math> C_1'</math> and an ellipse <math> E_2'</math>, whose centers are joined by the vector '''<math>d'</math>'''. The circle <math> C_1'</math> and the ellipse <math> E_2'</math>  remain tangent after the transformation.
# Determination of the distance <math>d'</math> of closest approach of <math> C_1'</math> and <math> E_2'</math> analytically. It requires the appropriate solution of a [[quartic equation]]. The normal '''<math> n'</math>''' is calculated.
# Determination of the distance <math>d</math> of closest approach and the location of the point of contact of <math> E_1</math>  and <math> E_2</math> by the inverse transformations of the vectors '''<math>d'</math>''' and '''<math>n'</math>'''.
 
Input:
*[[lengths]] of the semiaxes <math>a_1,b_1,a_2, b_2</math>,
*[[unit vectors]] '''<math>k_1</math>''','''<math>k_2 </math>''' along major [[Cartesian coordinate system|axes]] of both ellipses, and
*[[unit vector]] '''<math>d</math>''' joining the centers of the two ellipses.
 
Output:
*distance <math>d</math> between the centers when the ellipses <math>E_1</math> and <math> E_2</math> are [[externally]] [[tangent]], and
*location of point of contact in terms of '''<math>k_1</math>''','''<math>k_2 </math>'''.
 
==Distance of closest approach of two ellipsoids==
Consider two [[ellipsoids]], each with a given [[shape]] and [[Orientation (geometry)|orientation]], whose centers are on a line with given [[Direction (geometry)|direction]]. We wish to determine the distance between centers when the ellipsoids are in point contact externally. This distance of closest approach is a function of the shapes of the ellipsoids and their orientation. There is no analytic solution for this problem, since solving for the distance requires the solution of a sixth order [[polynomial equation]]. Here an [[algorithm]] is developed to determine this distance, based on the analytic results for the distance of closest approach of ellipses in 2D, which can be implemented numerically. Details are given in publications.<ref>X. Zheng, W. Iglesias, P. Palffy-Muhoray, "Distance of closest approach of two arbitrary hard ellipsoids", Phys. Rev. E, 79, 057702 (2009)</ref><ref>X. Zheng, W. Iglesias, P. Palffy-Muhoray, "Distance of closest approach of two arbitrary hard ellipsoids", [http://www.e-lc.org/docs/2008_10_12_23_11_56 electronic Liquid Crystal Communications], 2008</ref> Subroutines are provided in two formats: Fortran90 <ref>[http://www.math.kent.edu/~zheng/ellipsoid.f90 Fortran90 subroutine for distance of closest approach of ellipsoids]</ref> and C.<ref>[http://www.math.kent.edu/~zheng/ellipsoid.c  C subroutine for distance of closest approach of ellipsoids]</ref>
 
===Method===
The algorithm consists of three steps.
# Constructing a plane containing the line joining the centers of the two ellipsoids, and finding the equations of the ellipses formed by the [[Line-plane intersection|intersection]] of this [[Plane (geometry)|plane]] and the [[ellipsoids]].
# Determining the distance of closest approach of the ellipses; that is the distance between the centers of the ellipses when they are in point contact externally.
# Rotating the plane until the distance of closest approach of the ellipses is a [[maximum]]. The distance of closest approach of the ellipsoids is this maximum distance.
 
==References==
<references/>
 
{{DEFAULTSORT:Distance Of Closest Approach Of Ellipses And Ellipsoids}}
[[Category:Conic sections]]

Revision as of 13:33, 7 November 2013

The distance of closest approach of two objects is the distance between their centers when they are externally tangent. The objects may be geometric shapes or physical particles with well defined boundaries. The distance of closest approach is sometimes referred to as the contact distance.

For the simplest objects, spheres, the distance of closest approach is simply the sum of their radii. For non-spherical objects, the distance of closest approach is a function of the orientation of the objects, and its calculation can be difficult. The maximum packing density of hard particles, an important problem of ongoing interest,[1] depends on their distance of closest approach.

The interactions of particles typically depend on their separation, and the distance of closest approach plays an important role in determining the behavior of condensed matter systems.

The excluded volume of particles (the volume excluded to the centers of other particles due to the presence of one) is a key parameter in such descriptions,;[2][3] the distance of closest approach is required to calculate the excluded volume. The excluded volume for identical spheres is just four times the volume of one sphere. For other anisotropic objects, the excluded volume depends on orientation, and its calculation can be surprising difficult.[4] The simplest shapes after spheres are ellipses and ellipsoids; these have received considerable attention,[5] yet their excluded volume is not known. Vieillard Baron was able to provide an overlap criterion for two ellipses. His results were useful for computer simulations of hard particle systems and for packing problems using Monte Carlo simulations.

Two externally tangent ellipses

The one anisotropic shape whose excluded volume can be expressed analytically is the spherocylinder; the solution of this problem is a classic work by Onsager.[6] The problem was tackled by considering the distance between two line segments, which are the center lines of the capped cylinders. Results for other shapes are not readily available. The orientation dependence of the distance of closest approach has surprising consequences. Systems of hard particles, whose interactions are only entropic, can become ordered. Hard spherocylinders form not only orientationally ordered nematic, but also positionally ordered smectic phases.[7] Here, the system gives up some (orientational and even positional) disorder to gain disorder and entropy elsewhere.

Distance of closest approach of two ellipses

Vieillard Baron first investigated this problem, although he did not obtain a result for the distance of closest approach, he derived the overlap criterion for two ellipses. His results were useful for the study of the phase behavior of hard particles and for the packing problem using Monte Carlo simulations. Although overlap criteria have been developed,[8][9] analytic solutions for the distance of closest approach and the location of the point of contact have only recently become available.[10][11] The details of the calculations are provided in Ref.[12] The Fortran 90 subroutine is provided in Ref.[13]

The method

The procedure consists of three steps:

  1. Transformation of the two tangent ellipses and , whose centers are joined by the vector , into a circle and an ellipse , whose centers are joined by the vector . The circle and the ellipse remain tangent after the transformation.
  2. Determination of the distance of closest approach of and analytically. It requires the appropriate solution of a quartic equation. The normal is calculated.
  3. Determination of the distance of closest approach and the location of the point of contact of and by the inverse transformations of the vectors and .

Input:

Output:

Distance of closest approach of two ellipsoids

Consider two ellipsoids, each with a given shape and orientation, whose centers are on a line with given direction. We wish to determine the distance between centers when the ellipsoids are in point contact externally. This distance of closest approach is a function of the shapes of the ellipsoids and their orientation. There is no analytic solution for this problem, since solving for the distance requires the solution of a sixth order polynomial equation. Here an algorithm is developed to determine this distance, based on the analytic results for the distance of closest approach of ellipses in 2D, which can be implemented numerically. Details are given in publications.[14][15] Subroutines are provided in two formats: Fortran90 [16] and C.[17]

Method

The algorithm consists of three steps.

  1. Constructing a plane containing the line joining the centers of the two ellipsoids, and finding the equations of the ellipses formed by the intersection of this plane and the ellipsoids.
  2. Determining the distance of closest approach of the ellipses; that is the distance between the centers of the ellipses when they are in point contact externally.
  3. Rotating the plane until the distance of closest approach of the ellipses is a maximum. The distance of closest approach of the ellipsoids is this maximum distance.

References

  1. ↑ S. Torquato and Y. Jiao, Nature 460, 876-879, 2009
  2. ↑ T.L. Hill, An Introduction to Statistical Thermodynamics (Addison Wesley, London, 1960)
  3. ↑ T.A. Witten, and P.A. Pincus, Structured Fluids (Oxford University Press, Oxford, 2004)
  4. ↑ Forces, Growth and Form in Soft Condensed Matter: At the Interface between Physics and Biology, ed. A.T. Skjeltrop and A.V. Belushkin, (NATO Science Series II: Mathematics, Physics and Chemistry, 2009),
  5. ↑ A. Donev, F.H. Stillinger, P.M. Chaikin and S. Torquato, Phys. Rev. Lett. 92, 255506 (2004)
  6. ↑ L. Onsager, Ann NY Acad Sci, 51, 627 (1949)
  7. ↑ D. Frenkel, J. Phys. Chem. 91, 4912-4916 (1987)
  8. ↑ J. Vieillard-Baron, "Phase transition of the classical hard ellipse system" J. Chem. Phys., 56(10), 4729 (1972).
  9. ↑ J. W. Perram and M. S. Wertheim, "Statistical mechanics of hard ellipsoids. I. overlap algorithm and the contact function", J. Comput. Phys., 58, 409 (1985).
  10. ↑ X. Zheng and P. Palffy-Muhoray, "Distance of closest approach of two arbitrary hard ellipses in two dimensions", electronic Liquid Crystal Communications, 2007
  11. ↑ X. Zheng and P. Palffy-Muhoray, "Distance of closest approach of two arbitrary hard ellipses in two dimensions", Phys. Rev. E, 75, 061709 (2007).
  12. ↑ X. Zheng and P. Palffy-Muhoray, Complete version containing contact point algorithm, May 4, 2009.
  13. ↑ Fortran90 subroutine for contact distance and contact point for 2D ellipses by X. Zheng and P. Palffy-Muhoray, May 2009.
  14. ↑ X. Zheng, W. Iglesias, P. Palffy-Muhoray, "Distance of closest approach of two arbitrary hard ellipsoids", Phys. Rev. E, 79, 057702 (2009)
  15. ↑ X. Zheng, W. Iglesias, P. Palffy-Muhoray, "Distance of closest approach of two arbitrary hard ellipsoids", electronic Liquid Crystal Communications, 2008
  16. ↑ Fortran90 subroutine for distance of closest approach of ellipsoids
  17. ↑ C subroutine for distance of closest approach of ellipsoids
Retrieved from "https://en.formulasearchengine.com/index.php?title=Semigroup_with_involution&oldid=24095"