Combinatorial Optimization of Matrix-Vector Multiplication for Finite Element Assembly
Wolf, Michael M.; Heath, Michael T.
Loading…
Permalink
https://hdl.handle.net/2142/10836
Description
Title
Combinatorial Optimization of Matrix-Vector Multiplication for Finite Element Assembly
Author(s)
Wolf, Michael M.
Heath, Michael T.
Issue Date
2009-02
Keyword(s)
Computer Science
Abstract
It has been shown that combinatorial optimization of matrix-vector multiplication can lead to faster evaluation of finite element stiffness matrices. Based on a graph model characterizing relationships between rows, an efficient set of operations can be generated to perform matrix-vector multiplication for this problem. We improve the graph model by extending the set of binary row relationships and solve this combinatorial optimization problem optimally for the binary row relationships implemented, yielding significantly improved results over previous published graph models. We also extend the representation by using hypergraphs to model more complicated row relationships, expressing a three-row relationship with a three-vertex hyperedge, for example. Our initial greedy algorithm for this hypergraph model has yielded significantly better results than the graph model for many matrices.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.