Description: Total gradient algorithm program code. Mathematics, the total gradient method for solving a particular linear system is the numerical solution methods, including those for the symmetric and positive definite matrix. Conjugate gradient method is an iterative method, it applies to sparse matrix systems, because these systems such as the Cholesky decomposition of the direct method is too high. Such systems in the numerical solution of partial differential equations are quite common when. Total gradient method can also be used for solving unconstrained optimization problems.
File list (Check if you may need any files):