# Diagonal mass matrix¶

## ‘Theory’¶

Note

Should you still want to use the full (sparse) matrix in conjunction with a solver, please consider using the Intel compile with the Intel MKL library (which includes the Pardiso solver). Consider this example.

Because dynamic computations need so many increments, it may be worth to cut down the computational cost of a simulation. The best way to start cutting is on the solver, which is often the most costly of the entire Finite Element Program. Remember that

If we make the mass matrix diagonal, can be obtained without solving a system. Instead we merely needed the component wise inverse of the diagonal terms (which are the only remaining non-zero terms).

There are essentially four possible definitions of the mass matrix:

The

*consistent*(or*complete*) mass matrix. Here the quadrature of the mass matrix is identical to that of the internal force in the system. It is the result of numerical integration ofThe

*lumped*mass matrix. In whichThe

*lumped*mass matrix with*diagonal scaling*:where the constant is set such that:

A trick to accomplish this is to set

where the denominator is the trace of .

Evaluating of using a quadrature rule involving only the nodal points and thus automatically yielding a diagonal matrix. It relies on the fact that when the quadrature-points coincide with the nodes, a local support is obtained (since the shape functions are zero in all the other nodes). The integration point volume is that part of the element’s volume that can be associated to that node.

For 2-D linear triangles, which have three nodes and normally one Gauss point in the middle of the element, the number of integration points is increased to three (whose positions correspond to that of the nodes), and their weight is set to 1/3 of the normal weight. Interestingly, for this case all possible definitions of the diagonalized mass matrix are the same.

For 2-D quads only the position of the integration points changes to that of the nodes.