3
0
mirror of https://github.com/triqs/dft_tools synced 2024-08-16 01:08:29 +02:00
dft_tools/test/blockstructure.py

157 lines
5.7 KiB
Python
Raw Normal View History

from triqs_dft_tools.sumk_dft import *
from pytriqs.utility.h5diff import h5diff
from pytriqs.gf import *
from pytriqs.utility.comparison_tests import assert_block_gfs_are_close
from triqs_dft_tools.block_structure import BlockStructure
import numpy as np
from pytriqs.utility.h5diff import compare, failures
def cmp(a, b, precision=1.e-15):
compare('', a, b, 0, precision)
if failures:
raise AssertionError('\n'.join(failures))
2018-08-29 11:29:46 +02:00
SK = SumkDFT('blockstructure.in.h5', use_dft_blocks=True)
original_bs = SK.block_structure
cmp(original_bs.effective_transformation_sumk,
[{'down': np.array([[1., 0., 0.],
[0., 1., 0.],
[0., 0., 1.]]),
'up': np.array([[1., 0., 0.],
[0., 1., 0.],
[0., 0., 1.]])}])
# check pick_gf_struct_solver
pick1 = original_bs.copy()
pick1.pick_gf_struct_solver([{'up_0': [1], 'up_1': [0], 'down_1': [0]}])
cmp(pick1.effective_transformation_sumk,
[{'down': np.array([[0., 0., 0.],
[0., 0., 0.],
[0., 0., 1.]]),
'up': np.array([[0., 0., 0.],
[0., 1., 0.],
[0., 0., 1.]])}])
# check loading a block_structure from file
2018-08-29 11:29:46 +02:00
SK.block_structure = SK.load(['block_structure'], 'mod')[0]
assert SK.block_structure == pick1, 'loading SK block structure from file failed'
# check SumkDFT backward compatibility
2018-08-29 11:29:46 +02:00
sk_pick1 = BlockStructure(gf_struct_sumk=SK.gf_struct_sumk,
gf_struct_solver=SK.gf_struct_solver,
solver_to_sumk=SK.solver_to_sumk,
sumk_to_solver=SK.sumk_to_solver,
solver_to_sumk_block=SK.solver_to_sumk_block,
2018-09-07 14:40:43 +02:00
deg_shells=SK.deg_shells,
corr_to_inequiv=SK.corr_to_inequiv)
assert sk_pick1 == pick1, 'constructing block structure from SumkDFT properties failed'
cmp(pick1.effective_transformation_sumk,
[{'down': np.array([[0., 0., 0.],
[0., 0., 0.],
[0., 0., 1.]]),
'up': np.array([[0., 0., 0.],
[0., 1., 0.],
[0., 0., 1.]])}])
# check pick_gf_struct_sumk
pick2 = original_bs.copy()
2018-08-29 11:29:46 +02:00
pick2.pick_gf_struct_sumk([{'up': [1, 2], 'down': [0, 1]}])
cmp(pick2.effective_transformation_sumk,
[{'down': np.array([[1., 0., 0.],
[0., 1., 0.],
[0., 0., 0.]]),
'up': np.array([[0., 0., 0.],
[0., 1., 0.],
[0., 0., 1.]])}])
pick3 = pick2.copy()
pick3.transformation = [np.reshape(range(9), (3, 3))]
cmp(pick3.effective_transformation_sumk,
[{'down': np.array([[0, 1, 2],
[3, 4, 5],
[0, 0, 0]]),
'up': np.array([[0, 0, 0],
[3, 4, 5],
[6, 7, 8]])}])
# check map_gf_struct_solver
2018-08-29 11:29:46 +02:00
mapping = [{('down_0', 0): ('down', 0),
('down_0', 1): ('down', 2),
('down_1', 0): ('down', 1),
('up_0', 0): ('down_1', 0),
('up_0', 1): ('up_0', 0)}]
map1 = original_bs.copy()
map1.map_gf_struct_solver(mapping)
# check create_gf
2018-08-29 11:29:46 +02:00
G1 = original_bs.create_gf(beta=40, n_points=3)
widths = dict(up_0=1, up_1=2, down_0=4, down_1=3)
2018-08-29 11:29:46 +02:00
for block, gf in G1:
gf << SemiCircular(widths[block])
2018-08-29 11:29:46 +02:00
original_bs.check_gf(G1)
original_bs.check_gf([G1])
# check approximate_as_diagonal
offd = original_bs.copy()
offd.approximate_as_diagonal()
# check map_gf_struct_solver
2018-08-29 11:29:46 +02:00
G2 = map1.convert_gf(G1, original_bs, beta=40, n_points=3, show_warnings=False)
# check full_structure
2018-08-29 11:29:46 +02:00
full = BlockStructure.full_structure(
[{'up_0': [0, 1], 'up_1': [0], 'down_1': [0], 'down_0': [0, 1]}], None)
G_sumk = BlockGf(mesh=G1.mesh, gf_struct=original_bs.gf_struct_sumk[0])
for i in range(3):
G_sumk['up'][i, i] << SemiCircular(1 if i < 2 else 2)
G_sumk['down'][i, i] << SemiCircular(4 if i < 2 else 3)
G3 = original_bs.convert_gf(G_sumk,
None,
space_from='sumk',
beta=40,
n_points=3)
assert_block_gfs_are_close(G1, G3)
assert original_bs.gf_struct_sumk_list ==\
[[('up', [0, 1, 2]), ('down', [0, 1, 2])]]
assert original_bs.gf_struct_solver_dict ==\
[{'up_0': [0, 1], 'up_1': [0], 'down_1': [0], 'down_0': [0, 1]}]
assert original_bs.gf_struct_sumk_dict ==\
[{'down': [0, 1, 2], 'up': [0, 1, 2]}]
assert original_bs.gf_struct_solver_list ==\
[[('down_0', [0, 1]), ('down_1', [0]), ('up_0', [0, 1]), ('up_1', [0])]]
# check __eq__
2018-08-29 11:29:46 +02:00
assert full == full, 'equality not correct (equal structures not equal)'
assert pick1 == pick1, 'equality not correct (equal structures not equal)'
assert pick1 != pick2, 'equality not correct (different structures not different)'
assert original_bs != offd, 'equality not correct (different structures not different)'
if mpi.is_master_node():
2018-08-29 11:29:46 +02:00
with HDFArchive('blockstructure.out.h5', 'w') as ar:
ar['original_bs'] = original_bs
ar['pick1'] = pick1
ar['pick2'] = pick2
ar['map1'] = map1
ar['offd'] = offd
ar['G1'] = G1
ar['G2'] = G2
ar['full'] = full
# cannot use h5diff because BlockStructure testing is not implemented
# there (and seems difficult to implement because it would mix triqs
# and dft_tools)
2018-08-29 11:29:46 +02:00
with HDFArchive('blockstructure.out.h5', 'r') as ar,\
HDFArchive('blockstructure.ref.h5', 'r') as ar2:
for k in ar2:
if isinstance(ar[k], BlockGf):
assert_block_gfs_are_close(ar[k], ar2[k], 1.e-6)
else:
assert ar[k] == ar2[k], '{} not equal'.format(k)