qlat_utils.sjackknife¶
- qlat_utils.sjackknife(data_list, jk_idx_list, *, avg=None, is_hash_jk_idx=True, jk_idx_hash_size=None, rng_state=None, all_jk_idx=None, get_all_jk_idx=None, jk_blocking_func=None, eps=1)[source]¶
Super jackknife. Return
jk_arr.len(jk_idx_list) == len(data_list)len(jk_arr) == len(all_jk_idx)jk_idx_list(after processed byjk_blocking_func) should be contained inall_jk_idx, otherwise, ifis_hash_jk_idxis true, then, a hash ofjk_idxwill be used instead. Ideally,all_jk_idxshould only contain distinct indices. However, if there are repeatations, indices appear later take precedence. ifall_jk_idxandget_all_jk_idxare bothNone, then a trivialall_jk_idxwill be created based onjk_idx_hash_size.