Theorie der elliptischen funktionen. Versuch einer elementaren Darstellung.

Mode of access: Internet.

Jacobi quartic curves revisited

This paper provides new results about efficient arithmetic on Jacobi quartic form elliptic curves, y 2 = d x 4 + 2 a x 2 + 1. With recent bandwidth-efficient proposals, the arithmetic on Jacobi quartic curves became solidly faster than that of Weierstrass curves. These proposals use up to 7 coordinates to represent a single point. However, fast scalar multiplication algorithms based on windowing techniques, precompute and store several points which require more space than what it takes with 3 coordinates. Also note that some of these proposals require d = 1 for full speed. Unfortunately, elliptic curves having 2-times-a-prime number of points, cannot be written in Jacobi quartic form if d = 1. Even worse the contemporary formulae may fail to output correct coordinates for some inputs. This paper provides improved speeds using fewer coordinates without causing the above mentioned problems. For instance, our proposed point doubling algorithm takes only 2 multiplications, 5 squarings, and no multiplication with curve constants when d is arbitrary and a = ±1/2.

Hedwig Jacobi, Alice Bendix, Anna Renner and Klara Mayer Portraits Groups Women

Digital Image

Jacobi-Schlossberg family papers, undated, 1870-2000.

The collection documents the lives Sarah Simon Jacobi (1857-1943), Freda Moritz Jacobi (1886-1939), Alice Jacobi Schlossberg (1912-1987) and Deda Schlossberg Miller (1940- ), through diaries, baby books, photographs, and correspondence. Also included in the collection are a silver card case, a silver coffee pot and creamer, and an etching of the Jacobi family home. For further information on these objects see the museum curator.

The Hamilton-Jacobi equation revisited

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.

Phase space methods and the Hamilton-Jacobi form of dynamics

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.

Jacobi forms and differential operators

We affirmatively answer a question due to S. Bocherer concerning the feasibility of removing one differential operator from the standard collection of m + 1 of them used to embed the space of Jacobi forms of weight 2 and index m into several pieces of elliptic modular forms. (C) 2014 Elsevier Inc. All rights reserved.

迎风紧致格式求解Hamilton-Jacobi方程

基于Hamilton-Jaeobi(H-J)方程和双曲型守恒律之间的关系,将三阶和五阶迎风紧致格式推广应用于求解H-J方程,建立了高精度的H-J方程求解方法.给出了一维和二维典型数值算例的计算结果,其中包括一个平面激波作用下的Richtmyer-Meshkov界面不稳定性问题.数值试验表明,在解的光滑区域该方法具有高精度,而在导数不连续的不光滑区域也获得了比较好的分辨效果.相比于同阶精度的WENO格式,本方法具有更小的数值耗散,从而有利于多尺度复杂流动的模拟中H-J方程的求解.

El Liber Sancti Jacobi y la sacralización universal de las reliquias compostelanas

Resumen: La leyenda franca del descubrimiento de los restos de Santiago plantea una serie de problemas que trascienden la historia del Camino en sí mismo. Desde hace más de quince años he trabajado sobre los vínculos culturales entre Hispania y Galia. Coincidí con la tesis de Rucquoi, sobre las rutas del saber y retrotraje su hipótesis de trabajo hasta el siglo VIII. En este artículo intento exponer mi hipótesis sobre la posible relación entre las reliquias compostelanas y la Sacralización del Imperio Alemán durante el reinado de Federico I Barbarroja.

Hamilton?Jacobi?Bellman equations for quantum optimal feedback control

Gough, John; Belavkin, V.P.; Smolianov, O.G., (2005) 'Hamilton?Jacobi?Bellman equations for quantum optimal feedback control', Journal of Optics B: Quantum and Semiclassical Optics 7 pp.S237-S244 RAE2008

Application of Jacobi algorithm for ISI channels

Here, the Jacobi iterative algorithm is applied to combat intersymbol interference (ISI) caused by frequency-selective channels. The performance bound of the equaliser is analysed in order to gain an insight into its asymptotic behaviour. Because of the error propagation problem, the potential of this algorithm is not reached in an uncoded system. However, its extension to a coded system with the application of the turbo-processing principle results in a new turbo equalisation algorithm, which demonstrates comparable performance with reduced complexity compared with some existing filter-based turbo equalisation schemes; and superior performance compared with some frequency domain solutions, such as orthogonal frequency division multiplexing and single-carrier frequency domain equalisation.