Path: news.mathworks.com!not-for-mail
From: "yunzhi cheng" <sjtu_yh@yahoo.com>
Newsgroups: comp.soft-sys.matlab
Subject: Re: Is a QR Decomposition Better than B \ A?
Date: Fri, 13 Jul 2007 22:05:22 +0000 (UTC)
Organization: The MathWorks, Inc.
Lines: 5
Message-ID: <f78sv2$c8g$1@fred.mathworks.com>
References: <m3zm21orrv.fsf@ieee.org> <ef5d562.0@webcrossing.raydaftYaTP> <jSLli.28664$3j1.18776@newsfe6-gui.ntli.net>
Reply-To: "yunzhi cheng" <sjtu_yh@yahoo.com>
NNTP-Posting-Host: webapp-01-blr.mathworks.com
Content-Type: text/plain; charset="ISO-8859-1"
Content-Transfer-Encoding: 8bit
X-Trace: fred.mathworks.com 1184364322 12560 172.30.248.36 (13 Jul 2007 22:05:22 GMT)
X-Complaints-To: news@mathworks.com
NNTP-Posting-Date: Fri, 13 Jul 2007 22:05:22 +0000 (UTC)
X-Newsreader: MATLAB Central Newsreader ¶9A%˜½ç7
Xref: news.mathworks.com comp.soft-sys.matlab:419009



If we have the equation Ax=b.
A is sparse.
The number of x is smaller than the number of equation.
Is x=A\b the best and quickest way to solve x ?