Skip to content

DRHO converges much slower than EDIFF #3146

Description

@Shen-Zhen-Xiong

Describe the bug

I remember in old versions of ABAUS, for scf calculation, DRHO converges almost faster than EDIFF, but after some 3.2 version of ABACUS , DRHO converges much slower than EDIFF. For example While DRHO converges to 1e-6, EDIFF only converges to 2e-05. Especially, I find a case(scan_nook_case) which DRHO has converged to 1e-05, but EDIFF only converges to -2, it is terrible。
issue_drho.tar.gz

Expected behavior

No response

To Reproduce

No response

Environment

No response

Additional Context

No response

Task list for Issue attackers (only for developers)

  • Verify the issue is not a duplicate.
  • Describe the bug.
  • Steps to reproduce.
  • Expected behavior.
  • Error message.
  • Environment details.
  • Additional context.
  • Assign a priority level (low, medium, high, urgent).
  • Assign the issue to a team member.
  • Label the issue with relevant tags.
  • Identify possible related issues.
  • Create a unit test or automated test to reproduce the bug (if applicable).
  • Fix the bug.
  • Test the fix.
  • Update documentation (if necessary).
  • Close the issue and inform the reporter (if applicable).

Metadata

Metadata

Labels

No labels
No labels

Type

No type

Fields

No fields configured for issues without a type.

Projects

No projects

Milestone

No milestone

Relationships

None yet

Development

No branches or pull requests

Issue actions