-
Voting:
-
0
+
A rank-one matrix...is rank one.
— Charlie Van Loan,
colloquium talk
·
Jan. 28, 2016
·
Permalink
-
Voting:
-
0
+
You won't find this in any book...
— Charlie Van Loan,
CS421: Preface to the Doctrine of Least Change
·
Oct. 29, 2003
·
Permalink
-
Voting:
-
0
+
There are n - 2 steps. Proof: let n = 5 and look at the blackboard.
— Charlie Van Loan,
Presenting Householder reductions to tri-diagonal form in CS421.
·
Oct. 10, 2003
·
Permalink
-
Voting:
-
1
+
QED: proof by the English language and intimidation.
— Charlie Van Loan,
CS421: "Proving" that the roots of the characteristic polynomials Pk and Pk-1 are distinct.
·
Oct. 10, 2003
·
Permalink
-
Voting:
-
0
+
We're almost ready to look at what Jacobi did back there in 1846 . . . just before I was born.
— Charlie Van Loan,
While presenting Jacobi's algorithm for computing Schur Decomposition.
·
Oct. 6, 2003
·
Permalink
-
Voting:
-
0
+
There you have it: a lot of coool properties about the trace.
— Charlie Van Loan,
Regarding the trace of a square matrix.
·
Oct. 3, 2003
·
Permalink
-
Voting:
-
0
+
It reminds you of an Aesop's fable:
"We ask, 'Who is the biggest?'
'I am,' says column 3."
— Charlie Van Loan,
On QR factorization with column pivoting.
·
Sept. 29, 2003
·
Permalink
-
Voting:
-
0
+
The professor is a jerk.
— Charlie Van Loan,
After borrowing a student's homework description, and pretending to read from the paper.
·
Sept. 24, 2003
·
Permalink
-
Voting:
-
0
+
You can actually label this vector and this vector meaningfully; I won't do that.
— Charlie Van Loan,
While demonstrating how Householder vectors work, in a geometric sense.
·
Sept. 24, 2003
·
Permalink
-
Voting:
-
0
+
I can spend five minutes proving this but I don't want to, so I'll just tell you the result.
— Charlie Van Loan,
Explaining pivoting in LU factorization.
·
Sept. 12, 2003
·
Permalink