Serna, Sebastian PenaSilva, JoãoStork, AndreMarcos, Adérito FernandesCoelho, António and Cláudio, Ana Paula2021-06-182021-06-182021978-3-03868-154-0https://doi.org/10.2312/pt.20091221https://diglib.eg.org:443/handle/10.2312/pt20091221Several mesh-based techniques in computer graphics such as shape deformation, mesh editing, animation and simulation, build and solve linear systems. The most common method to build a linear system consists in traversing the topology (connectivity) of the mesh, producing in general a representation of the set of equations in form of a sparse matrix. Similarly, the solution of the system is achieved, by means of iterating over the set of equations in the default sequence of the vertices (unknowns). This paper presents a new algorithm, which optimizes the build of the linear system and its storage, and which allows the iteration over the set of equations in any arbitrary order. Additionally, our algorithm enables rapid modifications to the linear system, avoiding a complete rebuild.Effective memory handlingrapid simulationsolver accelerationdynamic linear systemsmeshbased applications10.2312/pt.20091221143-148