Hello, The release notes for QE 6.6 mention "ParO and PPCG iterative diagonalization algorithms". Are any benchmarks available? For what cases are these methods faster than CG? Best, Michal Krompiec Merck KGaA
_______________________________________________ Quantum ESPRESSO is supported by MaX (www.max-centre.eu/quantum-espresso) users mailing list [email protected] https://lists.quantum-espresso.org/mailman/listinfo/users
