We are playing the awesome @AfterAllFest this weekend!!!!
Friends old and new come and join the party @thepeerhat on Sat night (on stage at 9). Buzzin to share a stage with so many awesome acts.
Get your tickets here 👇 https://t.co/Eg4DrjBzJv
See you down the front 🌠🎶🐝💫
@reidatcheson One can sometimes do a little better by selecting the k vectors to orthogonalize against from *all* previous basis vectors, not just the latest ones https://t.co/DoBn2gDEDU
But the cond number will grow exponentially eventually for nonsymmetric A (see the thm).
I gave an informal talk on the CLASSIX clustering algorithm in our @nla_grp seminar yesterday. It contains some MATLAB and Python live demos. https://t.co/Ai5xmTsyFD
@MarcelSchweitz1 Nice work! We just posted https://t.co/TgHKe99DCB -- now I wonder how your algorithm would compare to using sketched GMRES for solving the linear system formulation of the matrix equation (with a Kronecker structured sketch operator)
New work on combining sketching and Krylov subspace recycling with Liam Burke from @MathsTCD and Stefan Güttel @guettel. New algorithm GMRES_SDR and theoretical analysis of sketched GMRES, which we build upon to analyse our new method. https://t.co/8riNUj25cV
CLASSIX a new clustering method that provides textual and visual explanations of its outputs.
It is also super fast. It clusters 2 million data points in under a second on a laptop where DBSCAN would require an hour. https://t.co/qwyc5fkRq7
@latzplacian I read "Counterexamples in Analysis" while studying Wegert's 4-semester Analysis course at Freiberg. These counterexamples really annoyed me and I much prefer Complex Analysis now 😅
New work on combining Krylov subspace recycling with randomized sketching for matrix functions and linear systems - https://t.co/8GIXNNpsg1 (with Liam Burke @tcddublin)