frontpage.
newsnewestaskshowjobs

Made with ♥ by @iamnishanth

Open Source @Github

fp.

Opus 4.7 Became Better at Web Design

https://www.yashthapliyal.com/blog/opus-4-7-web-design
1•yash1hi•1m ago•0 comments

Write broken commits for better review

https://huonw.github.io/blog/2026/04/broken-commits/
1•dbaupp•1m ago•0 comments

Ask HN: How did you get your first users with zero audience?

1•arikusi•3m ago•0 comments

I built send/links to stop losing links across tabs, bookmarks, and chats

https://sendlinks.app
1•prashantchanne•3m ago•0 comments

Characterizing the Impact of Congestion in Modern HPC Interconnects

https://arxiv.org/abs/2604.11432
1•matt_d•4m ago•0 comments

Stop Using JWTs

https://gist.github.com/samsch/0d1f3d3b4745d778f78b230cf6061452
1•birdculture•5m ago•0 comments

Shipfast.py – SaaS Starter Kit for Python Devs (FastAPI and Supabase and Stripe)

https://www.shipfastpy.com/
1•brandocalricia•7m ago•1 comments

The Long Hunt for China's Vanishing Elephant Slides

https://www.sixthtone.com/news/1018428
1•sohkamyung•7m ago•0 comments

Aliens.gov Resolves – To a WordPress "Site Not Found" Error

4•ascarola•9m ago•2 comments

Mechanics' institute

https://en.wikipedia.org/wiki/Mechanics%27_institute
1•hhs•9m ago•0 comments

Accessing Hardware in Rust

https://ferrous-systems.com/blog/hardware-access-rust/
1•PaulHoule•10m ago•0 comments

Rewiring financial services to scale intelligence

https://www.valtech.com/blog/rewiring-financial-services-to-scale-intelligence/
1•mooreds•11m ago•0 comments

Anubis weighs the soul of incoming HTTP requests to stop AI crawlers

https://github.com/TecharoHQ/anubis
2•rzk•11m ago•0 comments

Show HN: Rebuilt SETI Home but for AI

https://github.com/Agent-FM/agentfm-core
2•s4saif•12m ago•1 comments

Tessera: Unlocking Heterogeneous GPUs Through Kernel-Granularity Disaggregation

https://arxiv.org/abs/2604.10180
1•matt_d•16m ago•0 comments

Natural Selection Shaped Humanity

https://www.economist.com/science-and-technology/2026/04/15/how-natural-selection-really-shaped-h...
2•andsoitis•17m ago•0 comments

Big Tech's $300M election war chest rattles Democrats

https://www.ft.com/content/7529e4cd-e336-4b75-917b-84f91bc48437
1•petethomas•18m ago•0 comments

I Invented Lattice and Isomorphic Computing

https://github.com/aevov/afolabi-unified-framework
1•wakanda-island•20m ago•1 comments

Show HN: NoFS – What if files are just projections, graph is the truth?

https://nofs.ai/
1•mmethodz•24m ago•0 comments

Casus Belli Engineering

https://marcosmagueta.com/blog/casus-belli-engineering/
1•schonfinkel•32m ago•0 comments

Closure of Radio 4 on Long Wave (LW)

https://www.bbc.co.uk/reception/work-warning/news/radio4lw
2•austinallegro•33m ago•1 comments

Grpo explained: group relative policy optimization for LLM finetuning

https://cgft.io/learn/grpo-intro/
1•kumama•34m ago•0 comments

U.S. to Create High-Tech Manufacturing Zone in Philippines

https://www.wsj.com/world/asia/u-s-to-create-high-tech-manufacturing-zone-in-philippines-017c1668
12•dcgudeman•35m ago•7 comments

15% of Reddit Posts are Likely AI-generated in 2025

https://originality.ai/blog/ai-reddit-posts-study
3•akyuu•36m ago•2 comments

Street Fighter 2026 Trailer

https://www.youtube.com/watch?v=gX0Btbbddxk
3•havblue•39m ago•1 comments

Reed Hastings is leaving Netflix after 29 years

https://www.engadget.com/entertainment/streaming/reed-hastings-is-leaving-netflix-after-29-years-...
2•andsoitis•39m ago•0 comments

Helpful translations from British English (2015)

https://www.independent.co.uk/news/uk/home-news/chart-shows-what-british-people-say-what-they-rea...
1•worik•40m ago•1 comments

Unicorn Market Cap 2026: SF Is the GenAI Super Cluster

https://blog.eladgil.com/p/unicorn-market-cap-2026-sf-is-the
1•gmays•42m ago•0 comments

Ollama v0.21.0-Rc0

https://github.com/ollama/ollama/releases/tag/v0.21.0-rc0
1•maxloh•42m ago•0 comments

Release PiClaw v1.8.0 – This Is Spinal Tap

https://github.com/rcarmo/piclaw/releases/tag/v1.8.0
2•rcarmo•43m 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•11mo ago

Comments

staplung•11mo 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•11mo 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•11mo ago
A good resource is Gerard Sleijpen's course: https://webspace.science.uu.nl/~sleij101/Opgaven/NumLinAlg/
me3meme•11mo 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•11mo 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•11mo 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•11mo 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•11mo 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.