Xing Zhang

Optimal path less efficient than greedy path

4

Script to reproduce the problem: ``` import numpy as np import opt_einsum print("opt_einsum version: ", opt_einsum.__version__) no = 300 nv = 1200 naux = 50 nx = 2000 M =...

### Description Dear developers, When I use `custom_root` to do implicit differentiation, I find that if I use the linear solvers like `gmres` or `cg` to solve the tangent system,...