Comparison of continuous and discrete adaptive identification algorithms

Discretization of a popular continuous-time control algorithm is effected and an equivalent discrete-time identification law developed and compared to a published discrete identification algorithm developed from Lyapunov Theory. Results are compared as regards asymptotic stability as insured using Lyapunov theory. Some analysis and design guidelines are proposed as regards implementation and practical utility.