I'm working on some code that is very computationally intensive. I'm
pretty sure my algorithm is good, but I know that tiny differences in
wording in sage can make a huge runtime difference. Is there any site/
blog/whatever that I could look at to find out what makes for fast
sage code? I figure t
That did it. Thank you very much.
--~--~-~--~~~---~--~~
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support-unsubscr...@googlegroups.com
For more options, visit this group at
http://groups.g
Here's the code I'm using: (theta_array is just a dummy for the real
thing, but the errors are the same)
theta_array = [(0,0),(1,2),(pi/2,pi),(pi,4),(3*pi/2,5),(2*pi,2*pi)]
s = spline(theta_array)
ellipse(x) = e^(i*x)-.5*e^(-i*x)
z(t) = ellipse(t)
zprime(t) = derivative(z)
def u(x,b):
return
Update:
Found some resources if they help.
An explanation of the theory can be found here:
http://www.springerlink.com/content/r44467137l65h5x1/
I think this paper might have some partial examples.
http://portal.acm.org/citation.cfm?id=901698
--~--~-~--~~~---~--~~
Here's the code I'm working with:
# Computes the theta correspondence function for the boundary defined
by G w/ center a going to 0
def boundaryMapper(G,a,n):
B = 2*pi
tk = [x*B/n for x in range(n)] # the collocation points
Gprime = derivative(G) # generate various intermediate functi
I'm doing some work with riemann mapping, and I need to create a
function that returns the complex argument of a symbolic function.
My function definition is something like f(x) = arg(-i*theta(x)^2*Gap
(x))
where theta and Gap are already defined. When I try this, I get this
error:
TypeError: Ca
