983 resultados para Hamilton, Alexander.
Resumo:
Digital image
Resumo:
Digital image
Resumo:
Digital image
Resumo:
Digital image
Resumo:
A new analysis of the nature of the solutions of the Hamilton-Jacobi equation of classical dynamics is presented based on Caratheodory’s theorem concerning canonical transformations. The special role of a principal set of solutions is stressed, and the existence of analogous results in quantum mechanics is outlined.
Resumo:
Two letters from Rabbi Leo Baeck in London to Mrs. Fred Alexander in Belmont, MA pertaining to common acquaintances in Theresienstadt; Dec. 10, 1945 and Jan 3, 1947.
Resumo:
We present a new approach to Hamilton's theory of turns for the groups SO(3) and SU(2) which renders their properties, in particular their composition law, nearly trivial and immediately evident upon inspection. We show that the entire construction can be based on binary rotations rather than mirror reflections.
Resumo:
A detailed study is presented of the expected performance of the ATLAS detector. The reconstruction of tracks, leptons, photons, missing energy and jets is investigated, together with the performance of b-tagging and the trigger. The physics potential for a variety of interesting physics processes, within the Standard Model and beyond, is examined. The study comprises a series of notes based on simulations of the detector and physics processes, with particular emphasis given to the data expected from the first years of operation of the LHC at CERN.
Resumo:
A general analysis of the Hamilton-Jacobi form of dynamics motivated by phase space methods and classical transformation theory is presented. The connection between constants of motion, symmetries, and the Hamilton-Jacobi equation is described.
Resumo:
The domination and Hamilton circuit problems are of interest both in algorithm design and complexity theory. The domination problem has applications in facility location and the Hamilton circuit problem has applications in routing problems in communications and operations research.The problem of deciding if G has a dominating set of cardinality at most k, and the problem of determining if G has a Hamilton circuit are NP-Complete. Polynomial time algorithms are, however, available for a large number of restricted classes. A motivation for the study of these algorithms is that they not only give insight into the characterization of these classes but also require a variety of algorithmic techniques and data structures. So the search for efficient algorithms, for these problems in many classes still continues.A class of perfect graphs which is practically important and mathematically interesting is the class of permutation graphs. The domination problem is polynomial time solvable on permutation graphs. Algorithms that are already available are of time complexity O(n2) or more, and space complexity O(n2) on these graphs. The Hamilton circuit problem is open for this class.We present a simple O(n) time and O(n) space algorithm for the domination problem on permutation graphs. Unlike the existing algorithms, we use the concept of geometric representation of permutation graphs. Further, exploiting this geometric notion, we develop an O(n2) time and O(n) space algorithm for the Hamilton circuit problem.
Resumo:
基于Hamilton-Jaeobi(H-J)方程和双曲型守恒律之间的关系,将三阶和五阶迎风紧致格式推广应用于求解H-J方程,建立了高精度的H-J方程求解方法.给出了一维和二维典型数值算例的计算结果,其中包括一个平面激波作用下的Richtmyer-Meshkov界面不稳定性问题.数值试验表明,在解的光滑区域该方法具有高精度,而在导数不连续的不光滑区域也获得了比较好的分辨效果.相比于同阶精度的WENO格式,本方法具有更小的数值耗散,从而有利于多尺度复杂流动的模拟中H-J方程的求解.
Resumo:
在海洋水域,界面波对大尺度变化流的作用是一种典型的分层流动现象。考虑一不可压缩、无黏的分层势流运动,建立了一个在非平整运动海底上的n层流体演化系统,并对其进行了Hamilton描述。每层流体具有各自的常密度、均匀流水平速度,其厚度由未扰动和扰动部分构成。相对于顶层流体的自由表面,刚性、运动的海底具有一般地形变化特征。在明确指出n层流体运动的控制方程和各层交界面上的运动学、动力学边界条件(包含各层交界面上张力效应)后,对该分层动力系统进行了Hamilton构造,即给出其正则方程和其下述的正则变量:各交界面位移和各交界面上的动量势密度差。
Resumo:
Biography with photograph