Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
Equations for Kneser sexp algorithm
(06/10/2011, 08:48 AM)bo198214 Wrote:
(08/08/2010, 07:14 PM)sheldonison Wrote: Theta(z) has a singularity at all integer values of n. Theta(z) is represented by an infinite sequence of fourier terms. The fourier series for theta(z) can be developed from any arbitrary unit length on the real axis of sexp(z), where z>-2. Only terms with positive values of n are included, and all terms a_n for negative values of n are zero.

I have to ask here again. "Only terms with positive values of n are included.":
Why did you put that restriction?
Is there inherent reason, or is it just that you think this is the most natural and simplest way?
For clarity, this is the integral, to generate the individual a_n terms for the Fourier series approximation, generated from the sexp(z) approximation.

, Kneser Riemann mapping approximation, for

Because sexp(z) here, is only an approximation, including terms with negative values of n would mean that theta(z) would not decay as z goes to . It would also mean that the theta(z) function would only be defined at one and only one value of , since an infinite Fourier series typically only converges where the series is sampled. For this algorithm, I have chosen to sample at imag(z)=0.12i, see Jan 11th 2011 post. By throwing out the a_n terms, with n<0, we have a function which is defined for , with singularities at integers. The singularities are because the sexp(z) approximation function we are generating the Fourier series of is only approximate. So is only an approximately 1-cyclic function. Since the solution we are ultimately looking for has a_n terms with negative values of n all zero, this allows the iterated sequence of functions to converge. Again, I think the picture in the previous post I linked to helps a lot. After doing the Fourier analysis, the function on this circle is used to generate the next sexp(z) approximation, as described in the algorithm, where f(x) is the previous sexp(z) approximation. The sexp(z) would also require a full Laurent series to converge on the unit circle (and then only converge on the unit circle), but we throw out the coefficients for the z^-n terms.
[Image: attachment.php?aid=829]

If we had the exact sexp(z) function, and we did an exact infinite Fourier analysis at the real axis, or at any other value of , then all of the a_n terms with negative n would be zero, and the infinite sequence of positive a_n terms gives a function which converges for >=0, as long as z is not an integer.
- Sheldon

Messages In This Thread
RE: Equations for Kneser sexp algorithm - by sheldonison - 06/10/2011, 01:43 PM

Possibly Related Threads...
Thread Author Replies Views Last Post
  Arguments for the beta method not being Kneser's method JmsNxn 54 6,071 10/23/2021, 03:13 AM
Last Post: sheldonison
  tommy's singularity theorem and connection to kneser and gaussian method tommy1729 2 445 09/20/2021, 04:29 AM
Last Post: JmsNxn
  Generalized Kneser superfunction trick (the iterated limit definition) MphLee 25 8,059 05/26/2021, 11:55 PM
Last Post: MphLee
  Alternative manners of expressing Kneser JmsNxn 1 865 03/19/2021, 01:02 AM
Last Post: JmsNxn
  Arbitrary Order Transfer Equations JmsNxn 0 620 03/16/2021, 08:45 PM
Last Post: JmsNxn
  Questions about Kneser... JmsNxn 2 1,179 02/16/2021, 12:46 AM
Last Post: JmsNxn
  New Quantum Algorithms (Carleman linearization) Finally Crack Nonlinear Equations Daniel 2 1,407 01/10/2021, 12:33 AM
Last Post: marraco
  Kneser method question tommy1729 9 9,739 02/11/2020, 01:26 AM
Last Post: sheldonison
  Moving between Abel's and Schroeder's Functional Equations Daniel 1 3,010 01/16/2020, 10:08 PM
Last Post: sheldonison
  Sexp redefined ? Exp^[a]( - 00 ). + question ( TPID 19 ??) tommy1729 0 3,240 09/06/2016, 04:23 PM
Last Post: tommy1729

Users browsing this thread: 1 Guest(s)