Linked Lists for Transport Simulations Using Lagrangian Parcels

Abstract

The linked-list method is explained using transport simulations involving Lagrangian discrete parcels. Parcel insertion and removal as well as storing of variables in a multispecies problem are explained through examples. The advantages of the linked-list method over the sequential-list method are discussed. Both single-species and multispecies applications are addressed. It is shown that for maintaining parcel lists, insertions, and removals, use of the linked-list approach optimizes the use of memory and is significantly more efficient than using sequential lists.