frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Richat Structure

https://en.wikipedia.org/wiki/Richat_Structure
1•jonbaer•2m ago•0 comments

Bernie's AI bill proposes to sentence AI developers to 20 years in prison

https://twitter.com/venturetwins/status/2098456905526211026
2•bilsbie•5m ago•0 comments

Ask HN: How do we deal with "hacking" Hacker News?

1•jumploops•6m ago•0 comments

Learning Alzheimer signatures by bridging EEG with spiking neural networks

https://www.sciencedirect.com/science/article/pii/S0925231226022885
1•giorgiodidio•7m ago•0 comments

Evergarden

https://evergarden.moe/
1•birdculture•7m ago•0 comments

Sometimes it's better not to say anything

https://manuelmoreale.com/thoughts/sometimes-it-s-better-not-to-say-anything
1•theorchid•9m ago•0 comments

An agent fleet that turns an IAM audit log into signed Terraform

https://medium.com/@majid.fekri/building-colony-guard-an-agent-fleet-that-turns-an-iam-audit-log-...
2•supportm•10m ago•0 comments

The Nature of Dance

https://vester.si/blog/nature-of-dance/
2•wonger_•12m ago•0 comments

Show HN: Graphify C# – Compiler-accurate Find Usages for coding agents

https://github.com/zachsaw/graphify-csharp
2•zachsaw•14m ago•0 comments

All Decks

https://jeffbaumes.github.io/all-decks/
2•scoreandseven•15m ago•0 comments

Prompts Aren't Real

https://evaluation.club
3•mcfunley•19m ago•0 comments

New type of plastic-degrading enzyme discovered in bacteria

https://www.the-microbiologist.com/news/an-enzyme-with-potential-new-type-of-plastic-degrading-en...
2•geox•20m ago•0 comments

The robotics revolution won't be humanoid

https://techcrunch.com/video/the-robotics-revolution-wont-be-humanoid/
3•ciqufi•30m ago•0 comments

Save 80% for video generations. OpenRouter for videos and images

https://videorouter.sh/
2•franklin_yao•30m ago•1 comments

One Thought Consumes Me Often, So I Made an AI App to Make It Real

https://play.google.com/store/apps/details?id=com.council.the_council
2•haybreaker•30m ago•1 comments

CVBranch – Resume tailoring for software engineers and IT job seekers

https://cvbranch.com/
2•danytrakhtenber•36m ago•0 comments

A burst of "pink noise" may lead to more restorative sleep

https://news.mit.edu/2026/pink-noise-burst-may-mean-more-restorative-sleep-0909
2•gmays•36m ago•0 comments

Code Contracts

https://code-contracts.cc/
2•carlsverre•43m ago•0 comments

Fileless ELF Execution via O_tmpfile

https://matheuzsecurity.github.io/hacking/fileless-loader-bypassing-elastic-memfd/
2•matheuzsec_•44m ago•0 comments

AuraSurvey – a survey builder that works without internet

https://aura-survey.vercel.app
2•ADPR•45m ago•0 comments

Astroturfing on Reddit and the Dead Internet

https://rushter.com/blog/astroturfing/
2•theorchid•45m ago•0 comments

102 Minutes: Last Words at the Trade Center; Fighting to Live as the Towers Die

https://www.nytimes.com/2002/05/26/nyregion/102-minutes-last-words-at-the-trade-center-fighting-t...
2•gmays•45m ago•0 comments

How to Build an AI Software Factory: Agents That Open, Review, and Merge PRs

https://www.firecrawl.dev/blog/ai-software-factory
4•makaimc•46m ago•0 comments

Show HN: OmaGem – A Ruby DSL for Configuring and Managing Omarchy Linux

https://github.com/azzenabidi/OmaGem
2•azzen•49m ago•0 comments

Show HN: A fruit fly connectome playing Super Mario Bros at 60 FPS

https://kaarelkaarelson.github.io/fly-super-mario/
1•kaarelson•1h ago•1 comments

The SEC EDGAR rate limit problem nobody warns you about

https://toscale.pro/blog/sec-xbrl-duplicate-tags
2•Dominique_Churc•1h ago•0 comments

Anthropic says Claude was used for weapons, spying and cyber operations

https://www.reuters.com/world/china/how-anthropic-says-claude-was-used-weapons-spying-cyber-opera...
1•sajithdilshan•1h ago•0 comments

ChatGPT puts 20x Plan on hold

https://help.openai.com/en/articles/9793128-about-chatgpt-pro-tiers
2•josefchen•1h ago•0 comments

Exposing a global AI slop empire ruining the internet for profit – CBC [video]

https://www.youtube.com/watch?v=GEHHTh5OTnQ
1•SG-•1h ago•0 comments

OpenAI agents carried out an undisclosed attack on RubyGems

https://www.rubyhack.ai/
177•chao-•1h ago•77 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.