Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userQuantitative predictions with detuned normal forms
89
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
The phase-space structure of two families of galactic potentials is approximated with a resonant detuned normal form. The normal form series is obtained by a Lie transform of the series expansion around the minimum of the original Hamiltonian. Attention is focused on the quantitative predictive ability of the normal form. We find analytical expressions for bifurcations of periodic orbits and compare them with other analytical approaches and with numerical results. The predictions are quite reliable even outside the convergence radius of the perturbation and we analyze this result using resummation techniques of asymptotic series.
rate research
Read More
We discuss various bifurcation problems in which two isolated periodic orbits exchange periodic ``bridge orbit(s) between two successive bifurcations. We propose normal forms which locally describe the corresponding fixed point scenarios on the Poincare surface of section. Uniform approximations for the density of states for an integrable Hamiltonian system with two degrees of freedom are derived and successfully reproduce the numerical quantum-mechanical results.
We discuss the history of the monodromy theorem, starting from Weierstrass, and the concept of monodromy group. From this viewpoint we compare then the Weierstrass , the Legendre and other normal forms for elliptic curves, explaining their geometric meaning and distinguishing them by their stabilizer in P SL(2,Z) and their monodromy. Then we focus on the birth of the concept of the Jacobian variety, and the geometrization of the theory of Abelian functions and integrals. We end illustrating the methods of complex analysis in the simplest issue, the difference equation $f(z) = g(z+1) - g(z)$ on $mathbb C$.
We investigate the behavior of the second fundamental form of an isometric immersion of a space form with negative curvature into a space form so that the extrinsic curvature is negative. If the immersion has flat normal bundle, we prove that its second fundamental form grows exponentially.
Quantum Decision Theory, advanced earlier by the authors, and illustrated for lotteries with gains, is generalized to the games containing lotteries with gains as well as losses. The mathematical structure of the approach is based on the theory of quantum measurements, which makes this approach relevant both for the description of decision making of humans and the creation of artificial quantum intelligence. General rules are formulated allowing for the explicit calculation of quantum probabilities representing the fraction of decision makers preferring the considered prospects. This provides a method to quantitatively predict decision-maker choices, including the cases of games with high uncertainty for which the classical expected utility theory fails. The approach is applied to experimental results obtained on a set of lottery gambles with gains and losses. Our predictions, involving no fitting parameters, are in very good agreement with experimental data. The use of quantum decision making in game theory is described. A principal scheme of creating quantum artificial intelligence is suggested.
We propose a new algorithm for computing the tensor rank decomposition or canonical polyadic decomposition of higher-order tensors subject to a rank and genericity constraint. Reformulating this as a system of polynomial equations allows us to leverage recent numerical linear algebra tools from computational algebraic geometry. We describe the complexity of our algorithm in terms of the multigraded regularity of a multihomogeneous ideal. We prove effective bounds for many formats and ranks and conjecture a general formula. These bounds are of independent interest for overconstrained polynomial system solving. Our experiments show that our algorithm can outperform state-of-the-art algebraic algorithms by an order of magnitude in terms of accuracy, computation time, and memory consumption.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
