For the benefit of people on the Racket Users list, we're discussing the
Conjugate Gradient (CG) method applied to Least Squares problems, as
described in the original paper by Hestenes and Stiefel:
http://www.math.purdue.edu/~lucier/jresv49n6p409_A1b.pdf
The formulas to use are (10:2) on page
I couldn't easily see another place to make this comment.
I'm working on SRFI-122, YAAL (Yet Another Array Library), so I'm
studying other array libraries and am trying to understand
array-axis-permute in the math/array Racket library:
http://docs.racket-lang.org/math/array_transform.html?q=permu
I learned some things by studying the Racket version of this program,
thanks.
I tried to rewrite it without using the Racket built-ins. In the end I
wanted a version where edits1 and edits2 wouldn't allocate the lists of
intermediate results, but rather process the items as they were
generat
On 10/31/2014 05:34 AM, Konrad Hinsen wrote:
> --On 27 octobre 2014 14:09:07 -0400 Bradley Lucier
> wrote:
>
>> heine:~/text/courses/computation/computational-reals/src> gsc
>> Gambit v4.7.3
>>
>>> (load "exact-reals")
>
> Is that Scheme
On 10/27/2014 12:00 PM, users-requ...@racket-lang.org wrote:
> Re: [racket] Nice article on scientific computing in Racket
Nice article. Some comments:
1. I don't have a login on hacker news, but someone should downvote the
first comment! (You actually show in your Figure 4(b) that the comment
By the way, I really like the underlying theme that modern
floating-point arithmetic has properties as rigorous and well defined as
those of integer arithmetic, and these properties can be relied on.
Over the years I've had several people working on multi-precision
arithmetic tell me that they jus
Many people on this list think deeply about pedagogy; perhaps the following
article published in the Notices of the American Mathematical Society, which
advocates teaching logical thinking via Scheme programming before advancing to
the usual university mathematics curriculum (calculus, etc.), ma
> In the process of toying with streams & memoization (more below), I've
> tripped over the question: when does Racket consider two lambdas to be
> identical?
I came across the same question when working with my constructive reals
package. (A constructive real number is basically a function th
Re:
FWIW, I would have at least written:
((qty (in-range 0 (add1 (min (floor (/ weight-left weight))
(floor (/ volume-left volume)))
I have now seen the
(floor (/ a b))
idiom a number of times, and wonder why people prefer it to
(quotient a b
On Apr 8, 2013, at 3:11 PM, users-requ...@racket-lang.org wrote:
I would never recommend against using GMP for bignum code, but I use code like
this for factorial, based on the idea of binary splitting:
(define (iota m n)
(let loop ((result '())
(n (- n 1)))
(if (<= m n)
I put files that open in web browsers of my benchmark results at
http://www.math.purdue.edu/~lucier/bench-gambit-2012-11-06/
with a readme that's basically my original e-mail with the version that
mzscheme reports (5.3) added.
I looked at the sources for fft.scm in the Gambit benchmark suite an
11 matches
Mail list logo
