Discrete Variable Representation
A discrete variable representation (DVR) converts a finite basis expansion into values associated with quadrature nodes. It combines a transformed kinetic operator with an approximately diagonal local potential. Its efficiency comes from a specific basis–quadrature relationship; an arbitrary grid with a diagonal potential is not automatically the DVR of a chosen variational basis.
Required background. Basis representations explains unitary changes of coordinates and overlap matrices. Helpful background. Spectral methods distinguishes projection from collocation, and Rayleigh–Ritz explains finite-basis energy estimates.
Quadrature defines the discrete transformation
Section titled “Quadrature defines the discrete transformation”Consider orthonormal functions in the physical measure , with quadrature nodes and positive weights such that quadrature integrates every product exactly:
Define . Then ; since is square, as well. For a basis coefficient vector , its DVR coordinate vector is
The cardinal functions
satisfy and are orthonormal in the exact finite-basis inner product. These identities are useful implementation tests. For an orthogonal-polynomial construction whose quadrature uses a weight , account for that weight in the functions or physical measure explicitly; do not silently reinterpret weighted quadrature as integration against .
Why a local potential becomes diagonal
Section titled “Why a local potential becomes diagonal”The exact transformed potential is . Quadrature instead gives
Thus the common DVR Hamiltonian is
The kinetic transformation is exact within the selected basis if its original matrix elements are exact. The potential approximation introduces a separate quadrature error. Light, Hamilton, and Lill formalize this relationship between DVR and variational basis representations.
For real , the displayed Hamiltonian remains Hermitian. This alone does not make its eigenvalues variational upper bounds: the quadrature-modified potential need not equal the projection of the physical operator. Restore exact potential matrix elements to recover ordinary Rayleigh–Ritz assumptions, or study quadrature convergence independently.
A two-node example that exposes the approximation
Section titled “A two-node example that exposes the approximation”On , take and . Two-point Gauss–Legendre quadrature has , . Ordering the negative node first,
For , the basis matrix is
Its transform is exactly . For , however, the exact basis matrix is , whereas node sampling yields . The integrand has degree four, beyond the rule’s exactness through degree three. The discrepancy is not roundoff or an eigensolver defect.
This example concerns multiplication operators. The two polynomials alone do not specify a self-adjoint Schrödinger boundary-value problem. Choose kinetic basis functions and boundary conditions together when constructing an actual Hamiltonian.
Convergence and multidimensional cost
Section titled “Convergence and multidimensional cost”Increase basis size and compare physical observables, coefficient tails, and selected exact or higher-order potential matrix elements. Singular potentials and nonsmooth wavefunctions can converge slowly even when the cardinal identities hold to machine precision. Coordinate mappings require transformed kinetic energy and Jacobian factors, as described under coordinate transformations.
A direct product of one-dimensional DVRs with nodes each has coefficients. A diagonal potential reduces application cost but does not remove exponential storage growth. Exploit separability, symmetry, sparse representations, or low-rank states only when their approximation errors are controlled. The tensor-network chapter discusses one possible compression strategy.
Exercises
Section titled “Exercises”For in the two-node example, calculate the exact potential matrix in DVR coordinates and compare it with the diagonal approximation.
Solution
Multiplying gives diagonal entries and off-diagonal entries . The sampled potential is . Their difference has eigenvalues and , displaying a finite quadrature error despite exact orthogonality of .
Why is using instead of generally incorrect?
Solution
An unweighted Euclidean sum of samples does not represent the physical norm when quadrature weights vary. It also changes the transformation’s orthogonality and matrix adjoint. One can retain raw samples only by consistently retaining their weight metric in all inner products and operator relations.
References
Section titled “References”- Light, J. C., I. P. Hamilton, and J. V. Lill, “Generalized Discrete Variable Approximation in Quantum Mechanics,” Journal of Chemical Physics 82, 1400–1409 (1985). DOI.
- Tannor, David J. Introduction to Quantum Mechanics: A Time-Dependent Perspective. University Science Books, 2007.