Numerical method for unitary systems
From MaRDI portal
The Lanczos method is modified to construct probability amplitudes when the corresponding propagator can be expressed in terms of the Cayley representation. The method is the most appropriate when the Hermitian matrix in the Cayley matrix representation is sparse. This algorithm requires much less storage compared with the conventional method. The algorithm is monitored by means of the magnitude of the residual vector.
Recommendations
- Physical and numerical aspects in Lanczos and modified Lanczos calculations
- scientific article; zbMATH DE number 4199466
- An alternative implementation of the Lanczos algorithm for wavefunction propagation
- The Cayley transform in the numerical solution of unitary differential systems
- Krylov subspace methods for the Dirac equation
Cites work
- A Lanczos Method for a Class of Nonsymmetric Systems of Linear Equations
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- Solution of Sparse Indefinite Systems of Linear Equations
- The Lanczos Algorithm With Partial Reorthogonalization
- The Lanczos Algorithm with Selective Orthogonalization
- The use of a refined error bound when updating eigenvalues of tridiagonals
This page was built for publication: Numerical method for unitary systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1077130)