Dense Linear Algebra, Graph Algorithms, Monte Carlo

Do you know these patterns, or are they new to you? If they are new,could you understand them? What questions did you have? What couldthe authors have done (more pictures, more examples, more definitions)to help you get it?

I know and have used most of the ideas presented, but I did not know them as patterns. Considering linear algebra, graph algorithm and Monte Carlo methosd as patterns seem strange to me. These are three huge areas of studies and there are generally complete course (e.g. graph theory) to study these problems. There are many different graph algorithms and the type of problems that can be modeled to them is huge. Maybe a pattern language for graph algorithm is more appropriate.

I have taken classes in linear algebra and algorithm where we discussed graph algorithms and Monte Carlos methods. So it was straightforward read for me. Overall I think they did a great job in describing the patterns. For the linear algebra pattern, the figures to illustrate the matrix multiplication and memory hierarchy are helpful in understanding various approaches when starting from scratch. Graph algorithm and Monte Carlo methods include enough details to understand.

How are computational patterns different from structural patterns? Is there a clear distinction, or a fuzzy one?

The only thing that I can see is that structural patterns define the structure(the steps) to use to solve a problem (e.g. a software design problem) and computational patterns actually solve the computational problems.