Other people can probably suggest other speedups, but one thing I
tried was adding:
var('x,y') #presumably you already did this at some point
npi = RDF(pi)
Having a numerical version of pi seems to speed it up by a factor of
20 or so.
-M. Hampton
On Nov 25, 8:47 pm, Joshua Friedman <crownea...@gmail.com> wrote:
> The following program runs really, really slowly. Is there anyway to
> speed this up. I tried it as a .spyx program, put it wouldn't compile:
> It takes my machine around 10 seconds. I suppose it is the symbolic math?
>
> f(x,y) = y^2*abs(3*exp(2*pi*i*(x+i*y))*3*exp(4*2*pi*i*(x+i*y)) +
> 8*exp(2*pi*i*(x+i*y))*10*exp(4*2*pi*i*(x+i*y)))
> maxY = 5
> M=10
> d = 0.1
> supNorm = 0
> for N in range(0,M):
> for K in range (0, M*(int(maxY-1/2)+1) ):
> a = -0.5 + N*d
> b = 0.5 + K*d
> if f(a,b) > supNorm:
> supNorm = f(a,b)
> print N
> print supNorm
>
>
>
> On Wed, Nov 25, 2009 at 12:08 PM, <sage-support@googlegroups.com> wrote:
> > Today's Topic Summary
>
> > Group:http://groups.google.com/group/sage-support/topics
>
> > Is it possible to do a binary upgrade similar to sage -upgrade? [2 Updates]
> > how to scroll down more when doing ?? for long listing? [4 Updates]
> > Short question about saving the source of a Sage notebook [3 Updates]
> > Can't run Cython's hello world example [1 Update]
> > Shortcut for going down a cell [1 Update]
> > symbolic linear algebra: beginner questions [2 Updates]
>
> > Topic: Is it possible to do a binary upgrade similar to sage -upgrade?
>
> > "Carlos Córdoba" <ccordob...@gmail.com> Nov 25 09:21AM -0500
>
> > Thanks for the tip Mike. I'll investigate this approach and report progress,
> > if I make some.
>
> > Carlos
>
> > 2009/11/24 Mike Hansen <mhan...@gmail.com>
>
> > Harald Schilly <harald.schi...@gmail.com> Nov 25 07:32AM -0800
>
> >> zsync
>
> > FWIW, I implemented zsync and it isn't good. It's probably the same
> > underlying issue as with rsync, where too many small connections try
> > to fetch small files but overall it takes much longer and the whole
> > traffic might be even worse. zsync issued warnings about block sizes,
> > i reduced their size and the zsync files got bigger than 20 mb.
> > Therefore I'll remove zsync from the mirror network.
>
> > H
>
> > Topic: how to scroll down more when doing ?? for long listing?
>
> > Nasser Abbasi <n...@12000.org> Nov 24 05:27PM -0800
>
> > hi;
>
> > I have 2 questions below:
>
> > I created an account on sagenb.org, and when I do
>
> > solve??
>
> > I get the listing, but it does not list the whole code, and there is
> > no way for me to look below what is shown on the screen (there is no
> > scroll bar for use to scroll down more). My browser ofcourse has
> > scroll down bar, but not for the listing itself.
>
> > Is this a feature of the server or a bug?
>
> > I also find it strange that I could not use wild card for searching, I
> > keep forgetting name of commands. It would nice if one in sage can
> > write
>
> > *solve*?
>
> > No object '' currently defined.
>
> > to get listing of all functions in which the word 'solv' is in its
> > name, as I can do in Mathematica:
>
> > *solve*?
>
> > System`
> > DSolve LinearSolveFunction NSolve SolveAlways
> > FrobeniusSolve MainSolve RSolve SolveDelayed
> > LinearSolve NDSolve Solve
>
> > AbstractAlgebra`Master`
> > RingSolve
>
> > May be this can be added for a future release as it is really useful
> > to have.
>
> > --Nasser
>
> > Marshall Hampton <hampto...@gmail.com> Nov 24 05:38PM -0800
>
> > What browser are you using? The browser scroll bar works fine for me
> > with long ?? entries.
>
> > As a temporary workaround, to get the code of an object foo you could
> > do something like:
>
> > print open(foo.__code__.co_filename).read()
>
> > -Marshall Hampton
>
> > Nasser Abbasi <n...@12000.org> Nov 24 06:07PM -0800
>
> > On the scroll part: I think it is my error.
>
> > My eyes are trained to look for closing end if and some sort of end of
> > function indicator. So I assumed there is more code to follow since I
> > saw an 'if' and no closing for the 'if'
>
> > After I posted this, I realized that the listing is all there is, and
> > this is, like, pyhton, duh, and it has no end if, and end def, but
> > uses indentation to indicate the structure of the code.
>
> > silly me.
>
> > I find it nice that one can list the source code.
> > --Nasser
>
> > Simon King <simon.k...@nuigalway.ie> Nov 25 03:53AM -0800
>
> > Hi Nasser!
>
> >> *solve*?
>
> > I agree that this would be nice.
>
> > However, the commands search_def, search_doc and search_src might
> > help.
>
> > For example,
> > sage: search_def('solve')
> > yields
> > matrix/matrix_modn_sparse.pyx:860: def
> > _solve_right_nonsingular_square(self, B, algorithm=None, check_rank =
> > True):
> > matrix/matrix2.pyx:84: def solve_left(self, B, check=True):
> > matrix/matrix2.pyx:125: def solve_right(self, B, check=True):
> > matrix/matrix2.pyx:304: def _solve_right_nonsingular_square(self,
> > B, check_rank=True):
> > matrix/matrix2.pyx:371: def _solve_right_general(self, B,
> > check=True):
> > matrix/matrix_integer_dense_hnf.py:297:def
> > solve_system_with_difficult_last_row(B, a):
> > matrix/matrix_integer_dense_saturation.py:104:def
> > solve_system_with_difficult_last_row(B, A):
> > matrix/matrix_double_dense.pyx:764: def solve_left_LU(self, b):
> > matrix/matrix_double_dense.pyx:820: def solve_left(self,vec):
> > matrix/matrix_integer_dense.pyx:3514: def
> > _solve_right_nonsingular_square(self, B, check_rank=True):
> > ...
> > (a total of 39 lines)
>
> > Kind regards,
> > Simon
>
> > Topic: Short question about saving the source of a Sage notebook
>
> > Minh Nguyen <nguyenmi...@gmail.com> Nov 25 01:06PM +1100
>
> > Hi folks,
>
> > I received the following question about the notebook, but I have no
> > idea how to answer the question. I don't use the notebook on a
> > regularly basis. I thought someone on this list could help out.
>
> > --
> > Regards
> > Minh Van Nguyen
>
> > On Wed, Nov 25, 2009 at 4:01 AM, Bernhard Esslinger
>
> > Dan Drake <dr...@kaist.edu> Nov 25 12:06PM +0900
>
> >> My question is: Is there an easy way to move *.PY files instead of *.SWS
> >> files, as the SWS file are very big?
>
> > SWS files are just bzip'ed tar files. You can do
>
> > $ tar jtf foo.sws
>
> > to see the files inside a worksheet. If the .sws file is very big, it's
> > probably because there are lots of snapshots stored in it, so you could
> > extract the files, delete all the snapshot files, and then recompress
> > it. The actual code of the worksheet is in the file worksheet.txt.
>
> > Dan
>
> > --
> > --- Dan Drake
> > -----http://mathsci.kaist.ac.kr/~drake
> > -------
>
> > William Stein <wst...@gmail.com> Nov 24 07:10PM -0800
>
> >> extract the files, delete all the snapshot files, and then recompress
> >> it. The actual code of the worksheet is in the file worksheet.txt.
>
> > (1) in sage >= 4.2 snapshots are never saved in worksheet files. I
> > think they might be saved in older version.
>
> > (2) the file is named worksheet.html now, instead of worksheet.txt
> > (like it used to be).
>
> > William
>
> > Topic: Can't run Cython's hello world example
>
> > "Jorge E. ´Sanchez Sanchez" <hnr...@hotmail.com> Nov 24 12:43PM -0600
>
> > Robert:
>
> > That was it!!!
>
> > I've just added the flags recommended here (after making the test with
> > distutils.sysconfig) and finally I got hw working.
>
> > Best regards,
> > Jorge
>
> >> For more options, visit this group at
> >>http://groups.google.com/group/sage-support
> >> URL:http://www.sagemath.org
>
> > _________________________________________________________________
> > Otto te muestra IE8
> >www.otto.com.mx
>
> > Topic: Shortcut for going down a cell
>
> > cool-RR <cool...@cool-rr.com> Nov 24 07:36PM +0200
>
> > Do these issues go anywhere? Does someone write it in an issue tracker or
> > should I?
>
> > --
> > Sincerely,
> > Ram Rachum
>
> > Topic: symbolic linear algebra: beginner questions
>
> > William Stein <wst...@gmail.com> Nov 24 09:27AM -0800
>
> >> Any suggestions?
>
> > Use Sage. Don't use Maxima.
>
> > var('a1,a2,b1,b2,c1,c2')
> > a = matrix([[a1],[a2]])
> > b = matrix([[b1],[b2]])
> > c = matrix([[c1],[c2]])
> > M = (a-c).stack(b-c)
> > N = transpose(a-c).stack(transpose(b-c))
>
> > or
>
> > R.<a1,a2,b1,b2,c1,c2> = QQ[]
> > a = matrix([[a1],[a2]])
> > b = matrix([[b1],[b2]])
> > c = matrix([[c1],[c2]])
> > M = (a-c).stack(b-c)
> > N = transpose(a-c).stack(transpose(b-c))
>
> > See
>
> >http://sagenb.org/home/pub/1123/
>
> > William
>
> > William Stein <wst...@gmail.com> Nov 24 09:28AM -0800
>
> >> Use Sage. Don't use Maxima.
>
> > Oh, but just for the record, Sage may use Maxima automatically in the
> > background for some operations, when you do what I suggested.
>
> > --
> > William Stein
> > Associate Professor of Mathematics
> > University of Washington
> >http://wstein.org
>
> > --
> > 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.google.com/group/sage-support
> > URL:http://www.sagemath.org
>
> --
> Joshua Friedman PhD
> crownea...@gmail.comhttp://www.math.sunysb.edu/~joshua
--
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.google.com/group/sage-support
URL: http://www.sagemath.org
