A Jacobi-like method for computing the Hamiltonian-Schur form of a Hamiltonian matrix is suggested. The method is analogous to the Jacobi-like method of Eberlein for the computation of the Schur form of a general matrix. When used for Hermitian Hamiltonian matrices, the method is equivalent to the Kogbetliantz algorithm. Numerical experiments suggest a fast convergence. The method is used to solve continuous time Riccati equations.