Where communities thrive


  • Join over 1.5M+ people
  • Join over 100K+ communities
  • Free without limits
  • Create your own community
People
Activity
  • May 14 01:33
    poulson closed #276
  • May 14 01:33
    poulson commented #276
  • May 14 01:30

    poulson on master

    Update README.md (compare)

  • May 14 01:24

    poulson on master

    added logo (compare)

  • May 10 21:37
    jedbrown commented #276
  • May 10 21:25
    poulson commented #276
  • May 10 21:21
    jedbrown commented #276
  • May 10 17:08
    poulson commented #276
  • May 10 17:03
    tesch1 opened #276
  • Apr 10 13:18
    JM1 commented #275
  • Apr 10 13:16
    JM1 synchronize #275
  • Apr 10 08:56
    JM1 opened #275
  • Mar 06 03:47
    Raviteja1996 closed #274
  • Mar 05 05:46
    Raviteja1996 opened #274
  • Feb 11 21:53
    BenBrock commented #228
  • Feb 11 21:52
    BenBrock commented #228
  • Feb 11 21:51
    poulson commented #228
  • Feb 11 21:50
    poulson commented #228
  • Feb 11 21:45
    BenBrock commented #228
  • Jan 23 23:57
    adambaskerville commented #273
Jack Poulson
@poulson
I don't recall creating an issue for it
LOL
yes, distributed Hessenberg QR is the last step
the coda will be a faster implementation of the element-wise <-> block-wise redistributions
why did you create and immediately close an issue?
Ryan H. Lewis
@rhl-
@poulson: because its done, I'm using it to just track the item
@poulson: github issues is quite inferior to JIRA for this sort of thing.
Jack Poulson
@poulson
OK, it's worth noting that sent out 300 emails
Ryan H. Lewis
@rhl-
haha, apologies.
Jack Poulson
@poulson
in the past five minutes you have sent out nearly 1000 :-)
but look what I did :)
Jack Poulson
@poulson
that is a nice checklist
Ryan H. Lewis
@rhl-
cant tell if that was sarcastic
Jack Poulson
@poulson
it's not sarcastic
Ryan H. Lewis
@rhl-
Im setting the Sept 3rd deadline
I think we can meet it
I can also look into a pure .deb solution
Jack Poulson
@poulson
OK. I'm likely to go dark for most of the weekend so that I can get the Hessenberg QR implemented
it's worth noting that there is an unfortunate habit of many users to just directly email me with their Elemental problems
one of the active ones is a supposed bug reported by an RPI student for this matrix: http://www.cise.ufl.edu/research/sparse/matrices/Bates/sls.html
Ryan H. Lewis
@rhl-
if its not a ticket is doesn't exist :)
Jack Poulson
@poulson
need to reproduce the bug before submitting issue
I also prefer not to spam the ever-living hell out of those watching the repo
Ryan H. Lewis
@rhl-
you should tell that user to report it
Jack Poulson
@poulson
but perhaps that is what is being asked for by 'watching' on GitHub
Ryan H. Lewis
@rhl-
i think so :)
ok, i'm going to head out for a bit, when I get back ill look into debian packaging
actually, if you are still game for a hackathon we could do that tomorrow
Jack Poulson
@poulson
I plan on working on the Hessenberg QR this weekend
happy to meet in person but that is what I think is my highest priority
Ryan H. Lewis
@rhl-
makes sense
Jack Poulson
@poulson
reproduced a crash in the sparse-direct least squares
will rerun in Debug mode to try to reproduce
Jack Poulson
@poulson
apparently it was just an std::bad_alloc
also, I have committed a step towards addressing the performance of ApplyPackedReflectors when there are only a few right-hand sides: elemental/Elemental@85572b9
Jeff Hammond
@jeffhammond

There should be a T-shirt or similar with this on it :-)

something in the middle of my preference to add functionality forever and your desire to release every day is likely the right compromise

Ryan H. Lewis
@rhl-
@poulson: thanks for doing that. I'm looking into writing BFGS in El. Is it possible to use the existing Reflectors to store arbitrary rank 1 updates to the identity?
Jack Poulson
@poulson
why use the reflection abstraction instead of using a product of tall-skinny dense matrices applied via a Gemm?
Ryan H. Lewis
@rhl-
Let me think about how to do that
Ryan H. Lewis
@rhl-
I'm not immediately seeing how you can use a Gemm here
Ryan H. Lewis
@rhl-
I guess if you think of Bk = B{k-1} + U_k + S_k then Bk*v = [ B{k-1} | U_k | S_k ]v is a Gemv
But each U_k and S_k are rank one
Ryan H. Lewis
@rhl-
But you need to apply the inverse
Ryan H. Lewis
@rhl-
@poulson: seeing IPM based BPDN using about 1000x the resources of ADMM.
Jack Poulson
@poulson
the sparse IPM BPDN should be much faster than the dense ADMM...
not that it is a fair comparison
but it's also not fair to compare the two without also looking at the achieved accuracy
Ryan H. Lewis
@rhl-
we have a dense matrix
does that mean that IPM BPDN is trying to create some kind of sparse matrix from our dense one? That would be horrible..