A nondegenerate perturbation theory is studied using the adiabatic-theorem formalism. A new factorization of the adiabatic time-evolution operator analogous to that obtained by Morita in his derivation of the linked-cluster theorem is given by carrying out a series of intermediate representations. This leads to a new expansion for the perturbed eigenvectors \ensuremath{\Vert}\ensuremath{\alpha}〉 and energies ${E}_{\ensuremath{\alpha}}$ which are analytically expressed with respect to two matrix series ${\mathrm{scrV}}^{(n)}$ and ${E}^{(n)}$ . The nth term of each series ( ${\mathrm{scrV}}^{(n)}$ and ${E}^{(n)}$ ) includes perturbational contributions of power p, p\ensuremath{\ge}n. An explicit recurrence, ${\mathrm{scrV}}^{(n)}$ =V(${\mathrm{scrV}}^{n\mathrm{\ensuremath{-}}1)}$, ${E}^{(n\mathrm{\ensuremath{-}}1)}$), ${E}^{(n)}$ =E(${\mathrm{scrV}}^{(n\mathrm{\ensuremath{-}}1)}$, ${E}^{(n\mathrm{\ensuremath{-}}1)}$) is derived and allows us to calculate these matrices to an arbitrary iteration order (n). This is a central feature of our approach since the eigenvectors and eigenvalues can be generated, to this arbitrary order, by a simple numerical program.A nondegenerate perturbation theory is studied using the adiabatic-theorem formalism. A new factorization of the adiabatic time-evolution operator analogous to that obtained by Morita in his derivation of the linked-cluster theorem is given by carrying out a series of intermediate representations. This leads to a new expansion for the perturbed eigenvectors \ensuremath{\Vert}\ensuremath{\alpha}〉 and energies ${E}_{\ensuremath{\alpha}}$ which are analytically expressed with respect to two matrix series ${\mathrm{scrV}}^{(n)}$ and ${E}^{(n)}$. The nth term of each series (${\mathrm{scrV}}^{(n)}$ and ${E}^{(n)}$) includes perturbational contributions of power p, p\ensuremath{\ge}n. An explicit recurrence, ${\mathrm{scrV}}^{(n)}$=V(${\mathrm{scrV}}^{n\mathrm{\ensuremath{-}}1)}$, ${E}^{(n\mathrm{\ensuremath{-}}1)}$), ${E}^{(n)}$=E(${\mathrm{scrV}}^{(n\mathrm{\ensuremath{-}}1)}$, ${E}^{(n\mathrm{\ensuremath{-}}1)}$) is derived and allows us to calculate these matrices to an arbitrary iteration order (n). This is a central feature of our approach since the eigenvectors and eigenvalues can be generated, to this arbitrary order, by a simple numerical program.

Physical Review AOct 1, 198513 citations

Studies in perturbation theory. x- lower bounds to energy eigenvalues in perturbation theory

P.- Lowdin

Low bounds to energy eigenvalues in quantum theory problems by partitioning technique for positive perturbation

Jun 1, 19640 citations

Adiabatic perturbation theory invariant under the unitary transformations

Hsiang Shun Chou

Physical Review AJul 14, 20251 citation

- Approximation Methods IV: Variational Approach

S. Rajasekar, R. Velusamy

In chapters 13 and 14 we focused on perturbation theories for time-independent and time-dependent perturbations. For time-independent perturbations we obtained first-order and second-order corrections to energy eigenvalues and eigenfunctions. For time-dependent perturbations we obtained the probability for a system to make a transition from an ith initial state to fth final state. We have also discussed how to study the effect of adiabatic and sudden perturbations. In the present chapter we consider the variational method. The variational method can be used to construct an approximate ground state eigenfunction. In some cases the method can be used for finding approximately the energy of first few discrete states of a bound system. The perturbation theory uses a set of unperturbed states and the perturbation Hamiltonian H(1) to construct the eigenfunctions and eigenvalues through highly formalized approximations. In contrast, the variational method is based on a guess for the state-a trial state which is used to determine the corresponding energy. Any well behaved trial state introduced will yield an appropriate energy, although some trial states will be better than other, but whatever the guess, we can always make systematic improvements. We can construct a reasonably accurate eigenfunction often by a physical insight and ingenuity.In chapters 13 and 14 we focused on perturbation theories for time-independent and time-dependent perturbations. For time-independent perturbations we obtained first-order and second-order corrections to energy eigenvalues and eigenfunctions. For time-dependent perturbations we obtained the probability for a system to make a transition from an ith initial state to fth final state. We have also discussed how to study the effect of adiabatic and sudden perturbations. In the present chapter we consider the variational method. The variational method can be used to construct an approximate ground state eigenfunction. In some cases the method can be used for finding approximately the energy of first few discrete states of a bound system. The perturbation theory uses a set of unperturbed states and the perturbation Hamiltonian H(1) to construct the eigenfunctions and eigenvalues through highly formalized approximations. In contrast, the variational method is based on a guess for the state-a trial state which is used to determine the corresponding energy. Any well behaved trial state introduced will yield an appropriate energy, although some trial states will be better than other, but whatever the guess, we can always make systematic improvements. We can construct a reasonably accurate eigenfunction often by a physical insight and ingenuity.

CRC Press eBooksDec 11, 20140 citations

{\mathrm{scrV}}^{(n)}

and

{E}^{(n)}

. The nth term of each series (

{\mathrm{scrV}}^{(n)}

and

{E}^{(n)}

) includes perturbational contributions of power p, p\ensuremath{\ge}n. An explicit recurrence,

{\mathrm{scrV}}^{(n)}

=V(${\mathrm{scrV}}^{n\mathrm{\ensuremath{-}}1)}$, ${E}^{(n\mathrm{\ensuremath{-}}1)}$),

{E}^{(n)}

=E(${\mathrm{scrV}}^{(n\mathrm{\ensuremath{-}}1)}$, ${E}^{(n\mathrm{\ensuremath{-}}1)}$) is derived and allows us to calculate these matrices to an arbitrary iteration order (n). This is a central feature of our approach since the eigenvectors and eigenvalues can be generated, to this arbitrary order, by a simple numerical program.