AbstractVarious singularity finite elements proposed so far are reviewed and their correlations are discussed. The method adopted in the comparative study is based on the singularity mapping or transformation technique. It is suggested that a compact design of computational routines is materialized by using the element which embodies singularity transformation and can be compatible with the notion of using the variable‐number‐nodes element in the general‐purpose computer programs.