DomainKey-Signature: a=rsa-sha1; c=nofws; d=sourceware.org; h=list-id
	:list-unsubscribe:list-subscribe:list-archive:list-post
	:list-help:sender:to:from:subject:message-id:date:mime-version
	:content-type:content-transfer-encoding; q=dns; s=default; b=M6L
	sMAZgzP+foSjeh4Hcb9mYzSWa7pccVW0izuZ5Xy1tX6Z/Yo3/IOwMs408XPr3+ra
	NT5DiRQlNlpsHkkntP7wq+myZJfUEFk8syd+XAn2TU1M2vpMeM3qs9ESNJCVHZ7f
	xRWwfmltjhuyJBc/oYvy7QX4ghM1hgPAuoY449e0=
Mailing-List: contact cygwin-help@cygwin.com; run by ezmlm
Sender: cygwin-owner@cygwin.com
Mail-Followup-To: cygwin@cygwin.com
To: "cygwin@cygwin.com" <cygwin@cygwin.com>
From: Thomas Koenig <tkoenig@netcologne.de>
Subject: Parallelization
Message-ID: <db3a62ee-a3d2-82df-0eb1-140f442d9f79@netcologne.de>
Date: Sun, 17 Jul 2016 11:02:27 +0200
User-Agent: Mozilla/5.0 (X11; Linux x86_64; rv:45.0) Gecko/20100101 Thunderbird/45.2
MIME-Version: 1.0
Content-Type: text/plain; charset=utf-8; format=flowed
Content-Transfer-Encoding: 7bit

I am working on a non-linear, boring system of ODEs, boring being
defined as non-stiff and without other numerical surprises.
So, CV_ADAMS works well.

The only interesting part is that there are very many of the ODEs,
around 30000 at the moment, and that each ODE depends on around half of
the others, so a Jacobian (were I to calculate it) would be quite
densely packed.

Sundials works well for this problem, but it takes rather a lnog time
and only utilizes a single processor on a 20-core machine.

So, the question: Is there a way to parallelize the calculation for
this? The references in the Sundials docs that I have seen only refer
to parallelization of solving linear equations, which I do not need
to do.

Regards

	Thomas

--
Problem reports:       http://cygwin.com/problems.html
FAQ:                   http://cygwin.com/faq/
Documentation:         http://cygwin.com/docs.html
Unsubscribe info:      http://cygwin.com/ml/#unsubscribe-simple