Math related to representing functions as compositions of others?

  • Thread starter Thread starter Stephen Tashi
  • Start date Start date
  • Tags Tags
    Functions
AI Thread Summary
The discussion focuses on the concept of representing or approximating functions as compositions of simpler functions, highlighting the need for precise definitions and exploring theoretical and statistical problems related to this topic. Function decomposition is noted as a relevant method, particularly in computing where complex functions can be broken down into simpler components for efficiency. An example is provided involving a study on evaluating loan applicants' creditworthiness using function decomposition based on numerical tables. The conversation also touches on mathematical approaches like multivariate Taylor series and orthogonal function summations, questioning whether all methods ultimately converge to these techniques. Overall, the exploration seeks to uncover additional mathematical insights beyond the commonly discussed methods.
Stephen Tashi
Science Advisor
Homework Helper
Education Advisor
Messages
7,864
Reaction score
1,602
I'd like to hear people's thoughts on the general topic of representing (or approximating) given functions as compositions of others.

Of course, one task is define precisely what this means. What are some interesting problems (theoretical or statistical) that require it?

Perhaps a Google virtuoso can do better than my attempts. I've used terms like "function decomposition" and I get lots of hits, but they are mostly about organizing businesses or computer programs. Abstractly, such problems do have some relevance. For example, a typical computer program needs to compute some function F(x,y,z,w...) and it's useful to do this in steps that compute simpler functions like g(x,y), h(z,w) and thus F becomes F(g(x,y),h(z,w)).

Several years ago, I saw a paper where some people were analying a way to evaluate the creditworthiness of loan applicants in a baltic country and they proposed a method of decomposing a function F(x,y,z,...) specified by a numerical table into simpler functions, also given by tables. I don't recall the specifics.

Writing a function as a multivariate Taylor series is a decomposition. I'm curious if there is interesting math besides that approach and besides the more general approach of representing a function as a summation over a set of orthogonal functions. Or maybe someone has proven that all approaches amount to these summation approaches?
 
Mathematics news on Phys.org
there are several approaches depending on the type of function:

f(x,y,z) = X(x) * Y(y) * Z(z) is used in solving some types of partial differential eqns

other types of product sequences can be used to approximate a function as in the product sequence for the Reimmann functions.

Anyway Wikipedia has a brief article on it:

http://en.wikipedia.org/wiki/Function_decomposition

which might point you in other directions. Mathworld search lists a bunch of methods specific to it but no general duscussion.
 
Suppose ,instead of the usual x,y coordinate system with an I basis vector along the x -axis and a corresponding j basis vector along the y-axis we instead have a different pair of basis vectors ,call them e and f along their respective axes. I have seen that this is an important subject in maths My question is what physical applications does such a model apply to? I am asking here because I have devoted quite a lot of time in the past to understanding convectors and the dual...
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Back
Top