アルゴリズムの詳細と証明を書きたいです。 In each iteration of the Doolittle algorithm, elements below the main diagonal in one of A's columns are eliminated. The result is an upper triangular matrix U, and the complexity is (2/3)n**3 (yet …