Before revision:  As an illustrating example, we show how to approximate the Smallest Enclosing Ball (SEB) of a set of complex square matrices in the Siegel disk domains: We compare two implementations of a generalization of the iterative core-set algorithm of Badoiu and Clarkson , 2003 in the Siegel-Poincar\'e disk and in the Siegel-Klein disk .
After revision:  As an illustrating example, we show how to approximate the smallest enclosing ball of a set of complex square matrices in the Siegel disk domains: We compare two implementations of a generalization of the iterative core-set algorithm of Badoiu and Clarkson , 2003 in the Siegel-Poincar\'e disk and in the Siegel-Klein disk .