I am looking for information on the time complexity for solving sparse system Ax=b with direct solver. This system results from a finite-element discretization of an elliptic problem. The matrix A considered is symmetric definite positive, has n equations, m non-zeros and a constant bandwidth b. How the time complexity T for solving this system depends on n, m and b (T=O(??)) ?Do you have some references about that?Many thanks!
Time complexity for sparse direct solver for SPD system with respect to number of equations, bandwidth, number of nonzeros?
linear solver;sparse;complexity