finding the sparsity pattern of a matrix

I've a matrix created via symbolic multiplication

I'm sharing an example of the resulting matrix below (which is the RHS of ode dy/dt = F)

F =
[ f1*(k + c), f2, 0]
[ f1, f2, f3]
[ 0, f2, f3*(k)]
[ f1, 0, f3]

Differentiating F gives the jacobian.

In my real system, F is a banded matrix. I want to find sparsity pattern of the matrix(like the following) and supply for `JPattern` in `odeset`.

non_zero_F =
[1, 1, 0]
[1, 1, 1]
[0, 1, 1]
[1, 0, 1]

[Drishan Poovaya]

From my understanting, sparsity pattern of a matrix is a graphical representation which you can get using spy(s). Could you give more information on how you want to use this sparsity pattern?