Hi Kacper,
thanks, fixed in SVN 1267.
Jürgen
On 4/19/20 10:02 PM, Kacper Gutowski
wrote:
On Sun, Apr
19, 2020 at 08:48:27PM +0200, Dr. Jürgen Sauermann wrote:
Not sure what;s wrong with your qt
Hi,
On 4/19/20 10:02 PM, Kacper Gutowski
wrote:
On Sun, Apr
19, 2020 at 08:48:27PM +0200, Dr. Jürgen Sauermann wrote:
Not sure what;s wrong with your qt
(character ?) since I don't have it.
This behavior is i
On Sun, Apr 19, 2020 at 08:48:27PM +0200, Dr. Jürgen Sauermann wrote:
Not sure what;s wrong with your qt (character ?) since I don't have it.
This behavior is indicative of a NaN:
⊢NaN←12⎕CR17⎕CR'AAAgICABAgAAAPj/AAA='
0.0
0×NaN
DOMAIN ERROR
0×N
Hi Rowan,
I would not use RATIONAL_NUMBERS_WANTED=yes
in the context of linear algebra even though
I don't think it makes a difference. Its probably just slower.
I am getting this:
68.64208074 ¯28.28427125 ¯4.478949969E¯15
¯9.8275
Greetings again,
This question is more about decimal precision and internal storage of
numeric data in APL, but in the context of these linear algebra solutions.
So far I've implemented Householder reflection, Hessenberg decomposition, &
Wilkinson shift. I am very close (I think!) to having a gene
Another deficiency I've noticed in my above solution is that it does not
converge for complex eigenvalues.
- Rowan
On Mon, Apr 13, 2020 at 6:07 PM Rowan Cannaday wrote:
> Here is a quick solution to the eigenvalue problem. Should be refined and
> extended to calculate eigenvectors.
>
> {0~⍨∈⍵×∘
Here is a quick solution to the eigenvalue problem. Should be refined and
extended to calculate eigenvectors.
{0~⍨∈⍵×∘.=⍨⍳≢⍵}({r+.×⍉qt⊣(qt r)←⌹[⎕CT]⍵ ;qt;r}⍣{(|⍺)≡|⍵}) 3 3 ⍴ ⍳9
16.11684397 ¯1.11684397 ¯3.625973215E¯16
As a quick note, my ⎕CT was 1E¯13, however it doesn't seem to zero out the
The paper you referred to was a huge epiphany for me.
Having previously worked in the business world using COBOL and FORTRAN
the beauty and elegance of APL blew me away. It still does.
At IPSA we used to model proposed changes (mostly algorithms) to the
interpreter in APL first.
And then wrot
This is fantastic, I was not aware you had added an axis operator to
monadic ⌹.
Will mess around with this when I've got time.
Thanks again,
- Rowan
On Mon, Apr 13, 2020 at 3:48 PM Dr. Jürgen Sauermann <
mail@jürgen-sauermann.de> wrote:
> Hi Rowan,
>
> see below.
>
>
> On 4/13/20 4:57 PM, Rowa
Hi Rowan,
see below.
On 4/13/20 4:57 PM, Rowan Cannaday
wrote:
"I
added a
new primitive in GNU APL which computes the QR
factorization of a real
"I added a
new primitive in GNU APL which computes the QR factorization of a real
or complex matrix"
Looking through the source code I see the following in `src/LApack.hh`:
```
// Compute QR factorization with column pivoting of A:
// A * P = Q * R
//
char * pivot_tau_tmp = new char[N*(si
Hi again,
sorry, but I have to correct myself: it was actually Peter Teeson
who
pointed us to the ACM papers.
Best Regards,
Jürgen
On 4/13/20 1:17 PM, Dr. Jürgen
Sauermann wrote:
Hi Rowan,
Hi Rowan,
i would like to share some thoughts of mine with you.
First of all some history. As you have correctly noticed, LAPACK
was a build
requirement for GNU APL up to including version 1.4. Looking at
the
configure.ac in 1.4:
I've been mulling over methods of bringing linear algebra methods into
gnu-apl, specifically eigenvalues & eigenvectors (leaving open the
possibility for more).
The canonical methods for this are from LAPACK (which was formerly a
compilation dependency).
Specifically:
dgeev
dsyev
zheev
14 matches
Mail list logo
