Re: [sage-devel] Unimodular transformation matrix of LLL algorithm

On Sunday, September 27, 2020 at 1:48:03 PM UTC-7, Santanu Sarkar wrote: > > Dear Nils, >Thank you so much for your comments. > I consider Matrix E=[I,M1], where I is identity matrix. > Then reduction of E took 100 seconds. Hence I am not > going any advantage. > > Try [10^b*M1,I] with b

Re: [sage-devel] Unimodular transformation matrix of LLL algorithm

Dear Nils, Thank you so much for your comments. I consider Matrix E=[I,M1], where I is identity matrix. Then reduction of E took 100 seconds. Hence I am not going any advantage. Regards, Santanu On Mon, 28 Sep 2020 at 01:12, Nils Bruin wrote: > You could do the same thing as you do with Gau

Re: [sage-devel] Unimodular transformation matrix of LLL algorithm

You could do the same thing as you do with Gaussian elimination to track the row operations: augment the matrix with an identity matrix. In order for the augmentation to not affect your LLL reduction, you'd want to multiply your original matrix by a large constant, so that the augmented coordina

Re: [sage-devel] Unimodular transformation matrix of LLL algorithm

On Sun, 27 Sep 2020, 18:43 Santanu Sarkar, wrote: > Dear Martin, > Thank you so much. It works! > Can we make it faster? > It took 17 seconds for my problem but > M1.LLL() took only 3 seconds. Of course I understand we > are calculating extra matrix U. > one needs to do some Cython programmin

Re: [sage-devel] Unimodular transformation matrix of LLL algorithm

Dear Martin, Thank you so much. It works! Can we make it faster? It took 17 seconds for my problem but M1.LLL() took only 3 seconds. Of course I understand we are calculating extra matrix U. Thanks again for your help. Regards, Santanu On Sun, 27 Sep 2020 at 20:45, 'Martin R. Albrecht' via

Re: [sage-devel] Re: possible bug with manifolds

Funny... it works after restarting the kernel. I wonder how I managed that. On Sun, Sep 27, 2020 at 8:22 AM Eric Gourgoulhon wrote: > I cannot reproduce the issue with Sage 9.1. Are you sure that you have a > working install of Sage? > > Le dimanche 27 septembre 2020 à 11:03:25 UTC+2, abhic...@g

[sage-devel] Python 3.9 support ticket needs review

Python 3.9 is expected to be released in 1 week (2020-10-05). Ticket https://trac.sagemath.org/ticket/30184 adds support for it and is waiting for review. -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop re

Re: [sage-devel] Unimodular transformation matrix of LLL algorithm

Hi there, This should do the trick: sage: from fpylll import * sage: A = random_matrix(ZZ, 6, 90) sage: U = IntegerMatrix.identity(6) sage: B = LLL.reduction(IntegerMatrix.from_matrix(A), U).to_matrix(matrix(ZZ, 6, 90)) sage: U = U.to_matrix(matrix(ZZ, 6,6)) sage: B == U*A True sage: abs(U.det())

[sage-devel] Re: Unimodular transformation matrix of LLL algorithm

There is a ticket for that with some hints on how to do it. - Sage Trac ticket 25191 Add flag for returning LLL transformation matrix https://trac.sagemath.org/ticket/25191 Hopefully someone can expand on the hints, or even push a branch to the ticket. -- You received this message because y

[sage-devel] Unimodular transformation matrix of LLL algorithm

Dear all, I have a matrix M1 with integer entries with 90 rows and 6 columns. After applying LLL algorithm of M1, I get M2=M1.LLL(). I want to get corresponding unimodular transformation matrix T such that T*M1=M2. We can find T by T=M2*M1.pseudoinverse() or T== M1.solve_left(M2), but determinan

[sage-devel] Re: possible bug with manifolds

I cannot reproduce the issue with Sage 9.1. Are you sure that you have a working install of Sage? Le dimanche 27 septembre 2020 à 11:03:25 UTC+2, abhic...@gmail.com a écrit : > > I was following this >

[sage-devel] possible bug with manifolds

I was following this tutorial, and ran into issues with set_default_chart minimal example: E. = EuclideanSpace(coordinates='spherical') cartesian. = E.cartesian_coordinates() E