Re: Linear Iteration Rules
- From: Alexander S Klein <asklein@xxxxxxxxxxx>
- Date: Thu, 9 Jun 2005 12:35:37 -0400
How would I show that when A = -1, X3 must be equal to X1 no matter what.
It seems to me like this would be an easy algebra proof, but I can't seem
to get it. Any ideas? Thanks! Alex
On Thu, 9 Jun 2005, A N Niel wrote:
> In article
> <Pine.GSO.4.05.10506090906400.4823-100000@xxxxxxxxxxxxxxxxxxxxxx>,
> Alexander S Klein <asklein@xxxxxxxxxxx> wrote:
>
> > Hello,
> >
> > I have been doing some work with linear iteration rules. I have been
> > using the form Ax + B. I have noticed for A = -1, there are two
> > oscillating values for any possible seed.
> >
> > I was wondering if there is a formula for predicting these two oscillating
> > values? Can anyone please advise?
> >
> > Thanks,
> > Alex.
> >
>
> -x+B is the reflection about B/2, so the two values are equal
> distances on each side of B/2.
>
>
.
- Follow-Ups:
- Re: Linear Iteration Rules
- From: A N Niel
- Re: Linear Iteration Rules
- From: William Elliot
- Re: Linear Iteration Rules
- References:
- Linear Iteration Rules
- From: Alexander S Klein
- Re: Linear Iteration Rules
- From: A N Niel
- Linear Iteration Rules
- Prev by Date: Re: Integral Inequality
- Next by Date: Re: Why is there no *really* useful Algebra beyond complex numbers? (and if it were, would John Baez talk about it?)
- Previous by thread: Re: Linear Iteration Rules
- Next by thread: Re: Linear Iteration Rules
- Index(es):
Relevant Pages
|
