frontpage.
newsnewestaskshowjobs

Made with ♥ by @iamnishanth

Open Source @Github

fp.

A faster, cleaner way to use the Internet Archive

https://downloadstuffss.vercel.app/
1•dawitworku•1m ago•1 comments

Sequoia to invest in Anthropic, breaking VC taboo on backing rivals: FT

https://techcrunch.com/2026/01/18/sequoia-to-invest-in-anthropic-breaking-vc-taboo-on-backing-riv...
1•doppp•2m ago•0 comments

WhatsApp

1•kaifali•5m ago•0 comments

Ask HN: How do teams handle dynamic tool discovery for AI agents?

1•learningeek•5m ago•0 comments

Show HN: CervellaSwarm – 16 AI agents and 3 debug guardians, coordinated via MCP

https://github.com/rafapra3008/cervellaswarm
1•rafapra•6m ago•1 comments

Show HN: Interactive physics simulations I built while teaching my daughter

https://www.projectlumen.app/
1•anticlickwise•13m ago•0 comments

How crypto criminals stole $700M from people – often using age-old tricks

https://www.bbc.com/news/articles/c93w30gl5jno
2•1659447091•15m ago•0 comments

"Don't worry. Boys are hard to find." Part 1 o2

https://lisevoldeng.substack.com/p/dont-worry-boys-are-hard-to-find
1•DyslexicAtheist•15m ago•0 comments

Scaling long-running autonomous coding

https://simonwillison.net/2026/Jan/19/scaling-long-running-autonomous-coding/
1•roopeshv•19m ago•1 comments

Run AI tools like Cursor,Claude Code, Codex on your own models

https://github.com/Fast-Editor/Lynkr
1•vishalveera•19m ago•1 comments

Manage Claude Code Visually

https://github.com/Nearcyan/vibecraft
1•sadeshmukh•19m ago•0 comments

Are Arrays Functions?

https://futhark-lang.org/blog/2026-01-16-are-arrays-functions.html
1•todsacerdoti•20m ago•0 comments

AI Coworker

https://coworkai.app/
1•wantering•20m ago•0 comments

Show HN: Prediction Market Dominance Index

https://www.oddpool.com/dominance
1•codelemons•23m ago•0 comments

Production-Grade RAG Pipeline for Technical Documentation

https://alexanderfashakin.substack.com/p/building-trustworthy-documentation-rag-systems
1•alex_fash•24m ago•1 comments

Search 40M docs in <200ms on a CPU using binary embeddings and int8 rescoring

https://medium.com/coding-nexus/search-40m-documents-in-under-200ms-on-a-cpu-using-binary-embeddi...
1•akkishore•25m ago•0 comments

Statement from the Nobel Foundation

https://www.nobelprize.org/press-release/statement-from-the-nobel-foundation/
1•ColinEberhardt•25m ago•2 comments

Beowulf's opening "What" is no interjection

https://www.poetryfoundation.org/poetry-news/69208/new-research-opening-line-of-beowulf-is-not-wh...
1•gsf_emergency_6•30m ago•0 comments

Paying attention to Attention

https://suyogdahal.com.np/posts/paying-attention-to-attention/
1•just-another-se•36m ago•0 comments

The War on Drugs Is Why Your Bus Never Showed Up

https://maxmautner.com/2026/01/17/bus-marijuana.html
3•mslate•43m ago•0 comments

The Case for a Product Manager's Personal Agent

https://substack.com/inbox/post/185033315
2•carni234•43m ago•0 comments

How to write a good spec for AI agents

https://addyosmani.com/blog/good-spec/
1•saikatsg•44m ago•0 comments

Reliability Engineering 0→1

https://medium.com/@sandhyavinjam/reliability-engineering-0-1-how-to-scale-from-startup-chaos-to-...
1•sandhyavinjam•44m ago•0 comments

The AI Engineer Roadmap

https://www.aihero.dev/ai-engineer-roadmap
1•saikatsg•51m ago•0 comments

Show HN: Automated Google Slide Reports for multiple entities

https://github.com/rvignesh89/gslides_automator
1•rvignesh•57m ago•0 comments

Show HN: Yashiki – A tiling window manager for macOS in Rust, inspired by River

https://github.com/typester/yashiki
2•typester•59m ago•1 comments

Show HN: Omelo- AI pet health companion, Health timelines and Daily care

1•animalcatcher•59m ago•0 comments

Show HN: Early web-inspired writing platform

https://writing.ink/
1•eamonobr•1h ago•0 comments

Farath's Bi-Weekly Code Security Brief – Jan 1-19 Vulns SAST/SCA/DAST Playbooks

https://farathappsec.substack.com/p/faraths-biweekly-code-security-brief
2•farathshba•1h ago•1 comments

Wdlite

https://wdlite.toolforge.org/?item=Q686797
2•altilunium•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•8mo ago

Comments

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