Excited-State Targeting
Excited-state targeting must prevent a solver or optimizer from collapsing into states already found. It must also distinguish the physical state being followed from its position in an energy-sorted list. These requirements become central near degeneracies and avoided crossings, where a small energy error can coexist with a large error in state identity.
Helpful background. Sparse eigensolvers covers spectral targeting and Rayleigh–Ritz supplies subspace bounds.
Orthogonality constraints and block methods
Section titled “Orthogonality constraints and block methods”For a Hermitian matrix with known orthonormal lower eigenvectors , minimize the Rayleigh quotient subject to
Equivalently use the projector and restrict the operator to its range. Do not diagonalize on the whole original space without accounting for the zero eigenvalues introduced on the removed subspace.
Approximate lower states make the projector imperfect relative to the exact Hamiltonian. Their errors can contaminate higher states; refine them and monitor every mutual overlap. A block Rayleigh–Ritz calculation often handles a cluster more naturally, solving for the entire subspace at once. For a nonorthogonal representation, the constraints are .
Symmetry decomposition can remove unwanted states exactly. The lowest state in an odd-parity sector is an excited state of the full problem, but need not be the globally first excited state. State the sector whenever reporting an energy.
Penalties and interior targets
Section titled “Penalties and interior targets”A penalty operator
raises the already known levels by when those states are exact. Choose large enough to move them above the desired state. Excessively large penalties worsen spectral scaling and can make optimization stiff; they do not repair inaccurate projectors.
Shift-invert targets eigenvalues near a specified energy, independent of how many lower levels exist. The folded-spectrum objective,
also favors levels nearest , but squares the spectral width and can worsen conditioning. Equidistant levels become degenerate in the folded operator. Always recover energies and residuals using , not only the transformed objective.
Tracking states through a crossing
Section titled “Tracking states through a crossing”For consecutive parameter values and , compare the overlap matrix
Large overlaps guide assignments, but individual-vector matching becomes ambiguous inside a nearly degenerate cluster. Track its projector or align the two bases by an SVD of . A smooth phase convention can set neighboring overlaps real and positive when they are nonzero. It cannot turn a genuine crossing into a unique physical labeling.
For
with real and , the energies are . At , diabatic basis states cross at , and the energy-sorted ground vector changes basis label abruptly. At , the eigenvectors rotate over a scale . A parameter grid much coarser than that scale can misidentify the branch even with accurate diagonalization.
What constitutes a verified excitation
Section titled “What constitutes a verified excitation”Report energy gaps together with absolute energies, state or subspace residuals, orthogonality, and symmetry labels. Converge the basis for both states: cancellation of their errors may make one gap look unusually stable. Transition matrix elements require consistently normalized states and appropriate phase or gauge handling. A dark transition can be a selection rule or a state-labeling error; inspect the operator and sectors before interpreting it.
Exercises
Section titled “Exercises”For exact energies , , , what penalty makes the first excited state the unique ground state of ?
Solution
The modified energies are . The desired state is uniquely lowest for . At it is degenerate with the penalized original ground state. There is no advantage in choosing an arbitrarily enormous penalty.
References
Section titled “References”- Bai, Z., J. Demmel, J. Dongarra, A. Ruhe, and H. van der Vorst, eds., Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide, SIAM, 2000, online text — invariant subspaces and interior eigenvalues.
- Saad, Y., Numerical Methods for Large Eigenvalue Problems, revised ed., SIAM, 2011 — block iteration, deflation, and spectral transformations.