0346967 20240103193823.820100914235959.9 Algorithm for splitting and merging complexes of convex polyhedra according to given hyperplanes in general dimension 6 s. cav_un_epca*0346657978-615-5044-00-7Proceedings of the 11th International PhD Workshop on Systems and Control a Young Generation Viewpoint62-67VeszprémUniversity of Pannonia2010 regression Bayesian complex splitting algorithm robust cav_un_auth*0263960 Šindelář Jan Adaptivní systémy Department of Adaptive Systems AS AS UTIA-B Ústav teorie informace a automatizace AV ČR, v. v. i. http://library.utia.cas.cz/separaty/2010/AS/sindelar-algorithm for splitting and merging complexes of convex polyhedra according to given hyperplanes in general dimension.pdf 1M0572 GA MŠk cav_un_auth*0001814 GA102/08/0567 GA ČR cav_un_auth*0239566 CEZ:AV0Z10750506 In the article algorithm for splitting and merging complexes of convex polyhedra is proposed. The need for such an algorithm emerges for example in computation of normalization factor of Bayesian estimated posterior likelihood of parameters in an auto-regression model with Laplace distributed innovations, where the split of the complex corresponds to newly arrived data incorporation and the merging relates to making such a model adaptive by forgetting older data values -- the situation is most apparent in case of an estimation on a moving window. cav_un_auth*0263709 11th International PhD Workshop on Systems and Control a Young Generation Viewpoint Veszprém 01.09.2010-03.09.2010 HU 2011 BB http://hdl.handle.net/11104/0187853 2010 cav_un_epca*0346657 Proceedings of the 11th International PhD Workshop on Systems and Control a Young Generation Viewpoint 978-615-5044-00-7 62 67 Veszprém University of Pannonia 2010