Here you can ask questions and find or give answers to organizational, academic and other questions about studying computer science.

915 questions

1k answers


441 users

+2 votes
Dear SC team,

I think I found an error in the slides - on slide 2-53 it says that we should maximize U. But at that point U is defined as the Identity matrix, so that this won't have much of an effect. I presume this was intended to be A?

Best Regards,

Kevin Iselborn

PS: I presume we are supposed to write in English right?
in * TF "Vis. and Sci. Comp." by (170 points)
edited by

1 Answer

+4 votes
This is indeed a typo – thanks for pointing it out. The idea is of course to find the maximum pivot element below the diagonal in the k-th column of $A$. So you are exactly right with your presumption.

(It may be mildly interesting why this typo happened: an earlier version of the slide detailed a variant of the algorithm that sets $U=A$ initially and then works only on $U$. This allows for a more compact formulation, that is however harder to understand. So for didactic reasons, I changed it to the less compact version and missed this line in the process.)

PS: Let's keep with the entire site and stick to English.
by (280 points)

Related questions

+1 vote
1 answer
asked Nov 16, 2019 in * TF "Vis. and Sci. Comp." by Arne (180 points)
0 votes
1 answer
asked May 16, 2022 in * TF "Emb. Sys. and Rob." by zain (220 points)
0 votes
1 answer
Imprint | Privacy Policy