New Types of Decomposition Integrals and Computational Algorithms
In this paper we define two new types of decomposition integrals, namely the chain and the min-max integral and prove some of their properties. Their superdecomposition duals are also mentioned. Based on the wide applicability of decomposition integrals, some computational algorithms and their complexity are discussed.
KeywordsDecomposition integrals Non-linear integrals Computational complexity
This work was supported by the grants APVV-14-0013 and VEGA 1/0682/16.
- 6.Šeliga, A.: A note on the computational complexity of Lehrer integral. In: Advances in Architectural, Civil and Environmental Engineering: 27th Annual PhD Student Conference on Applied Mathematics, Applied Mechanics, Geodesy and Cartography, Landscaping, Building Technology, Theory and Structures of Buildings, Theory and Structures of Civil Engineering Works, Theory and Environmental Technology of Buildings, Water Resources Engineering, pp. 62–65 (2017). ISBN 978-80-227-4751-6Google Scholar
- 7.Šeliga, A.: New types of decomposition integrals and computational algorithms. In: Kulczycki, P., Kowalski, P.A., Łukasik, S. (eds.) Contemporary Computational Science, p. 93. AGH-UST Press, Cracow (2018)Google Scholar
- 9.Sugeno, M.: Theory of fuzzy integrals and its applications. Doctoral thesis, Tokyo Institute of Technology (1974)Google Scholar