HELP: large sparse special-form eqn. solver needed

Thread View: sci.math.num-analysis

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by ayoung Fri, 07 Aug 1992 12:43

#218

Author: ayoung
Date: Fri, 07 Aug 1992 12:43

22 lines
1460 bytes

  I'm trying to convert a mainframe program to run on a PC, and need to find
a way to solve a large sparse system of linear equations in limited space.
The format of the system is "Ax=y" where A is a square matrix, and y is a
known column vector, x is unknown.  The matrix A has the format

	(  I  P  )
	(  Q  0  )

 where I is the identity, 0 is a zero matrix, and P,Q are both sparse (they
will usually have less than 10 non-zero entries in any row).  I and 0 are
square matrices of comparable size (generally dim(I) > dim(0) ).

  My problem arises in that the dimension of the system can be as high as
2000 - which makes a full representation impractical on a PC. Given the
special format, does anyone know a useful algorithm (or better yet, have
some working C code) I can use?
-------------------------------------------------------------------------------
    /   \   /                 |    /      Alan Young @ uk.ac.ox.vax
   /____/  /  ___    __       |___/
  /    /  /  /   |  /  |         /           "The bigger they are,
 /     \_/\__\__/|_/  /_________/               the harder they fall on you."

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads