An efficient and stable structure preserving algorithm, which is a variant of the QR like (SR) algorithm due to Bunse-Gerstner and Mehrmann, is presented for computing the eigenvalues and stable invariant subspaces of...An efficient and stable structure preserving algorithm, which is a variant of the QR like (SR) algorithm due to Bunse-Gerstner and Mehrmann, is presented for computing the eigenvalues and stable invariant subspaces of a Hamiltonian matrix. In the algorithm two strategies are employed, one of which is called dis-unstabilization technique and the other is preprocessing technique. Together with them, a so-called ratio-reduction equation and a backtrack technique are introduced to avoid the instability and breakdown in the original algorithm. It is shown that the new algorithm can overcome the instability and breakdown at low cost. Numerical results have demonstrated that the algorithm is stable and can compute the eigenvalues to very high accuracy.展开更多
The structure of a Hamiltonian matrix for a quantum chaotic system, the nuclear octupole deformation model, has been discussed in detail. The distribution of the eigenfunctions of this system expanded by the eigenstat...The structure of a Hamiltonian matrix for a quantum chaotic system, the nuclear octupole deformation model, has been discussed in detail. The distribution of the eigenfunctions of this system expanded by the eigenstates of a quantum integrable system is studied with the help of generalized Brillouin?Wigner perturbation theory. The results show that a significant randomness in this distribution can be observed when its classical counterpart is under the strong chaotic condition. The averaged shape of the eigenfunctions fits with the Gaussian distribution only when the effects of the symmetry have been removed.展开更多
A simple approach to the formation of a Hamiltonian matrix for some Schrodinger equations describing the molecules with large amplitude motions has been proposed. The algorithm involving one or several variables has b...A simple approach to the formation of a Hamiltonian matrix for some Schrodinger equations describing the molecules with large amplitude motions has been proposed. The algorithm involving one or several variables has been concretely defined for the basis functions represented by Fourier series and orthogonal polynomials, taking Hermitian polynomials as an example.展开更多
Fundamental theory presented in Part (I)[8] is used to analyze anisotropic plane stress problems. First we construct the generalized variational principle to enter Hamiltonian system and get Hamiltonian differential o...Fundamental theory presented in Part (I)[8] is used to analyze anisotropic plane stress problems. First we construct the generalized variational principle to enter Hamiltonian system and get Hamiltonian differential operator matrix; then we solve eigen problem; finally, we present the process of obtaining analytical solutions and semi-analytical solutions for anisotropic plane stress porblems on rectangular area.展开更多
This paper presents a high order symplectic con- servative perturbation method for linear time-varying Hamil- tonian system. Firstly, the dynamic equation of Hamilto- nian system is gradually changed into a high order...This paper presents a high order symplectic con- servative perturbation method for linear time-varying Hamil- tonian system. Firstly, the dynamic equation of Hamilto- nian system is gradually changed into a high order pertur- bation equation, which is solved approximately by resolv- ing the Hamiltonian coefficient matrix into a "major compo- nent" and a "high order small quantity" and using perturba- tion transformation technique, then the solution to the orig- inal equation of Hamiltonian system is determined through a series of inverse transform. Because the transfer matrix determined by the method in this paper is the product of a series of exponential matrixes, the transfer matrix is a sym- plectic matrix; furthermore, the exponential matrices can be calculated accurately by the precise time integration method, so the method presented in this paper has fine accuracy, ef- ficiency and stability. The examples show that the proposed method can also give good results even though a large time step is selected, and with the increase of the perturbation or- der, the perturbation solutions tend to exact solutions rapidly.展开更多
We present in this paper a new method for solving polynomial eigenvalue problem. We give methods that decompose a skew-Hamiltonian matrix using Cholesky like-decomposition. We transform first the polynomial eigenvalue...We present in this paper a new method for solving polynomial eigenvalue problem. We give methods that decompose a skew-Hamiltonian matrix using Cholesky like-decomposition. We transform first the polynomial eigenvalue problem to an equivalent skew-Hamiltonian/Hamiltonian pencil. This process is known as linearization. Decomposition of the skew-Hamiltonian matrix is the fundamental step to convert a structured polynomial eigenvalue problem into a standard Hamiltonian eigenproblem. Numerical examples are given.展开更多
文摘An efficient and stable structure preserving algorithm, which is a variant of the QR like (SR) algorithm due to Bunse-Gerstner and Mehrmann, is presented for computing the eigenvalues and stable invariant subspaces of a Hamiltonian matrix. In the algorithm two strategies are employed, one of which is called dis-unstabilization technique and the other is preprocessing technique. Together with them, a so-called ratio-reduction equation and a backtrack technique are introduced to avoid the instability and breakdown in the original algorithm. It is shown that the new algorithm can overcome the instability and breakdown at low cost. Numerical results have demonstrated that the algorithm is stable and can compute the eigenvalues to very high accuracy.
文摘The structure of a Hamiltonian matrix for a quantum chaotic system, the nuclear octupole deformation model, has been discussed in detail. The distribution of the eigenfunctions of this system expanded by the eigenstates of a quantum integrable system is studied with the help of generalized Brillouin?Wigner perturbation theory. The results show that a significant randomness in this distribution can be observed when its classical counterpart is under the strong chaotic condition. The averaged shape of the eigenfunctions fits with the Gaussian distribution only when the effects of the symmetry have been removed.
文摘A simple approach to the formation of a Hamiltonian matrix for some Schrodinger equations describing the molecules with large amplitude motions has been proposed. The algorithm involving one or several variables has been concretely defined for the basis functions represented by Fourier series and orthogonal polynomials, taking Hermitian polynomials as an example.
文摘Fundamental theory presented in Part (I)[8] is used to analyze anisotropic plane stress problems. First we construct the generalized variational principle to enter Hamiltonian system and get Hamiltonian differential operator matrix; then we solve eigen problem; finally, we present the process of obtaining analytical solutions and semi-analytical solutions for anisotropic plane stress porblems on rectangular area.
基金supported by the National Natural Science Foun-dation of China (11172334)
文摘This paper presents a high order symplectic con- servative perturbation method for linear time-varying Hamil- tonian system. Firstly, the dynamic equation of Hamilto- nian system is gradually changed into a high order pertur- bation equation, which is solved approximately by resolv- ing the Hamiltonian coefficient matrix into a "major compo- nent" and a "high order small quantity" and using perturba- tion transformation technique, then the solution to the orig- inal equation of Hamiltonian system is determined through a series of inverse transform. Because the transfer matrix determined by the method in this paper is the product of a series of exponential matrixes, the transfer matrix is a sym- plectic matrix; furthermore, the exponential matrices can be calculated accurately by the precise time integration method, so the method presented in this paper has fine accuracy, ef- ficiency and stability. The examples show that the proposed method can also give good results even though a large time step is selected, and with the increase of the perturbation or- der, the perturbation solutions tend to exact solutions rapidly.
文摘We present in this paper a new method for solving polynomial eigenvalue problem. We give methods that decompose a skew-Hamiltonian matrix using Cholesky like-decomposition. We transform first the polynomial eigenvalue problem to an equivalent skew-Hamiltonian/Hamiltonian pencil. This process is known as linearization. Decomposition of the skew-Hamiltonian matrix is the fundamental step to convert a structured polynomial eigenvalue problem into a standard Hamiltonian eigenproblem. Numerical examples are given.