ABSTRACT
In this chapter, we discuss the 1D version of our hp algorithm, a scheme that produces automatically a sequence of meshes that deliver not only exponential convergence, but also the best meshes in the whole preasymptotic region. We will first describe the main idea of the algorithm, then discuss its practical implementation in the code, and then document our claims with a number of numerical examples. We shall conclude the chapter with a short discussion on the algebraic complexity and efficiency issues.
