The Legendre transform

نویسنده

  • Jordan Bell
چکیده

f((1− t)x1 + tx2) ≤ (1− t)f(x1) + tf(x2), x1, x2 ∈ C, 0 ≤ t ≤ 1, then f : X → R is convex. Proof. Let (x1, α1), (x2, α2) ∈ epi f and 0 ≤ t ≤ 1. The fact that the pairs (xi, αi) belong to epi f means in particular that f(xi) < ∞, and hence that xi ∈ C, as otherwise we would have f(xi) =∞. But (1− t)(x1, α1) + t(x2, α2) = ((1− t)x1 + tx2, (1− t)α1 + tα2), and, as x1, x2 ∈ C, f((1− t)x1 + tx2) ≤ (1− t)f(x1) + tf(x2) ≤ (1− t)α1 + tα2, showing that (1 − t)(x1, α1) + t(x2, α2) ∈ epi f , and hence that f : X → R is convex.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fast, Simple, and Stable Chebyshev-Legendre Transform Using an Asymptotic Formula

A fast, simple, and numerically stable transform for converting between Legendre and Chebyshev coefficients of a degree N polynomial in O(N(logN)2/ log logN) operations is derived. The basis of the algorithm is to rewrite a well-known asymptotic formula for Legendre polynomials of large degree as a weighted linear combination of Chebyshev polynomials, which can then be evaluated by using the di...

متن کامل

Characterization of a simple communication network using Legendre transform

We describe an application of the Legendre transform to communication networks. The Legendre transform applied to max-plus algebra linear systems corresponds to the Fourier transform applied to conventional linear systems. Hence, it is a powerful tool that can be applied to max-plus linear systems and their identification. Linear max-plus algebra has been already used to describe simple data co...

متن کامل

Comparative Study of Dct and Discrete Legendre Transform for Image Compression

-The discrete Legendre transform is compared to the discrete cosine transform (DCT), which is based on Chebyshev polynomials, in terms of image compression efficiency. Using standard test images in various image compression configurations, the DCT is found to perform marginally better than the discrete Legendre transform in all cases examined. A simplified fundamental matrix theory for construc...

متن کامل

On the generalized Legendre transform and monopole metrics

In the generalized Legendre transform construction the Kähler potential is related to a particular function. Here, the form of this function appropriate to the k-monopole metric is calculated from the known twistor theory of monopoles.

متن کامل

Numerical solution of nonlinear Hammerstein integral equations by using Legendre-Bernstein basis

In this study a numerical method is developed to solve the Hammerstein integral equations. To this end the kernel has been approximated using the leastsquares approximation schemes based on Legender-Bernstein basis. The Legender polynomials are orthogonal and these properties improve the accuracy of the approximations. Also the nonlinear unknown function has been approximated by using the Berns...

متن کامل

Legendre Ramanujan Sums transform

In this paper, Legendre Ramanujan Sums transform(LRST) is proposed and derived by applying DFT to the complete generalized Legendre sequence (CGLS) matrices. The original matrix based Ramanujan Sums transform (RST) by truncating the Ramanujan Sums series is nonorthogonal and lack of fast algorithm, the proposed LRST has orthogonal property and O(Nlog2N) complexity fast algorithm. The LRST trans...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014