frontpage.
newsnewestaskshowjobs

Made with ♥ by @iamnishanth

Open Source @Github

fp.

More common mistakes to avoid when creating system architecture diagrams

https://www.ilograph.com/blog/posts/more-common-diagram-mistakes/
1•billyp-rva•52s ago•0 comments

The Chagos islanders who made it home

https://www.telegraph.co.uk/news/2026/02/28/my-72-hour-ocean-odyssey-to-meet-the-chagos-islanders/
1•OJFord•1m ago•0 comments

No fences, no guards at ASML HQ. The EUV monopoly sits on a bike path

https://lightcapai.medium.com/i-walked-up-to-the-most-powerful-chokepoint-in-tech-there-were-no-g...
1•gurbuzoyuncu•1m ago•0 comments

"Energy fishes" – floating turbines for ecological hydropower

https://energyminer.eu/en/
1•xg15•3m ago•1 comments

Ask GitHub Repo – Chat with any public codebase (free tool)

https://99helpers.com/tools/ask-github-repo
1•nickk81•7m ago•0 comments

Total fertility rate doesn't tell the number of births women eventually have

https://ourworldindata.org/total-fertility-rate-births-per-woman
1•shubhamjain•7m ago•0 comments

Can Programming Be Liberated from the von Neumann Style? (1977) [pdf]

https://worrydream.com/refs/Backus_1978_-_Can_Programming_Be_Liberated_from_the_von_Neumann_Style...
2•tosh•8m ago•0 comments

Show HN: PianoFun – Browser piano learning game with MIDI (vanilla JavaScript)

2•victorbuilds•10m ago•1 comments

PersonaWars

https://personawars.com
1•colapsis•12m ago•0 comments

Memory crisis latest: What we learned from the top producers this week

https://www.cnbc.com/2026/03/20/memory-crisis-latest-dram-chips-micron-samsung-sk-hynix.html
1•1vuio0pswjnm7•12m ago•1 comments

Bernie vs. Claude [video]

https://www.youtube.com/watch?v=h3AtWdeu_G0
1•krtab•15m ago•0 comments

StitchSentry – preflight checks for embroidery files

https://stitchsentry.com
1•naifmhd•21m ago•0 comments

Flash-Moe: Running a 397B Parameter Model on a Mac with 48GB RAM

https://github.com/danveloper/flash-moe
2•mft_•22m ago•0 comments

EVs can make power grids more reliable (and earn owners money)

https://techxplore.com/news/2026-03-electric-cars-power-grids-reliable.html
1•geox•24m ago•0 comments

Open source infrastructure (built in Rust) for internal software and AI agents

https://github.com/RootCX/RootCX
1•seyz•31m ago•0 comments

Calendrical Calculations

https://en.wikipedia.org/wiki/Calendrical_Calculations
3•tosh•38m ago•1 comments

When machines pay machines, who bills the machine?

https://www.billingbird.io/p/when-machines-pay-machines-who-bills
3•the_reconciler•39m ago•1 comments

No existing dev tool fits perfectly, so I built my own

https://devleo.ch/blog/build-your-own-workflow
2•leonardcser•41m ago•1 comments

One Word Silenced the West [video]

https://www.youtube.com/watch?v=l6lbSU189AQ
2•joe_mamba•41m ago•0 comments

Reports of code's death are greatly exaggerated

https://stevekrouse.com/precision
5•stevekrouse•43m ago•2 comments

Only 9% of MSPs have strong email spoofing protection across lookalike domains

https://shieldmarc.com/blog/research/uk-msp-dmarc-audit-2026
2•AMuffinman•43m ago•1 comments

A little gap that will ensure the future of AI Agents being autonomous

3•utsav-develops•45m ago•0 comments

Non-trivial error in physics paper found via Lean

https://arxiv.org/abs/2603.08139
3•leanexplorer•49m ago•1 comments

Careless Whisper – personal local speech to text

https://github.com/YarivGilad/careless-whisper
2•harel•50m ago•0 comments

Amanda Peet on Getting Breast Cancer While Losing Her Parents

https://www.newyorker.com/culture/the-weekend-essay/my-season-of-ativan
2•Anon84•59m ago•0 comments

Decorative Patterns of the Ancient World (1930)

https://archive.org/details/in.gov.ignca.39205
1•bookofjoe•1h ago•0 comments

CryptoSlate is charging AI agents $0.09 per article via x402

https://proofivy.com/blog/cryptoslate_x402_pay_per_article_is_live
1•maarten3•1h ago•0 comments

Contrarian AI Investment Theses

https://investinginai.substack.com/p/the-great-ai-contraction-5-contrarian
2•robmay•1h ago•1 comments

Anthropic sent lawyers – no more Claude Max in OpenCode

https://twitter.com/thdxr/status/2034730036759339100
4•BaudouinVH•1h ago•2 comments

Ext-Markdown-mirror – now supports Pages Router and better image handling

https://github.com/JakubKontra/next-markdown-mirror
1•JakubKontra•1h ago•0 comments
Open in hackernews

Numerical Linear Algebra Class in Julia TUM

https://venkovic.github.io/NLA-for-CS-and-IE.html
145•darboux•10mo ago

Comments

staplung•10mo ago
Not exactly the same material but U. Michigan has their Robotics 101 course up as well: Computational Linear Algebra, also in Julia.

https://github.com/michiganrobotics/rob101/tree/main

ted_dunning•10mo ago
This is a nicely comprehensive course, but it looks like it is pretty fast paced, especially in the last few lectures (some of those later slides definitely aren't finished).

As a reference, it looks very useful.

stabbles•10mo ago
A good resource is Gerard Sleijpen's course: https://webspace.science.uu.nl/~sleij101/Opgaven/NumLinAlg/
me3meme•10mo ago
I just selected lecture 07 to take a look: Lecture 07 is about QR factorizacion and Householder reflections. The author proves how to construct a reflection to make zeros in the first column and then he just claims that following this procedure for the other columns finish the proof. But he should prove or justify why the other reflections do not destroy the zeros of previous reflections. Also he proves that a vector v is the vector to construct the reflection (but there is a factor of 2 that was not correctly simplified, maybe a latex error), but I think that it should be more general and easier to prove that for any w the vector from w to its image f(w) is the orthogonal vector to the plane of the reflection.

I thank the author for the slides, but this little proof need some more care, I don't know about the quality of other sections or the overall quality of the slides. Anyway I like how he tries to make things easy but good work is hard.

Edited: I was wondering whether a LLM reading Lecture 7 would detect what was missing in the proof. I tried with deepseek but its first feedback on the Lecture 7 was positive, then when prompted about the incomplete proof it recognized it as a common error and explained how to complete the proof. Also I have to prompt it about the bad factor 2 for it to detect it. So it seems that deepseek is not a useful tool to judge quality of math content without very expert guidance, deepseek suggested to ask the LLM to compare this proof with another proof to detect important or vital differences.

Certhas•10mo ago
That's an absolutely obvious step though? As in, detailed lecture notes should maybe elaborate with a sentence, but in a lecture I would not put this on the slides but mention the core point and expect students at this level (who should have seen some amount of more theoretical LinAlg courses by then) to understand how to do the 1 line calculation.

There aren't even any real details to fill in, you iterate on the lower right block so anything you do is orthogonal to the upper left block. Do a 2x2 block matrix multiplication to convince yourself that this preserves the form achieved so far.

me3meme•10mo ago
-- Do a 2x2 block matrix multiplication to convince yourself that this preserves the form achieved so far.

I don't consider this a proof. Perhaps you have in mind two simple but key properties of reflections about the hyperplane orthogonal to a vector v: (a) The hyperplane of a reflection is the fixed point of the reflection (b) the hyperplane is the orthogonal vector space to the vector space spanned by v. From this two properties it follows that each step of making zeroes does not change previous zeroes.

Your claim that for advanced students there is no need to comment about details it is not falsifiable. Citing Mac Lane: A monad is just a monoid in the category of endofunctors.

But from a practical point of view one can see the very basic level and simplicity of the definitions and calculations prior to the proof. So at this level of detail I consider that noticing that one must be careful to not destroy previous zeros is matching the level of discourse at the proper level.

Certhas•10mo ago
10 LB = LB' 0Q 0A 0A'

The proof says iterate on A, so that obviously creates a lower dimensional rotation Q that will act on the full space as above.

Absolutely mention this in lecture notes/during the lecture.

slwvx•10mo ago
I guess the title would better be "Numerical Linear Algebra Class in Julia at TUM". I.e. the "TUM" in the title does not mean that there's some new "TUM" version of Julia, rather that the class is at the Technical University of Munich.