Zobrazeno 1 - 10
of 162
pro vyhledávání: '"Stankovic, Miomir"'
We use the Laplace transform and the Gamma function to introduce a new integral transform and name it the Laplace-type transform possessing the property of mapping a function to a functional sequence, which cannot be achieved by the Laplace transform
Externí odkaz:
http://arxiv.org/abs/2407.13812
Relying on the Hurwitz formula, we find sums of the series over sine and cosine functions through the Hurwitz zeta function. Using another summation formula for these trigonometric series, we find finite sums of some series over the Riemann zeta func
Externí odkaz:
http://arxiv.org/abs/2407.13004
We have derived alternative closed-form formulas for the trigonometric series over sine or cosine functions when the immediate replacement of the parameter appearing in the denominator with a positive integer gives rise to a singularity. By applying
Externí odkaz:
http://arxiv.org/abs/2407.12885
This paper deals with the Mittag-Leffler polynomials (MLP) by extracting their essence which consists of real polynomials with fine properties. They are orthogonal on the real line instead of the imaginary axes for MLP. Beside recurrence relations an
Externí odkaz:
http://arxiv.org/abs/2402.07795
Publikováno v:
South African Journal of Industrial Engineering, Vol 24, Iss 3, Pp 175-189 (2013)
This paper presents the factors, performance, and indicators of occupational safety, as well as a method to select and rank occupational safety indicators based on the expert evaluation method and the fuzzy analytic hierarchy process (fuzzy AHP). A c
Externí odkaz:
https://doaj.org/article/acce3de8165d4e3d8a768863d64e6336
Autor:
Protic, Danijela, Stankovic, Miomir
A q-Levenberg-Marquardt method is an iterative procedure that blends a q-steepest descent and q-Gauss-Newton methods. When the current solution is far from the correct one the algorithm acts as the q-steepest descent method. Otherwise the algorithm a
Externí odkaz:
http://arxiv.org/abs/2107.03304
Autor:
Protic, Danijela, Stankovic, Miomir
A q-Gauss-Newton algorithm is an iterative procedure that solves nonlinear unconstrained optimization problems based on minimization of the sum squared errors of the objective function residuals. Main advantage of the algorithm is that it approximate
Externí odkaz:
http://arxiv.org/abs/2105.12994
We have fundamentally corrected the proofs of the theorems from our paper [9] by giving an entirely different approach, using quite a simple method based on applications of some elementary inequalities, well-known H\"older's inequality, and the Gauch
Externí odkaz:
http://arxiv.org/abs/1902.11151
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Applicable Analysis and Discrete Mathematics, 2020 Oct 01. 14(2), 300-316.
Externí odkaz:
https://www.jstor.org/stable/26964963