The efficient computation of certain determinants arising in the treatment of Schrödinger's equations (Q5947302): Difference between revisions

To solve Schrödinger's equation, a sparse grid approximation is proposed that uses a set of non-orthogonal bases. The solution can be approximated by scalar products in terms of determinant sums. Due to the sparsity of the grid, the determinants can each be computed from smaller sized ones. This paper gives the physics and numerical background for the problem and then develops a method to evaluate the occuring determinants of certain scalar products of the grid basis functions efficiently. All of section 4, the ``Reformulated Problem'' in terms of determinants, seems to beg for a more modern treatment via matrix and graph theory, especially for evaluating formulas like (4.1) on p. 51 effectively.