abstract:In computational complexity theory, a sparse language is a formal language (a set of strings) such that the number of strings of length n in the language is bounded by a polynomial function of n. They are used primarily in the study of the relationship of the complexity class NP with other classes.
Conjugategradientmethod were choosed to solvethelargesparsematrixequations induced by theFEM and computer language FORTRAN was used to programme thenumericalsimulationsystemsoftware.