convex linear combination

convex linear combination

[¦kän‚veks ‚lin·ē·ər ‚käm·bə′nā·shən]
(mathematics)
A linear combination in which the scalars are nonnegative real numbers whose sum is 1.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.
Mentioned in ?
References in periodicals archive ?
The problem of finding coefficient bounds, distortion bounds, extreme points, convex linear combinations, starlikeness and convexity properties of analytic function are the most fundamental problems in Geometric Function Theory.
In this paper, we obtain coefficient inequalities, radius of convexity and convex linear combinations for the class [*.summation over (p)]([alpha], [beta], q) The results of this paper is not only generalize the corresponding results due to Juneja and Reddy [1], Morga, Reddy and Juneja [2] but also give rise to analogous results for various subclasses of meromorphic functions.