I was taken to the legacy code. Calculations performed procedure called "dynamic expansion", which essentially organizes the rows of Hesse matrix. Ordering algorithm is not clear to me
Row ordering gives a significant boost in speed solutions of equations. Tell me, please, which is why is this effect? Why change the order of rows in the Hessian accelerates calculation?