Well-conditioned iterative methods for large open quantum systems
From MaRDI portal
Cites work
- A fully asynchronous multifrontal solver using distributed dynamic scheduling
- A Hessenberg-Schur method for the problem AX + XB= C
- A. M. Lyapunov's stability theory—100 years on
- Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
- Any Nonincreasing Convergence Curve is Possible for GMRES
- Calculus of continuous matrix product states
- Completely positive dynamical semigroups of N-level systems
- Dynamically optimal unraveling schemes for simulating Lindblad equations
- Full- and low-rank exponential Euler integrators for the Lindblad equation
- Full- and low-rank exponential Euler integrators for the Lindblad equation
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Iterative Methods for Sparse Linear Systems
- Krylov sequences of maximal length and convergence of GMRES
- Krylov subspace recycling for sequences of shifted linear systems
- Mixed-precision algorithms for solving the Sylvester matrix equation
- On the generators of quantum dynamical semigroups
- Performance and scalability of the block low-rank multifrontal factorization on multicore architectures
- Recycling Krylov Subspaces for Sequences of Linear Systems
- Sufficient Conditions for Conservativity of Minimal Quantum Dynamical Semigroups
- Sufficient conditions for conservativity of minimal quantum dynamical semigroups
- Sufficient conditions for conservativity of quantum dynamical semigroups
- Unconditionally stable time discretization of Lindblad master equations in infinite dimension using quantum channels
This page was built for publication: Well-conditioned iterative methods for large open quantum systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7285129)