Functional decomposition

rdf:langString Functional decomposition

rdf:langString y

rdf:langString May 2019

rdf:langString September 2020

rdf:langString This definition is horribly underspecified, similar to e.g. decomposing a number into the sum of serveral others. Unless the set of admitted g_i or/and phi is given, it does not make sense at all. One trivial solution is m=n, g_i=x_i, and phi=f; another one is m=1, g_1=f, and phi=x.

rdf:langString In mathematics, functional decomposition is the process of resolving a functional relationship into its constituent parts in such a way that the original function can be reconstructed (i.e., recomposed) from those parts by function composition. This process of decomposition may be undertaken to gain insight into the identity of the constituent components which may reflect individual physical processes of interest. Also functional decomposition may result in a compressed representation of the global function, a task which is feasible only when the constituent processes possess a certain level of modularity (i.e., independence or non-interaction). Interactions between the components are critical to the function of the collection. All interactions may not be observable, but possibly deduced through repetitive perception, synthesis, validation and verification of composite behavior.