frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Art: Keep using Arc after shutdown

https://arcreborn.cool.computer/
1•warthog•1m ago•1 comments

Behringer Kick (Be 0700-AAM)

https://github.com/MusicTribeOpenSource/0700-AAM
1•bbg2401•2m ago•0 comments

Polars 2.1

https://pola.rs/posts/polars-2-1-changelog/
1•pauke•4m ago•0 comments

LiteLLM Private Registry

https://docs.litellm.ai/blog/litellm-private-registry
1•yujonglee•5m ago•0 comments

A case against AI – Chet Faliszek [video]

https://www.youtube.com/watch?v=g9koXZ5JhDU
1•SLHamlet•7m ago•0 comments

Vaccines for Cancer

https://jamanetwork.com/journals/jama/fullarticle/2854262?guestAccessKey=a0997df4-192d-410d-8c20-...
2•brandonb•11m ago•0 comments

The Fictional Famicube Project by Niklas Jansson

https://androidarts.com/palette/Famicube.htm
1•slowhadoken•16m ago•0 comments

Small Talk Is King

https://www.taylorforeman.com/p/small-talk-is-king
1•amrrs•21m ago•0 comments

Slughorn – GPU Vector Graphics

https://slughorn.io/
1•ibobev•22m ago•0 comments

StewMind 1.7B – An open-source 1.7B agentic model

https://huggingface.co/Erog0291/stewmind-1.7b
2•Erogian•22m ago•0 comments

Fixing KIO copy to USB stick and network filesystems

https://blogs.kde.org/2026/10/27/fixing-kio-copy-to-usb-stick-and-network-filesystems/
1•ibobev•24m ago•0 comments

OpenCode-Muse: Use Meta AI's Muse Code Subscription in OpenCode

https://github.com/pgquiles/opencode-muse
2•pgquiles•26m ago•0 comments

CrossUO: A new Ultima Online client for the Web

https://crossuo.com/
1•fungos•27m ago•0 comments

Faaast

https://faaastapp.com/
2•tnsrig•27m ago•3 comments

A History of Optimism

https://historyofoptimism.com/
1•joanwestenberg•30m ago•0 comments

Show HN: A 4-minute film that runs live in the browser – pause it and walk in

https://wishkino.com/
1•Jashwanth_13•31m ago•0 comments

Microsoft's buyout offer to employees shows which tech jobs matter

https://www.semafor.com/article/10/27/2026/microsofts-buyout-offer-to-employees-shows-which-tech-...
3•toomuchtodo•31m ago•0 comments

Delaware plan would let AI agents run businesses

https://arstechnica.com/tech-policy/2026/10/no-human-at-the-helm-delaware-plan-would-let-ai-agent...
1•unsnap_biceps•33m ago•0 comments

Patent Strategy in the Age of AI – Dan Gelbart [video]

https://www.youtube.com/watch?v=v5d8nwgiSYI
1•mhb•33m ago•0 comments

Parsing Algorithms (2020)

https://dmitrysoshnikov.com/courses/parsing-algorithms/
2•bjornroberg•34m ago•1 comments

An illustrated online book on Hewlett-Packard equipment

https://blog.adafruit.com/2026/10/27/an-illustrated-online-book-on-hewlett-packard-equipment/
1•sohkamyung•35m ago•1 comments

The Curse of the Short Stint Resume

https://anthonymorris.dev/words/curse-of-the-short-stint-resume
1•mooreds•37m ago•0 comments

EDKII CVE enables UEFI Secure Boot bypass in almost every use case of PXE Boot

https://nvd.nist.gov/vuln/detail/cve-2026-97631
3•OgsyedIE•39m ago•1 comments

Qwen has alter egos triggered by flipping a single neuron

https://qwen-neurons-site.vercel.app/
3•thoughtpeddler•39m ago•1 comments

I've used WordPress for 20 years, and I've stopped recommending it

https://hatamoto.dev/post/wordpress-20-years-why-we-built-hatamoto
3•zenincognito•42m ago•3 comments

What to Do with Your Five-Year Window

https://medium.com/westenberg/what-to-do-with-your-five-year-window-7a35373cc793
1•joanwestenberg•43m ago•0 comments

Black and White: Inside the creature's mind, part 1 how it feels

https://blog.zanidrak.com
1•gavxn•44m ago•0 comments

Why Programming Is Especially Exposed to AI Automation

https://asawicki.info/news_1805_6_reasons_why_programming_is_especially_exposed_to_ai_automation
2•ibobev•44m ago•0 comments

Show HN: Chorgi – a strength coach that updates your Garmin workouts every week

https://chorgi.me/
1•milos-mandic•45m ago•0 comments

OpenSandbox

https://aaif.io/projects/opensandbox
2•wicket•47m 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.