I think it is a very bad idea to have default sorting based upon hashing.
This could make a lot of output appear seemingly random (despite having a
natural order), nor there is no way to deal consistently with hash
collisions. This would cause far more problems than it would solve when
working
I am not sure how much I support that because there is no metric. If you
are working with the Euclidean metric (the usual one you are used to), then
you can do
sage: l = line3d([(1,2,3), (4,5,6)])
sage: V = RR^3
sage: (V(l.points[1]) - V(l.points[0])).norm()
5.19615242270663
There could also
Hi,
let me take the opportunity to promote the use of the get_systems
function from sage.misc.citation which allows to see and acknowledge
which upstream packages were used by Sage for some computation, e.g.
sage: from sage.misc.citation import get_systems
sage: R. = PolynomialRing(QQ)
Yes. The function (fourier_series_partial_sum) is what I have in mind. Glad
to see that it is implemented.
Best.
21 Ağu 2022 Paz, saat 14:24 tarihinde David Joyner
şunu yazdı:
> On Sun, Aug 21, 2022 at 7:11 AM Furkan Semih Dündar
> wrote:
> >
> > Dear All,
> >
> > I want to implement an easy
On Sun, Aug 21, 2022 at 7:11 AM Furkan Semih Dündar
wrote:
>
> Dear All,
>
> I want to implement an easy function (afaik is lacking in Sage Math) that may
> be called as "fourier_expand" which will return Fourier series of a function
> (for which integrals can be calculated analytically) up to
Dear All,
I want to implement an easy function (afaik is lacking in Sage Math) that
may be called as "fourier_expand" which will return Fourier series of a
function (for which integrals can be calculated analytically) up to some
order N. If integrals cannot be calculated analytically, numerical
