FEAP User Forum

FEAP => Parallel FEAP => Topic started by: wklausler on August 06, 2020, 07:23:02 AM

Title: Node Graph Generation
Post by: wklausler on August 06, 2020, 07:23:02 AM

Dear parFEAP users and developers

I have been working on integrating a linear constraint package for serial FEAP into parallel FEAP (version 8.4). This has required a rewrite of the procedures that determine the inverse connectivity array (IXINV) and the node graph (NODG), located in pmacr7.F. In doing so, I have improved upon the existing code by eliminating the guess and check aspect of memory allocation of the subroutine make_node_graph. One sweep calculates the memory requirement, and a second one creates the node graph.

Attached are 1) a test environment with a small example and 2) my implementation in pmacr7.F (these include my expansion for linear constraints).

Best regards,
wklausler

Title: Re: Node Graph Generation
Post by: Prof. S. Govindjee on August 07, 2020, 10:38:41 PM

Thanks.  That part of the partition routine was written 15 years ago.  I will have a look at what you did and see if we can merge it with the current state of the partitioning code.