Info wanted on parallel matrix factorization updating

Article View: sci.math.num-analysis

Article #616

Back to sci.math.num-analysis Previous Next

#616

From: Mark Carson
Date: Sat, 10 Oct 1992 19:36

15 lines
1122 bytes

I'm interested in any information or references anyone can provide
in the area of updating matrix factorizations on parallel machines.
The idea is given an existing factorization (such as LU or QR) for
a matrix A, to devise efficient parallel means of updating the
factorization after some small change in A, such as modifying,
adding or deleting a row or column.

Again, thanks for any information you can provide.

Mark Carson (carson@cs.umd.edu)
-- 
Mark Carson	carson@cs.umd.edu	301-240-7348
Department of Computer Science   University of Maryland, College Park -or-
IBM 182/3F42   800 N. Frederick Ave.   Gaithersburg MD 20879

Technical Details

Message-ID: <1992Oct12.122540.20143@hubcap.clemson.edu>

Path: arc1-ca.pugleaf.net!sparky!uunet!gatech!hubcap!fpst

Show Full Headers

Complete Article Headers

Newsgroups: sci.math.num-analysis,comp.parallel
Path: arc1-ca.pugleaf.net!sparky!uunet!gatech!hubcap!fpst
From: carson@cs.umd.edu (Mark Carson)
Subject: Info wanted on parallel matrix factorization updating
Message-ID: <1992Oct12.122540.20143@hubcap.clemson.edu>
Followup-To: sci.math.num-analysis
Sender: news@MIMSY.CS.UMD.EDU
Organization: U of Maryland, Dept. of Computer Science, Coll. Pk., MD 20742
Date: 10 Oct 92 19:36:05 GMT
Approved: parallel@hubcap.clemson.edu
Lines: 16