🧭 New here?
Take a guided tour of the site.
← Back to Papers

Continue from this paper

Indexing is not verification. Extracted statements should be checked against the source.

Abstract

Some new inequalities for quotients of modified Bessel functions of the first and second kinds are deduced. Moreover, some developments on bounds for modified Bessel functions of the first and second kinds, higher-order monotonicity properties of these functions and applications to a special function that arises in finite elasticity, are summarized. The key tool in our proofs is a frequently used criterion for the monotonicity of the quotient of two Maclaurin series.

Results & Lemmas (5)

Each result is auto-extracted from the paper via OCR - the math is shown verbatim and may carry occasional transcription artifacts. Click to expand the full statement.

Lemma 2.1. Lemma 2.1. Consider the power series f(x) = a0 + a1x + · · · + anxn + · · · and g(x) = b0 + b1x + · · · + bnxn + · · ·, where, for all n…
Lemma 2.1. Consider the power series f(x) = a0 + a1x + · · · + anxn + · · · and g(x) = b0 + b1x + · · · + bnxn + · · · , where, for all n ⩾0, integer an ∈R and bn > 0, and suppose that both converge on R. If the sequence {an/bn}n⩾0 is (strictly) increasing (decreasing), then the function x →f(x)/g(x) is also (strictly) increasing (decreasing) on (0, ∞). For different proofs and various applications of this result the interested reader, is referred to [3,5,7–10,12,40,60,65] and the references the
Theorem 2.2. OCR DOI/publisher footer hidden Theorem 2.2. Let ν, µ > −1 and let k be a natural number. The following assertions are then true. (i) If ν < µ (ν > µ), then the function x…
Theorem 2.2. Let ν, µ > −1 and let k be a natural number. The following assertions are then true. (i) If ν < µ (ν > µ), then the function x →Iν(x)/Iµ(x) is strictly increasing (decreasing) on (0, ∞). (ii) The function x →I(2k) ν (x)/cosh x is strictly increasing on (0, ∞) for all ν < −1 2 and strictly decreasing on (0, ∞) for all ν > −1 2.
Theorem 1 Theorem 1] that ν →Iν(x) is decreasing on (−1, ∞) for each fixed x > 0. However, an alternative derivation of the above inequality was…
Theorem 1] that ν →Iν(x) is decreasing on (−1, ∞) for each fixed x > 0. However, an alternative derivation of the above inequality was given in 1972 by Luke [56, p. 63], by using a completely different approach. Clearly, Theorem 2.2 (iv) can be rewritten as follows: cosh x cosh y x y ν < Iν(x) Iν(y), (2.19) where 0 < x < y and ν > −1 2. Moreover, the above inequality is reversed when ν ∈ (−1, −1
Theorem 2.2. Repeated OCR label — verify against source Theorem 2.2. We note that it is easy to see that, from the inequality (2.14), by using the recurrence formula [76, p. 79] I′ ν(x)/Iν(x) =…
Theorem 2.2. We note that it is easy to see that, from the inequality (2.14), by using the recurrence formula [76, p. 79] I′ ν(x)/Iν(x) = ν/x + Iν+1(x)/Iν(x), after integration we obtain the inequality (2.19). Analogously, from the inequality (2.16), after integration we get the inequality (2.20). Taking into account the proof of Theorem 2.2 (vi), these in turn imply that in fact the inequality (2.14) is equivalent to (2.19), while the inequality (2.16) is equivalent to (2.20). Finally, we propo
Theorem 2.2 Repeated OCR label — verify against source OCR DOI/publisher footer hidden Theorem 2.2 (i) we obtain that, for all µ > ν > −1 and x > 0, the Tur´an-type inequality Iν+1(x)Iµ(x) −Iµ+1(x)Iν(x) > 0 holds. Clearly,…
Theorem 2.2 (i) we obtain that, for all µ > ν > −1 and x > 0, the Tur´an-type inequality Iν+1(x)Iµ(x) −Iµ+1(x)Iν(x) > 0 holds. Clearly, this is equivalent to wµ(x) > wν(x),

Related Papers

Bounds and asymptotic expansions for the radii of convexity and uniform convexit
2025
Asymptotic Expansions for the Radii of Starlikeness of Normalized q-Bessel Funct
2024
Probabilistic and Analytical Aspects of the Symmetric and Generalized Kaiser–Bes
2023
Asymptotic expansions for the radii of starlikeness of normalised Bessel functio
2020
Radii of starlikeness and convexity of generalized Mittag-Leffler functions
2019
↑↓ navigate↵ openesc closeall results
✦ 291 explorers have wandered the registry - thanks for stopping by. Tell us what you'd like to see →
Usage & privacy

We use first-party site metrics to improve navigation: page visits, internal clicks, search result counts (not search terms), and approximate active time. A random tab ID groups events for seven days; GPC/DNT turns this off. The separate visitor count uses a self-hosted pseudonymous fingerprint and also respects GPC/DNT.

💬 Feedback