Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
Attempting to compute the kslog numerically (i.e., Kneser's construction)
#3
(09/24/2009, 12:17 AM)jaydfox Wrote: Anyway, to demonstrate the increased accuracy empirically, note the red lines. These correspond to the 105, 315, and 945 point systems, using 10-interval interpolation polynomials (11-points, with common endpoints).
Also, if you're wondering how I divide a 105-interval region into 10-interval sub-regions, note that the end regions are 7.5 intervals wide. So I would have an interpolating polynomial from 0 to 15/210, using the points 1/210, 3/210, 5/210, 7/210, 9/210, 11/210, 13/210, and 15/210. And thus on the other end of the interval as well (reflected, more or less).

As I start posting details and code, hopefully this will begin to make more sense.
~ Jay Daniel Fox
Reply


Messages In This Thread
RE: Attempting to compute the kslog numerically (i.e., Kneser's construction) - by jaydfox - 09/24/2009, 12:39 AM

Possibly Related Threads...
Thread Author Replies Views Last Post
  Kneser-iteration on n-periodic-points (base say \sqrt(2)) Gottfried 11 3,316 05/05/2021, 04:53 AM
Last Post: Gottfried
  fast accurate Kneser sexp algorithm sheldonison 38 111,638 01/14/2016, 05:05 AM
Last Post: sheldonison
  "Kneser"/Riemann mapping method code for *complex* bases mike3 2 9,793 08/15/2011, 03:14 PM
Last Post: Gottfried
  Attempt to make own implementation of "Kneser" algorithm: trouble mike3 9 23,613 06/16/2011, 11:48 AM
Last Post: mike3
  An incremental method to compute (Abel) matrix inverses bo198214 3 12,792 07/20/2010, 12:13 PM
Last Post: Gottfried



Users browsing this thread: 2 Guest(s)