From: Rune Allnor <>
Newsgroups: comp.soft-sys.matlab
Subject: Re: Fast Matrix*Diagonal*Matrix operation
Date: Mon, 31 Jan 2011 20:39:39 -0800 (PST)
Lines: 22
Message-ID: <>
References: <ii7d79$lto$>
Mime-Version: 1.0
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: quoted-printable
X-Trace: 1296535179 18935 (1 Feb 2011 04:39:39 GMT)
NNTP-Posting-Date: Tue, 1 Feb 2011 04:39:39 +0000 (UTC)
Injection-Info:; posting-host=; posting-account=VAp5gAkAAAAmkCze5hvZtMeedpZWNthI
User-Agent: G2/1.0
X-HTTP-UserAgent: Mozilla/4.0 (compatible; MSIE 7.0; Windows NT 5.1; .NET CLR
 2.0.50727; InfoPath.2; MS-RTC LM 8),gzip(gfe)
Xref: comp.soft-sys.matlab:707331

On Jan 31, 11:31 pm, "Gongguo Tang" <> wrote:
> Hi there,
> I have a code that computes Q'*D(t)*Q many times. Here Q is a fixed mxn matrix with m < n, while the diagonal matrix D depends on the iteration t.
> Because I have so many iterations that the operation slows done the entire process.
> I am wondering if there is any way to obtain Q'*D(t)*Q as fast as possible. Maybe from the result of Q'*Q or some kind of decomposition of Q'*Q?

Sounds like you might want to have a look at
how the Householder transform helps speed up
the computation of eigenvalues of symmetric

Check out the appropriate chapters of

Golub & van Loan: "Matrix Computations" (1996)