Composite Function

(redirected from Function composition)
Also found in: Dictionary, Wikipedia.

composite function

[kəm′päz·ət ′fəŋk·shən]
(mathematics)
A function of one or more independent variables that are themselves functions of one or more other independent variables.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.
The following article is from The Great Soviet Encyclopedia (1979). It might be outdated or ideologically biased.

Composite Function

 

a function of a function. Let us suppose that the variable y is a function of u, that is, y = f(u), and that u is in turn a function of x, that is, u = Φ(x). Then y is a composite function of u and x—that is, y = f[Φ(x)]—defined for all x such that Φ(x) is in the domain of f(u). In this case, y is said to be a composite function of the variable x and the variable u, which is sometimes called the intermediate variable. For example, if y = u2 and u = sin x, then y = sin2x for all values of x. If, however, Composite Function and u = sin x, then Composite Function, which, if we are restricted to real values of the function, is defined only for all x such that sin x ≥ 0—that is, for 2kπx ≥ (2k + 1)π, where k = 0, ± 1, ± 2,….

The derivative of a composite function is equal to the product of the derivative of the function with respect to the intermediate variable and the derivative of the intermediate variable with respect to the independent variable. This rule, called the chain rule, extends to composite functions with two, three, or more intermediate variables. Thus, if y = f(u1, u1 = Φ(u2), …, uk–1 = Φk–1(uk), uk = Φk(x), then

The Great Soviet Encyclopedia, 3rd Edition (1970-1979). © 2010 The Gale Group, Inc. All rights reserved.
Mentioned in ?
References in periodicals archive ?
Especially, to optimize network overall performance, it is difficult to solve service function composition problem which usually is a NP hard problem.
Chen, "Dynamic function composition for network service chain: model and optimization," Computer Networks, vol.
According to Clark et al., a student can relate function composition and decomposition with the chain rule, and recognise various instantiations of the chain rule to apply the same rule.
Similarly, a simplification in the function composition view of Level 1 produces a mismatch in which (sequences of) states at Level 2 have no corresponding subfunctions at Level 1.
On the function composition version, it is harder to view the cascade as being supported, because Level 1 is here intended as an analysis of the information-processing nature of the task, and a different set of functions and subfunctions defines a different task.
Identification of competence theories with the official dogma of Level 1 has been made by Marr [1977), whilst persuasive arguments for identification with the function composition view have been provided by Peacocke [1986] and Clark [1990].
Let (X, *, 0) be an AC-algebra and (M(X), o, [f.sub.0]) be the corresponding AC-algebra for function compositions. Then, for any positive integer m, the following conditions hold: