2018-04-12 07:30:10 +0200 | received badge | ● Famous Question (source) |
2016-06-10 15:06:29 +0200 | received badge | ● Popular Question (source) |
2015-03-28 14:09:24 +0200 | received badge | ● Popular Question (source) |
2015-03-28 14:09:24 +0200 | received badge | ● Notable Question (source) |
2014-10-15 00:10:24 +0200 | asked a question | solve differential equation I need to solve this third-order linear partial differential equation: d^2/dx^2 d/dy f(x,y) = f(x,y) - x*y Could you please help me to do this? Thank you very much for your advise! |
2014-10-04 16:15:30 +0200 | asked a question | computing integral Hello, I would like to compute for example this double integral: exp(ixcos(y)) 0 < x < pi 0 < y < 2 Could you please advice how to do that? Thank you very much for your answer. Martin |
2012-01-23 09:23:23 +0200 | answered a question | Graphing optimization results in economics sorry for my answer...I didnt understand when reading first |
2012-01-22 13:54:20 +0200 | received badge | ● Student (source) |
2012-01-22 13:29:20 +0200 | received badge | ● Supporter (source) |
2012-01-22 08:22:06 +0200 | asked a question | list of algorithms not implemented in Sage for contributors Hello all! I would like to know if there is some list of algorithms that are not implemented in Sage and that are important (for ex. because of its speed). I think that it would be great for contributors. I believe the greatest things are mostly free and that Sage is very good example of this. Lot of algorithms in Sage are the fastest (when I compare it with 'ma' softwares) and that is really amazing that something free and open source for everyone can do it! For this reason I would like to contribute to this project and think that the list of important algorithms that arent still implemented in Sage would be great 'to do list' for contributors. Thanks, Martin |
2012-01-17 07:01:29 +0200 | received badge | ● Teacher (source) |
2012-01-13 18:09:25 +0200 | received badge | ● Editor (source) |
2012-01-13 17:59:15 +0200 | commented question | coumputing algorithm symbolically but with given value Thank you DSM for your comment, I edited my question with example. Thanks, Martin |
2012-01-13 17:48:28 +0200 | answered a question | Finding short vectors kernel Just write M.LLL() instead of M.lll() |
2012-01-13 08:16:41 +0200 | asked a question | coumputing algorithm symbolically but with given value Hello all! I have following question. I have given matrix with numbers and one variable a. I need compute LLL reduction of the matrix, during the algorithm there are steps like this: if a< 'something' then do...for this reason I need substitution for a before the algorithm. Now here is my question: I want to solve the algorithm symbolically with variable a, but with the substitution for a that I define before- the algorithm should solve it with substitution but during its steps reminder symbolic value a and the result should be with a as variable. Example: I have matrix A=[[a, 23],[a^2, 12]] now the algorithm compute for ex. this: if a<10 then B=A-[[a^2, a+5],[a-1,2]] if a>10 then B= A-[[a^2+23, a],[a-1,2*a^2]] now I want to solve A symbolically, I want obtain result as for example B=A-[[a^2, a+5],[a-1,2]], but here is the problem, if I dont define the a before the algorithm, it would have exponential complexity / because in LLL algo. there are many steps like if a<10. For this reason I need substitution for a before the alogrithm, for example a=6, then the result in example above should be B=A-[[a^2, a+5],[a-1,2]] It is unexact result for a>10 but I want try just this in my analysis of LLL. Hope now it is clear. Thanks you very much for any advice! Martin |