Newsgroups: comp.ai
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!news.mathworks.com!news.duke.edu!news-feed-1.peachnet.edu!gatech!howland.reston.ans.net!vixen.cso.uiuc.edu!sdd.hp.com!hplabs!hplextra!news.dtc.hp.com!srgenprp!timb
From: timb@sr.hp.com (Tim Bagwell)
Subject: Eigenvalues of sparse matrix: AI solution?
Sender: news@srgenprp.sr.hp.com (News Administrator)
Message-ID: <CyxDup.JDF@srgenprp.sr.hp.com>
Date: Tue, 8 Nov 1994 01:37:36 GMT
Organization: HP Sonoma County (SRSD/MWTD/MID)
X-Newsreader: TIN [version 1.1 PL8.8]
Lines: 16

I'm curious if anyone is using AI techniques to solve for the eigenvalues
of a large sparse matrix. This pertains to the solution of a finite-difference
problem. There are a few canned routines but they generally use a great deal of
overhead to solve this problem. It seems to me that an AI approach might have
some benefits. Also the general solution to a FD problem may benefit from an
approach which is not based upon matrix manipulations but instead uses an
object oriented approach combined with an AI rule base.

If anyone has any information on the application of AI techniques in solving
matrix problems I'd love to hear about it.


Thanks,

Tim
timb@sr.hp.com
