Pregled bibliografske jedinice broj: 1148796
ALGORITHM FOR SOLVING MAXIMUM ENTROPY PROBLEM BASED ON FINITE BASIS FUNCTIONS
ALGORITHM FOR SOLVING MAXIMUM ENTROPY PROBLEM BASED ON FINITE BASIS FUNCTIONS // ECCOMAS MSF 2021 - 5th International Conference on Multi-scale Computational Methods for Solids and Fluids / Ibrahimbegović, Adnan ; Nikolić, Mijo (ur.).
Sarajevo, 2021. str. 117-120 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
CROSBI ID: 1148796 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
ALGORITHM FOR SOLVING MAXIMUM ENTROPY PROBLEM BASED
ON FINITE BASIS FUNCTIONS
Autori
Gotovac, Blaž ; Brajčić Kurbaša, Nives ; Kozulić, Vedrana ; Gotovac, Hrvoje
Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni
Izvornik
ECCOMAS MSF 2021 - 5th International Conference on Multi-scale Computational Methods for Solids and Fluids
/ Ibrahimbegović, Adnan ; Nikolić, Mijo - Sarajevo, 2021, 117-120
ISBN
978-9958-638-66-4
Skup
5th International Conference on Multi-Scale Computational Methods for Solids and Fluids (ECCOMAS MSF 2021)
Mjesto i datum
Split, Hrvatska, 30.06.2021. - 02.07.2021
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
maximum entropy, Shannon entropy, Fup basis functions, probability density function
(maximum entropy ; Shannon entropy ; Fup basis functions ; probability density function)
Sažetak
The Maximum Entropy (MaxEnt) principle is a versatile tool for statistical finding of the probability density function (pdf) from its moments as a least-biased estimation among all other possible pdf’s. The MaxEnt algorithm transforms the original constrained optimization problem to the unconstrained dual optimization problem using Lagrangian multipliers. The Classic Moment Problem (CMP) uses algebraic power moments, causing typical conventional numerical methods to fail for higher-order moments due to different sensitivities of Lagrangian multipliers and unbalanced nonlinearities. These difficulties can be overcome by using orthogonal polynomials which enable roughly the same sensitivity for all Lagrangian multipliers. In this paper the Fup MaxEnt Algoritam (FMEA) that based on using finite basis functions Fup4(x) with compact support is presented. These basis functions can exactly describe algebraic polynomials up to the fourth order while polynomials of high orders describe approximately. FMEA solves the CMP finding an optimal pdf with better balanced Lagrangian multipliers. The algorithm is numerically very efficient due to localized properties of Fup4 basis functions implying a weaker dependence between Lagrangian multipliers and faster convergence. Application of Fup MaxEnt algoritam is demonstrated on continuous beta distribution as pdf example.
Izvorni jezik
Engleski
Znanstvena područja
Matematika, Građevinarstvo, Temeljne tehničke znanosti
POVEZANOST RADA
Ustanove:
Fakultet građevinarstva, arhitekture i geodezije, Split
Profili:
Nives Brajčić Kurbaša
(autor)
Blaž Gotovac
(autor)
Hrvoje Gotovac
(autor)
Vedrana Kozulić
(autor)