frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Ask HN: What does your AI workflow look like?

1•tadziokas•1m ago•0 comments

The Importance of Human Knowledge in the AI Era

https://jonbehnken.substack.com/p/the-case-for-learning
1•greedywhale•4m ago•0 comments

Claude Isn't Allowed to Write Me Prose

https://blog.kvit.app/posts/agent-not-allowed-to-write-prose/
1•skolos•6m ago•0 comments

YouTube stores three auto-extracted frames for every video, and nobody uses them

https://github.com/InfinityLoop1308/PipePipeClient/pull/98
1•jrejaud•8m ago•0 comments

How AI Is Accelerating PCB Design and Prototyping

https://www.eetimes.com/how-ai-is-accelerating-pcb-design-and-prototyping/
1•giuliomagnifico•11m ago•0 comments

Poisoning a Go Cache

https://lukasschwab.me/blog/gen/poisoning-go-cache.html
1•ingve•15m ago•0 comments

Genius AI APı Anahtarı

1•Ayazefe•15m ago•0 comments

Makeraoke: Share your side project in a video between three and nine minutes

https://www.reddit.com/r/Makeraoke/
1•cs1996•16m ago•0 comments

Musk – Official Trailer (2026)

https://www.youtube.com/watch?v=-52sVAzXwLM
2•Betelbuddy•17m ago•0 comments

Sandbox-first AI coding harness

https://chock.ws/
1•rosscomputerguy•21m ago•0 comments

Show HN: Peekaboolean – image and jev-like typed questions in typed anwers out

https://github.com/bykof/peekaboolean
1•bykof•23m ago•0 comments

I Posed as a Problem Gambler. DraftKings Made Me a VIP

https://www.propublica.org/article/draftkings-sports-gambling-problem-vip-fanduel
2•theblazehen•23m ago•1 comments

Show HN: Afterlife Vault – a virtual dead man's switch

https://afterlife-vault.com
1•wmeter•23m ago•1 comments

Using Claude Code: Spending your effort

https://claude.dev/blog/spending-your-effort/
2•e12e•24m ago•0 comments

The year AGI happened, and some unhinged predictions

https://w.ouzu.im/aweb/unhinged
1•dsign•27m ago•0 comments

Show HN: LightCloud – A cloud console organised like file system

https://www.light-cloud.com/
2•yullius•27m ago•0 comments

From game physics to care robots (2023) [The Royal Society] [video]

https://www.youtube.com/watch?v=R1D9Ma4m9Q0
1•zeristor•30m ago•0 comments

How can you quikly tell if a technical article lacks firsthand experience?

2•sarra01•32m ago•0 comments

There are no borders or boundaries on our planet (2023)

https://stargazingguy.co.uk/2023/05/02/there-are-no-borders-or-boundaries-on-our-planet/
1•ssernikk•36m ago•0 comments

Rust for C# and .NET developers guide by Microsoft

https://microsoft.github.io/rust-for-dotnet-devs/latest/
2•AbuAssar•38m ago•0 comments

New Futex Syscalls for Helping Valve's ARM64 Gaming Ambitions

https://www.phoronix.com/news/FUTEX-Robust-List2-Syscalls
1•renehsz•40m ago•0 comments

GLiNER2.5-Decide and Jev: a decision model you run, and one you call

https://soniqo.audio/blog/gliner-decide-vs-jev
2•aufklarer•44m ago•0 comments

I Taught the Iliad to Chinese Teenagers (2021)

https://scholars-stage.org/how-i-taught-the-iliad-to-chinese-teenagers/
1•Tomte•46m ago•0 comments

Retrieval Practice: The Most Powerful Learning Strategy You're Not Using (2017)

https://www.cultofpedagogy.com/retrieval-practice/
2•Tomte•47m ago•0 comments

Show HN: Gigantua – A Black Hole in your Browser

https://claude.ai/artifact/XmWGFtQPgn8aJvU193Ksf8
3•robotsmakelove•50m ago•1 comments

A Maintainer in Residence: Scott Schafer for the Cargo Team

https://blog.rust-lang.org/2026/09/22/announcing-a-maintainer-in-residence-scott-schafer-for-the-...
1•hnisjafx40•53m ago•0 comments

Show HN: I built an AR App that overlays makeup tutorials live on your face

https://urartist.app/
2•Vicmed13•54m ago•3 comments

Scoop: Top AI companies probing security incidents

https://www.axios.com/2026/09/26/openai-anthropic-thousands-ai-security-incidents
1•nsoonhui•55m ago•0 comments

Advice to a Beginning Software Engineer

https://www.seangoedecke.com/advice-to-a-beginning-software-engineer/
1•ingve•55m ago•0 comments

M-5 Did Not Go Insane

https://palhereford.substack.com/p/no-m-5-did-not-go-insane
1•p-hereford•57m 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•1y ago

Comments

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