Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지

WHAT CAN WE SAY ABOUT THE TIME COMPLEXITY OF ALGORITHMS \ulcorner

  • Published : 2001.09.01

⟨ Previous Next ⟩

Abstract

We shall discuss one of some techniques needed to analyze algorithms. It is called a big-O function technique. The measures of efficiency of an algorithm have two cases. One is the time used by a computer to solve the problem using this algorithm when the input values are of a specified size. The other one is the amount of computer memory required to implement the algorithm when the input values are of a specified size. Mainly, we will restrict our attention to time complexity. To figure out the Time Complexity in nonlinear problems of Numerical Analysis seems to be almost impossible.

Keywords

References

  1. Matrix Computation for Engineering and Scientists Alan Jennings
  2. Iterative solution of nonlinear equations in several variables J.M.Ortega;W.C.Rheinboldt
  3. Recent advances in Numerical Analysis Global Homotopies and Newton methods H.B.Keller;C. de Boor(ed.);G.Golub(ed.)
  4. Numerische Math. v.30 Zur Losung paraeterabhangiger nichtlinearer Gleichungen mit singularen Jacobi-Matrizen R.Menzel;H.Schwetlick
  5. KJCAM v.2 no.1 On the numerucal imbedding method C.H.Park