• East Asian mathematical journal
• /
• v.34 no.4
• /
• pp.359-369
• /
• 2018

This note, we first show that the famous Carleman's inequality can be improved if we find a positive sequence $\{c_n\}$ such that $c_n{\sum\limits_{j=n}^{\infty}}{\frac{1}{j\(\prod_{k=1}^{j}ck\)^{\frac{1}{j}}}}$ < e. Then we list a lot of known results in the literature improving Carleman's inequality by this method. These results can be a good source to a further research for interested students. We next consider about similar improvement of Polya-Knopp's inequality, which is a continuous version of Carleman's inequality. We show by a manner parallel to the case of Carleman's inequality that Polya-Knopp's inequality can be improved if we find a positive function c(x) such that $c(x){\int}_{x}^{\infty}\frac{1}{t\;{\exp}\(\frac{1}{t}{\int}_{0}^{t}{\ln}\;c(s)\;ds\)}dt$ < e. But there are no known results improving Polya-Knopp's inequality by this method. Suggesting to find a new method, we lastly show that there is no nice continuous function c(x) that satisfies the inequality.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.7 no.2
• /
• pp.65-73
• /
• 2003

In this work, we use a numerical method to solve the nonlinear integral equation of the second kind when the kernel of the integral equation in the logarithmic function form or in Carleman function form. The solution has a computing time requirement of $0(N^2)$, where (2N +1) is the number of discretization points used. Also, the error estimate is computed.