Log in

Relevant bibliographies by topics / Hamiltonian Problem

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Hamiltonian Problem'

Author: Grafiati

Published: 10 March 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Hamiltonian Problem.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Hamiltonian Problem"

1

Sattath, Or, Siddhardh C. Morampudi, Chris R. Laumann, and Roderich Moessner. "When a local Hamiltonian must be frustration-free." Proceedings of the National Academy of Sciences 113, no. 23 (May 19, 2016): 6433–37. http://dx.doi.org/10.1073/pnas.1519833113.

Full text

Abstract:

A broad range of quantum optimization problems can be phrased as the question of whether a specific system has a ground state at zero energy, i.e., whether its Hamiltonian is frustration-free. Frustration-free Hamiltonians, in turn, play a central role for constructing and understanding new phases of matter in quantum many-body physics. Unfortunately, determining whether this is the case is known to be a complexity-theoretically intractable problem. This makes it highly desirable to search for efficient heuristics and algorithms to, at least, partially answer this question. Here we prove a general criterion—a sufficient condition—under which a local Hamiltonian is guaranteed to be frustration-free by lifting Shearer’s theorem from classical probability theory to the quantum world. Remarkably, evaluating this condition proceeds via a fully classical analysis of a hardcore lattice gas at negative fugacity on the Hamiltonian’s interaction graph, which, as a statistical mechanics problem, is of interest in its own right. We concretely apply this criterion to local Hamiltonians on various regular lattices, while bringing to bear the tools of spin glass physics that permit us to obtain new bounds on the satisfiable to unsatisfiable transition in random quantum satisfiability. We are then led to natural conjectures for when such bounds will be tight, as well as to a novel notion of universality for these computer science problems. Besides providing concrete algorithms leading to detailed and quantitative insights, this work underscores the power of marrying classical statistical mechanics with quantum computation and complexity theory.

APA, Harvard, Vancouver, ISO, and other styles

2

ANDRIANOV, A. A., M. V. IOFFE, F. CANNATA, and J. P. DEDONDER. "SUSY QUANTUM MECHANICS WITH COMPLEX SUPERPOTENTIALS AND REAL ENERGY SPECTRA." International Journal of Modern Physics A 14, no. 17 (July 10, 1999): 2675–88. http://dx.doi.org/10.1142/s0217751x99001342.

Full text

Abstract:

We extend the standard intertwining relations used in supersymmetrical (SUSY) quantum mechanics which involve real superpotentials to complex superpotentials. This allows us to deal with a large class of non-Hermitian Hamiltonians and to study in general the isospectrality between complex potentials. In very specific cases we can construct in a natural way "quasicomplex" potentials which we define as complex potentials having a global property so as to lead to a Hamiltonian with real spectrum. We also obtained a class of complex transparent potentials whose Hamiltonian can be intertwined to a free Hamiltonian. We provide a variety of examples both for the radial problem (half axis) and for the standard one-dimensional problem (the whole axis), including remarks concerning scattering problems.

APA, Harvard, Vancouver, ISO, and other styles

3

Bravyi, S., D. P. DiVincenzo, R. Oliveira, and B. M. Terhal. "The complexity of stoquastic local Hamiltonian problems." Quantum Information and Computation 8, no. 5 (May 2008): 361–85. http://dx.doi.org/10.26421/qic8.5-1.

Full text

Abstract:

We study the complexity of the Local Hamiltonian Problem (denoted as LH-MIN) in the special case when a Hamiltonian obeys the condition that all off-diagonal matrix elements in the standard basis are real and non-positive. We will call such Hamiltonians, which are common in the natural world, stoquastic. An equivalent characterization of stoquastic Hamiltonians is that they have an entry-wise non-negative Gibbs density matrix for any temperature. We prove that LH-MIN for stoquastic Hamiltonians belongs to the complexity class \AM{}--- a probabilistic version of \NP{} with two rounds of communication between the prover and the verifier. We also show that $2$-local stoquastic LH-MIN is hard for the class \MA. With the additional promise of having a polynomial spectral gap, we show that stoquastic LH-MIN belongs to the class \POSTBPP=\BPPpath --- a generalization of \BPP{} in which a post-selective readout is allowed. This last result also shows that any problem solved by adiabatic quantum computation using stoquastic Hamiltonians is in PostBPP.

APA, Harvard, Vancouver, ISO, and other styles

4

Zhao, Qi, and Xiao Yuan. "Exploiting anticommutation in Hamiltonian simulation." Quantum 5 (August 31, 2021): 534. http://dx.doi.org/10.22331/q-2021-08-31-534.

Full text

Abstract:

Quantum computing can efficiently simulate Hamiltonian dynamics of many-body quantum physics, a task that is generally intractable with classical computers. The hardness lies at the ubiquitous anti-commutative relations of quantum operators, in corresponding with the notorious negative sign problem in classical simulation. Intuitively, Hamiltonians with more commutative terms are also easier to simulate on a quantum computer, and anti-commutative relations generally cause more errors, such as in the product formula method. Here, we theoretically explore the role of anti-commutative relation in Hamiltonian simulation. We find that, contrary to our intuition, anti-commutative relations could also reduce the hardness of Hamiltonian simulation. Specifically, Hamiltonians with mutually anti-commutative terms are easy to simulate, as what happens with ones consisting of mutually commutative terms. Such a property is further utilized to reduce the algorithmic error or the gate complexity in the truncated Taylor series quantum algorithm for general problems. Moreover, we propose two modified linear combinations of unitaries methods tailored for Hamiltonians with different degrees of anti-commutation. We numerically verify that the proposed methods exploiting anti-commutative relations could significantly improve the simulation accuracy of electronic Hamiltonians. Our work sheds light on the roles of commutative and anti-commutative relations in simulating quantum systems.

APA, Harvard, Vancouver, ISO, and other styles

5

Klassen, Joel, and Barbara M. Terhal. "Two-local qubit Hamiltonians: when are they stoquastic?" Quantum 3 (May 6, 2019): 139. http://dx.doi.org/10.22331/q-2019-05-06-139.

Full text

Abstract:

We examine the problem of determining if a 2-local Hamiltonian is stoquastic by local basis changes. We analyze this problem for two-qubit Hamiltonians, presenting some basic tools and giving a concrete example where using unitaries beyond Clifford rotations is required in order to decide stoquasticity. We report on simple results for n-qubit Hamiltonians with identical 2-local terms on bipartite graphs. Our most significant result is that we give an efficient algorithm to determine whether an arbitrary n-qubit XYZ Heisenberg Hamiltonian is stoquastic by local basis changes.

APA, Harvard, Vancouver, ISO, and other styles

6

WOCJAN, PAWEL, and THOMAS BETH. "THE 2-LOCAL HAMILTONIAN PROBLEM ENCOMPASSES NP." International Journal of Quantum Information 01, no. 03 (September 2003): 349–57. http://dx.doi.org/10.1142/s021974990300022x.

Full text

Abstract:

We show that the NP-complete problems max cut and independent set can be formulated as the 2-local Hamiltonian problem as defined by Kitaev. The 5-local Hamiltonian problem was the first problem to be shown to be complete for the quantum complexity class QMA — the quantum analog of NP. Subsequently, it was shown that 3-locality is already sufficient for QMA-completeness. It is still not known whether the 2-local Hamiltonian problem is QMA-complete. Therefore it is interesting to determine what problems can be reduced to the 2-local Hamiltonian problem. Kitaev showed that 3-SAT can be formulated as a 3-local Hamiltonian problem. We extend his result by showing that 2-locality is sufficient in order to encompass NP.

APA, Harvard, Vancouver, ISO, and other styles

7

Gamboa, J., and F. Méndez. "Deformed quantum mechanics and the Landau problem." Modern Physics Letters A 36, no. 18 (June 14, 2021): 2150126. http://dx.doi.org/10.1142/s0217732321501261.

Full text

Abstract:

A deformation of the Landau problem based on a modification of Fock algebra is considered. Systems with the Hamiltonians [Formula: see text] where [Formula: see text] is the Landau Hamiltonian in the lowest level are discussed. The case [Formula: see text] is studied and it is shown that in this particular example, parameters of the problem can be fixed by using the quadratic Zeeman effect data and the Breit–Rabi formula.

APA, Harvard, Vancouver, ISO, and other styles

8

NEIDHARDT, HAGEN, and VALENTIN ZAGREBNOV. "TOWARDS THE RIGHT HAMILTONIAN FOR SINGULAR PERTURBATIONS VIA REGULARIZATION AND EXTENSION THEORY." Reviews in Mathematical Physics 08, no. 05 (July 1996): 715–40. http://dx.doi.org/10.1142/s0129055x96000251.

Full text

Abstract:

For singular potentials in quantum mechanics it can happen that the Schrödinger operator is not esssentially self-adjoint on a natural domain, i.e., each self-adjoint extension is a candidate for the right physical Hamiltonian. Traditional way to single out this Hamiltonian is the removing cut-offs for regularizing potential. Connecting regularization and extension theory we develop an abstract operator method to treat the problem of the right Hamiltonian. We show that, using the notion of the maximal (with respect to the perturbation) Friedrichs extension of unperturbed operator, one can classify the above problem as wellposed or ill-posed depending on intersection of the quadratic form domain of perturbation and deficiency subspace corresponding to restriction of unperturbed operator to stability domain. If this intersection is trivial, then the right Hamiltonian is unique: it coincides with the form sum of perturbation and the Friedrich extension of the unperturbed operator restricted to the stability domain. Otherwise it is not unique: the family of “right Hamiltonians” can be described in terms of symmetric extensions reducing the ill-posed problem to the well-posed problem.

APA, Harvard, Vancouver, ISO, and other styles

9

LALONDE, FRANÇOIS, and ANDREI TELEMAN. "THE g-AREAS AND THE COMMUTATOR LENGTH." International Journal of Mathematics 24, no. 07 (June 2013): 1350057. http://dx.doi.org/10.1142/s0129167x13500572.

Full text

Abstract:

The commutator length of a Hamiltonian diffeomorphism f ∈ Ham (M,ω) of a closed symplectic manifold (M,ω) is by definition the minimal k such that f can be written as a product of k commutators in Ham (M,ω). We introduce a new invariant for Hamiltonian diffeomorphisms, called the k+-area, which measures the "distance", in a certain sense, to the subspace [Formula: see text] of all products of k commutators. Therefore, this invariant can be seen as the obstruction to writing a given Hamiltonian diffeomorphism as a product of k commutators. We also consider an infinitesimal version of the commutator problem: what is the obstruction to writing a Hamiltonian vector field as a linear combination of k Lie brackets of Hamiltonian vector fields? A natural problem related to this question is to describe explicitly, for every fixed k, the set of linear combinations of k such Lie brackets. The problem can be obviously reformulated in terms of Hamiltonians and Poisson brackets. For a given Morse function f on a symplectic Riemann surface M (verifying a weak genericity condition) we describe the linear space of commutators of the form {f, g}, with [Formula: see text].

APA, Harvard, Vancouver, ISO, and other styles

10

Godinho, Leonor, and M. E. Sousa-Dias. "The Fundamental Group ofS1-manifolds." Canadian Journal of Mathematics 62, no. 5 (October 1, 2010): 1082–98. http://dx.doi.org/10.4153/cjm-2010-053-3.

Full text

Abstract:

AbstractWe address the problem of computing the fundamental group of a symplecticS1-manifold for non-Hamiltonian actions on compact manifolds, and for Hamiltonian actions on non-compact manifolds with a proper moment map. We generalize known results for compact manifolds equipped with a HamiltonianS1-action. Several examples are presented to illustrate our main results.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Hamiltonian Problem"

1

Schütte, Albrecht. "Hamiltonian flow equations and the electron phonon problem." [S.l. : s.n.], 2002. http://deposit.ddb.de/cgi-bin/dokserv?idn=964423294.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Bredariol, Grilo Alex. "Quantum proofs, the local Hamiltonian problem and applications." Thesis, Sorbonne Paris Cité, 2018. http://www.theses.fr/2018USPCC051/document.

Full text

Abstract:

Dans la classe de complexité QMA – la généralisation quantique de la classe NP – un état quantique est fourni comme preuve à un algorithme de vérification pour l’aider à résoudre un problème. Cette classe de complexité a un problème complet naturel, le problème des Hamiltoniens locaux. Inspiré par la Physique de la matière condensée, ce problème concerne l’énergie de l’état fondamental d’un système quantique. Dans le cadre de cette thèse, nous étudions quelques problèmes liés à la classe QMA et au problème des Hamiltoniens locaux. Premièrement, nous étudions la différence de puissance si au lieu d’une preuve quantique, l’algorithme de vérification quantique reçoit une preuve classique. Nous proposons un cadre intermédiaire à ces deux cas, où la preuve consiste en un état quantique “plus simple” et nous arrivons à démontrer que ces états plus simples sont suffisants pour résoudre tous les problèmes dans QMA. À partir de ce résultat, nous obtenons un nouveau problème QMA-complet et nous étudions aussi la version de notre nouvelle classe de complexité avec erreur unilatérale. Ensuite, nous proposons le premier schéma de délégation vérifiable relativiste de calcul quantique. Dans ce cadre, un client classique délègue son calcul quantique à deux serveurs quantiques intriqués. Ces serveurs peuvent communiquer entre eux en respectant l’hypothèse que l’information ne peut pas être propagé plus vite que la vitesse de la lumière. Ce protocole a été conçu à partir d’un jeu non-local pour le problème des Hamiltoniens locaux avec deux prouveurs et un tour de communication. Dans ce jeu, les prouveurs exécutent des calculs quantiques de temps polynomiaux sur des copies de l’état fondamental du Hamiltonien. Finalement, nous étudions la conjecture PCP quantique, où l’on demande si tous les problèmes dans la classe QMA acceptent un système de preuves où l’algorithme de vérification a accès à un nombre constant de qubits de la preuve quantique. Notre première contribution consiste à étendre le modèle QPCP avec une preuve auxiliaire classique. Pour attaquer le problème, nous avons proposé une version plus faible de la conjecture QPCP pour ce nouveau système de preuves. Nous avons alors montré que cette nouvelle conjecture peut également être exprimée dans le contexte des problèmes des Hamiltoniens locaux et ainsi que dans lecadre de la maximisation de la probabilité de acceptation des jeux quantiques. Notre résultat montre la première équivalence entre un jeu multi-prouveur et une conjecture QPCP
In QMA, the quantum generalization of the complexity class NP, a quantum state is provided as a proof of a mathematical statement, and this quantum proof can be verified by a quantum algorithm. This complexity class has a very natural complete problem, the Local Hamiltonian problem. Inspired by Condensed Matters Physics, this problem concerns the groundstate energy of quantum systems. In this thesis, we study some problems related to QMA and to the Local Hamiltonian problem. First, we study the difference of power when classical or quantum proofs are provided to quantum verification algorithms. We propose an intermediate setting where the proof is a “simpler” quantum state, and we manage to prove that these simpler states are enough to solve all problems in QMA. From this result, we are able to present a new QMA-complete problem and we also study the one-sided error version of our new complexity class. Secondly, we propose the first relativistic verifiable delegation scheme for quantum computation. In this setting, a classical client delegates her quantumcomputation to two entangled servers who are allowed to communicate, but respecting the assumption that information cannot be propagated faster than speed of light. This protocol is achieved through a one-round two-prover game for the Local Hamiltonian problem where provers only need polynomial time quantum computation and access to copies of the groundstate of the Hamiltonian. Finally, we study the quantumPCP conjecture, which asks if all problems in QMA accept aproof systemwhere only a fewqubits of the proof are checked. Our result consists in proposing an extension of QPCP proof systems where the verifier is also provided an auxiliary classical proof. Based on this proof system, we propose a weaker version of QPCP conjecture. We then show that this new conjecture can be formulated as a Local Hamiltonian problem and also as a problem involving the maximum acceptance probability of multi-prover games. This is the first equivalence of a multi-prover game and some QPCP statement

APA, Harvard, Vancouver, ISO, and other styles

3

Benner, Peter, and Cedric Effenberger. "A rational SHIRA method for the Hamiltonian eigenvalue problem." Universitätsbibliothek Chemnitz, 2009. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-200900026.

Full text

Abstract:

The SHIRA method of Mehrmann and Watkins belongs among the structure preserving Krylov subspace methods for solving skew-Hamiltonian eigenvalue problems. It can also be applied to Hamiltonian eigenproblems by considering a suitable transformation. Structure induced shift-and-invert techniques are employed to steer the algorithm towards the interesting region of the spectrum. However, the shift cannot be altered in the middle of the computation without discarding the information that has been accumulated so far. This paper shows how SHIRA can be combined with ideas from Ruhe's Rational Krylov algorithm to yield a method that permits an adjustment of shift after every step of the computation, adding greatly to the flexibility of the algorithm. We call this new method rational SHIRA. A numerical example is presented to demonstrate its efficiency.

APA, Harvard, Vancouver, ISO, and other styles

4

Gu, Xiang. "Hamiltonian structures and Riemann-Hilbert problems of integrable systems." Scholar Commons, 2018. https://scholarcommons.usf.edu/etd/7677.

Full text

Abstract:

We begin this dissertation by presenting a brief introduction to the theory of solitons and integrability (plus some classical methods applied in this field) in Chapter 1, mainly using the Korteweg-de Vries equation as a typical model. At the end of this Chapter a mathematical framework of notations and terminologies is established for the whole dissertation. In Chapter 2, we first introduce two specific matrix spectral problems (with 3 potentials) associated with matrix Lie algebras $\mbox{sl}(2;\mathbb{R})$ and $\mbox{so}(3;\mathbb{R})$, respectively; and then we engender two soliton hierarchies. The computation and analysis of their Hamiltonian structures based on the trace identity affirms that the obtained hierarchies are Liouville integrable. This chapter shows the entire process of how a soliton hierarchy is engendered by starting from a proper matrix spectral problem. In Chapter 3, at first we elucidate the Gauge equivalence among three types $u$-linear Hamiltonian operators, and construct then the corresponding B\"acklund transformations among them explicitly. Next we derive the if-and-only-if conditions under which the linear coupling of the discussed u-linear operators and matrix differential operators with constant coefficients is still Hamiltonian. Very amazingly, the derived conditions show that the resulting Hamiltonian operators is truncated only up to the 3rd differential order. Finally, a few relevant examples of integrable hierarchies are illustrated. In Chapter, 4 we first present a generalized modified Korteweg-de Vries hierarchy. Then for one of the equations in this hierarchy, we build the associated Riemann-Hilbert problems with some equivalent spectral problems. Next, computation of soliton solutions is performed by reducing the Riemann-Hilbert problems to those with identity jump matrix, i.e., those correspond to reflectionless inverse scattering problems. Finally a special reduction of the original matrix spectral problem will be briefly discussed.

APA, Harvard, Vancouver, ISO, and other styles

5

Benner, P., and H. Faßbender. "A restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem." Universitätsbibliothek Chemnitz, 1998. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-199800797.

Full text

Abstract:

A restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem is presented. The Lanczos vectors are constructed to form a symplectic basis. Breakdowns and near-breakdowns are overcome by inexpensive implicit restarts. The method is used to compute eigenvalues, eigenvectors and invariant subspaces of large and sparse Hamiltonian matrices and low rank approximations to the solution of continuous-time algebraic Riccati equations with large and sparse coefficient matrices.

APA, Harvard, Vancouver, ISO, and other styles

6

Gupta, Vishal. "Decoupling of Hamiltonian system with applications to linear quadratic problem." Arlington, TX : University of Texas at Arlington, 2007. http://hdl.handle.net/10106/905.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Bowles, Mark Nicholas. "A stability result for the lunar three body problem." Thesis, University of Warwick, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.367149.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Jones, Billy Darwin. "Light-front Hamiltonian approach to the bound-state problem in quantum electrodynamics /." The Ohio State University, 1997. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487946103569513.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

NASCIMENTO, Francisco José dos Santos. "Estabilidade Linear no Problema de Robe." Universidade Federal do Maranhão, 2017. http://tedebc.ufma.br:8080/jspui/handle/tede/1309.

Full text

Abstract:

Submitted by Maria Aparecida (cidazen@gmail.com) on 2017-04-19T13:09:32Z No. of bitstreams: 1 Francisco José dos Santos Nascimento.pdf: 743351 bytes, checksum: 997f8a5009a3bbc979a7206041daf583 (MD5)
Made available in DSpace on 2017-04-19T13:09:32Z (GMT). No. of bitstreams: 1 Francisco José dos Santos Nascimento.pdf: 743351 bytes, checksum: 997f8a5009a3bbc979a7206041daf583 (MD5) Previous issue date: 2017-02-17
CAPES
In this work, we discuss the article The Existence and Stability of Equilibrium Points in the Robe Restricted Three-Body Probem due to Hallan and Rana. For this we present some basic definitions and results abut Hamiltonian systems such as equilibrium stability of linear Hamiltonian systems. We set out the restricted problem of the three bodies and show some classic results of the problem. Finally we present the Robe’s problem and discuss the main results using Hamiltonian systems theory.
Nesse trabalho, dissertamos sobre o artigo \The Existence and Stability of Equilibrium Points in the Robe Restricted Three-Body Probem" devido a Hallan e Rana. Para isso apresentamos definições e resultados básicos sobre sistemas Hamiltonianos tais como estabilidade de equilíbrios de sistemas Hamiltonianos lineares. Enunciamos o problema restrito dos três corpos e mostramos alguns resultados clássicos do problema. Por fim apresentamos o problema de Robe e discutimos os principais resultados usando a teoria de sistemas Hamiltonianos.

APA, Harvard, Vancouver, ISO, and other styles

10

Barrow-Green, June. "Poincaré and the three body problem." n.p, 1993. http://ethos.bl.uk/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Hamiltonian Problem"

1

Borkar, Vivek S., Vladimir Ejov, Jerzy A. Filar, and Giang T. Nguyen. Hamiltonian Cycle Problem and Markov Chains. New York, NY: Springer New York, 2012. http://dx.doi.org/10.1007/978-1-4614-3232-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Suris, Yuri B. The Problem of Integrable Discretization: Hamiltonian Approach. Basel: Birkhäuser Basel, 2003. http://dx.doi.org/10.1007/978-3-0348-8016-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Suris, Yuri B. The Problem of Integrable Discretization: Hamiltonian Approach. Basel: Birkhäuser Basel, 2003.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Neumann systems for the algebraic AKNS problem. Providence, RI: American Mathematical Society, 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Bryuno, Aleksandr D. The restricted 3-body problem: Plane periodic orbits. New York: W.de Gruyter, 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

The restricted 3-body problem: Plane periodic orbits. New York: W. de Gruyter, 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Meyer, Kenneth R., and Daniel C. Offin. Introduction to Hamiltonian Dynamical Systems and the N-Body Problem. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-53691-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Meyer, Kenneth R., and Glen R. Hall. Introduction to Hamiltonian Dynamical Systems and the N-Body Problem. New York, NY: Springer New York, 1992. http://dx.doi.org/10.1007/978-1-4757-4073-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Meyer, Kenneth, Glen Hall, and Dan Offin. Introduction to Hamiltonian Dynamical Systems and the N-Body Problem. New York, NY: Springer New York, 2009. http://dx.doi.org/10.1007/978-0-387-09724-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Meyer, Kenneth R. Introduction to Hamiltonian Dynamical Systems and the N-Body Problem. New York, NY: Springer New York, 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Hamiltonian Problem"

1

Suris, Yuri B. "Hamiltonian Mechanics." In The Problem of Integrable Discretization: Hamiltonian Approach, 3–50. Basel: Birkhäuser Basel, 2003. http://dx.doi.org/10.1007/978-3-0348-8016-9_1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Celletti, Alessandra. "Librational Invariant Surfaces in the Spin-Orbit Problem." In Hamiltonian Mechanics, 229–35. Boston, MA: Springer US, 1994. http://dx.doi.org/10.1007/978-1-4899-0964-0_21.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Meyer, Kenneth R., and Daniel C. Offin. "Hamiltonian Systems." In Introduction to Hamiltonian Dynamical Systems and the N-Body Problem, 29–60. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-53691-0_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Meyer, Kenneth, Glen Hall, and Dan Offin. "Hamiltonian Systems." In Introduction to Hamiltonian Dynamical Systems and the N-Body Problem, 1–25. New York, NY: Springer New York, 2009. http://dx.doi.org/10.1007/978-0-387-09724-4_1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Magri, Franco. "The Hamiltonian route to Sato Grassmannian." In The Bispectral Problem, 203–9. Providence, Rhode Island: American Mathematical Society, 1998. http://dx.doi.org/10.1090/crmp/014/14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Meyer, Kenneth R., and Glen R. Hall. "Linear Hamiltonian Systems." In Introduction to Hamiltonian Dynamical Systems and the N-Body Problem, 33–71. New York, NY: Springer New York, 1992. http://dx.doi.org/10.1007/978-1-4757-4073-8_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Meyer, Kenneth, Glen Hall, and Dan Offin. "Linear Hamiltonian Systems." In Introduction to Hamiltonian Dynamical Systems and the N-Body Problem, 45–68. New York, NY: Springer New York, 2009. http://dx.doi.org/10.1007/978-0-387-09724-4_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Mielke, Alexander. "Saint-Venant's problem." In Hamiltonian and Lagrangian Flows on Center Manifolds, 121–31. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/bfb0097555.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Faddeev, Ludwig D., and Leon A. Takhtajan. "The Riemann Problem." In Hamiltonian Methods in the Theory of Solitons, 81–185. Berlin, Heidelberg: Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/978-3-540-69969-9_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Meyer, Kenneth R., and Quidong Wang. "The Global Phase Structure of the Three Dimensional Isosceles Three Body Problem with Zero Energy." In Hamiltonian Dynamical Systems, 265–82. New York, NY: Springer New York, 1995. http://dx.doi.org/10.1007/978-1-4613-8448-9_18.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Hamiltonian Problem"

1

Sleegers, Joeri, Sarah Thomson, and Daan van Den Berg. "Universally Hard Hamiltonian Cycle Problem Instances." In 14th International Conference on Evolutionary Computation Theory and Applications. SCITEPRESS - Science and Technology Publications, 2022. http://dx.doi.org/10.5220/0011531900003332.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Chailloux, Andre, and Or Sattath. "The Complexity of the Separable Hamiltonian Problem." In 2012 IEEE Conference on Computational Complexity (CCC). IEEE, 2012. http://dx.doi.org/10.1109/ccc.2012.42.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Delic, N. V., S. Pelemis, and J. P. Setrajcic. "About eigen-problem of single photon Hamiltonian." In 2008 26th International Conference on Microelectronics (MIEL 2008). IEEE, 2008. http://dx.doi.org/10.1109/icmel.2008.4559240.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Olmos, Ivan, Jesus A. Gonzalez, and Mauricio Osorio. "Reductions between the Subgraph Isomorphism Problem and Hamiltonian and SAT Problems." In 17th International Conference on Electronics, Communications and Computers (CONIELECOMP'07). IEEE, 2007. http://dx.doi.org/10.1109/conielecomp.2007.30.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Han, S. L., and O. A. Bauchau. "On the Almansi-Michell Problem for Flexible Multibody Dynamics." In ASME 2015 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2015. http://dx.doi.org/10.1115/detc2015-47154.

Full text

Abstract:

In flexible multibody systems, it is convenient to approximate many structural components as beams. In classical beam theories, such as Timoshenko beam theory, the beams cross-section is assumed to remain plane. While such assuption is capable of capturing the kinetic energy of the system accurately, it cannot represent the strain energy adequately. In the authorss recent paper, an systematic approach was proposed for the modeling of three-dimensional beam problems. The proposed approach is based on the Hamiltonian formalism and leads to an expansion of the solution in terms of extremity and central solutions. This paper extends the previous approach to the “Almansi-Michell problem,” i.e., three dimensional beams subjected to distributed loads. Such problems can be represented by non-homogenous Hamiltonian systems, in contrast with Saint-Venants problem, which is represented by homogenous Hamiltonian systems. The solutions of Almansi-Michells problem are not only determined by the Hamiltonian coefficient matrix but also by the applied loading distribution patterns. hence, the contributions of the loading pattern need to be taken into account. A dimensional reduction procedure is proposed and the three-dimensional governing equations of Almansi-Michells problem can be reduced to a set of one-dimensional beams equations. Furthermore, the three-dimensional displacements and stress components can be recovered from the one-dimensional beams solution.

APA, Harvard, Vancouver, ISO, and other styles

6

Maretic, Hermina Petric, and Ante Grbic. "A heuristics approach to Hamiltonian completion problem (HCP)." In 2015 38th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO). IEEE, 2015. http://dx.doi.org/10.1109/mipro.2015.7160528.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Benner, Peter, Volker Mehrmann, and Hongguo Xu. "A new method for the Hamiltonian eigenvalue problem." In 1997 European Control Conference (ECC). IEEE, 1997. http://dx.doi.org/10.23919/ecc.1997.7082590.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Sleegers, Joeri, and Daan van den Berg. "Looking for the Hardest Hamiltonian Cycle Problem Instances." In 12th International Conference on Evolutionary Computation Theory and Applications. SCITEPRESS - Science and Technology Publications, 2020. http://dx.doi.org/10.5220/0010066900400048.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Chonghui Sun, Zhi Wang, Xiao Gong, Qiang Li, Chongqing Wu, Xiaojia Song, and Yansi Le. "Solving the Hamiltonian path problem using optical fiber network." In 2016 15th International Conference on Optical Communications and Networks (ICOCN). IEEE, 2016. http://dx.doi.org/10.1109/icocn.2016.7875757.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Ishii, K., A. Fujiwara, and H. Tagawa. "Asynchronous P systems for SAT and Hamiltonian cycle problem." In 2010 Second World Congress on Nature and Biologically Inspired Computing (NaBIC 2010). IEEE, 2010. http://dx.doi.org/10.1109/nabic.2010.5716305.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Hamiltonian Problem"

1

Tessarotto, M., Lin Jin Zheng, and J. L. Johnson. Hamiltonian approach to the magnetostatic equilibrium problem. Office of Scientific and Technical Information (OSTI), February 1995. http://dx.doi.org/10.2172/10115867.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Kyuldjiev, Assen, Vladimir Gerdjikov, and Giuseppe Marmo. On Superintegrability of The Manev Problem and its Real Hamiltonian Form. GIQ, 2012. http://dx.doi.org/10.7546/giq-6-2005-262-275.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Kyuldjiev, Assen, Vladimir Gerdjikov, and Giuseppe Marmo. On the Symmetries of the Manev Problem and Its Real Hamiltonian Form. GIQ, 2012. http://dx.doi.org/10.7546/giq-8-2007-221-233.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Miller, D. L., J. F. Pekny, and G. L. Thompson. AN Exact Algorithm for Finding Undirected Hamiltonian Cycles Based on a Two-Matching Problem Relaxation. Fort Belvoir, VA: Defense Technical Information Center, March 1991. http://dx.doi.org/10.21236/ada237241.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Kandrup, H. E., and P. J. Morrison. Hamiltonian structure of the Vlasov-Einstein system and the problem of stability for spherical relativistic star clusters. Office of Scientific and Technical Information (OSTI), November 1992. http://dx.doi.org/10.2172/10120708.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Kandrup, H. E., and P. J. Morrison. Hamiltonian structure of the Vlasov-Einstein system and the problem of stability for spherical relativistic star clusters. Office of Scientific and Technical Information (OSTI), November 1992. http://dx.doi.org/10.2172/6789042.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Libura, Marek. Sensitivity Analysis for Shortest Hamiltonian Path and Traveling Salesman Problems. Fort Belvoir, VA: Defense Technical Information Center, April 1988. http://dx.doi.org/10.21236/ada197167.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!