Generalizing recursion in mapping functions

In summary, the conversation is about a mapping function and a condition that occurs for certain values of the function. There is also a discussion about finding initial conditions that will lead to the defined region. The topic of attractors in the domain of iterated functions is also mentioned.
  • #1
Pythagorean
Gold Member
4,409
320
I have a mapping function:

[tex]x_{n+1} = \mu (1-x_n) [/tex]

I have some condition that occurs for:

[tex] \mu (1-x_0) > 1 [/tex] (1)

which is:

[tex] x_0 < 1- \frac{1}{\mu} [/tex]

but via the map function, there's an initial condition that leads to the above solution:

**UNDER CONSTRUCTION, ERROR FOUND**
 
Last edited:
Mathematics news on Phys.org
  • #2
Well... "solving" my error just confuses me more. Mapping functions with a shift in them are really unintuitive to me. So, from the top:

Given:

[tex] x_{n+1} = \mu (1-x_n) [/tex]

Some special condition occurs at:

[tex] x_{n+1} = \mu (1-x_n) [/tex]

Which, in terms of initial condition, means that if:

[tex] x_0 < 1- \frac{1}{\mu} [/tex]

than the condition will be met. HOWEVER, there are also initial conditions that will map to the above space. How do I find them? For instance, I can reverse and apply the order of operations in the mapping functions (inverse scale, then shift opposite):

[tex] x_0 < \frac{1- \frac{1}{\mu}}{\mu}+1 [/tex]

but this gets unwieldy as I try to go back more and more iterations. Is there an inductive way to represent this "reverse mapping" series as a funciton of n (the number of iterations the mapping function requires). Or am I going about this all wrong?
 
  • #3
Pythagorean said:
HOWEVER, there are also initial conditions that will map to the above space.

It's unclear what you mean by mapping a condition to space. What space?
 
  • #4
the region defined by
[tex] x_0 < 1- \frac{1}{\mu} [/tex]
 
  • #5
I don't understand what you mean by "mapping" the condition to the space since it is the condition that defines the space.

(If your are trying to ask a question about the attractors in the domain of iterated functions, it would be best to use the standard terminology for that subject - or give a link to a page that explains your question.)
 
  • #6
Well, I am, but I was trying to just focus on the micro-issue I'm having. I just want to find the basin of attraction for that region I defined, but I am not sure if its really an attractor (it goes to infinity; this is the right side of the tent map for mu>2).

Anyway, I will spend more time on it and if I don't get it, I will reformulate the question in more detail later.
 

FAQ: Generalizing recursion in mapping functions

What is recursion in mapping functions?

Recursion in mapping functions is when a function calls itself repeatedly until a specific condition is met. This allows for efficient and concise code in cases where a function needs to perform the same task multiple times.

How is recursion different from iteration?

Recursion and iteration are both ways to solve repetitive problems, but they differ in their implementation. In recursion, a function calls itself, while in iteration, a loop is used to execute the same block of code multiple times.

Can any problem be solved using recursion?

While recursion can be used to solve a wide range of problems, not all problems can be solved using recursion. Some problems may have more efficient solutions using iteration or other techniques.

What are the advantages of using recursion in mapping functions?

Recursion can lead to more concise and readable code, especially in cases where a function needs to perform the same task multiple times. It also allows for a more elegant and intuitive solution to certain problems.

Are there any limitations to using recursion in mapping functions?

One limitation of recursion is its potential to cause stack overflow if the recursion is not properly managed. This can occur if the recursion does not have a base case or if the base case is not reached. Recursion also tends to be less efficient in terms of memory usage compared to iteration.

Similar threads

Replies
19
Views
2K
Replies
17
Views
3K
Replies
9
Views
2K
Replies
1
Views
10K
Replies
7
Views
2K
Replies
2
Views
1K
Replies
1
Views
601
Replies
1
Views
1K
Replies
21
Views
3K
Back
Top