AbstractSome recently developed implicit time discretizations are discussed whose main application is to solving ordinary differential equations arising from finite element approximations to partial differential equations. Their theoretical properties, computer implementation and numerical behaviour, as observed in tests on simple examples, are compared with well‐known discretizations such as the Crank‐Nicholson met