In [[probability theory]], the '''matrix geometric solution method''' is a method for the analysis of [[quasi-birth–death process]]es, [[continuous-time Markov chain]] whose [[transition rate matrices]] with a repetitive block structure.<ref>{{cite book|first=Peter G.|last=Harrison|authorlink=Peter G. Harrison|first2=Naresh M.|last2=Patel|title=Performance Modelling of Communication Networks and Computer Architectures|publisher=Addison-Wesley|year=1992|pages=317-322|isbn=0-201-54419-9}}</ref> The method was developed "largely by Marcel F. Neuts and his students starting around 1975."<ref>{{cite doi|10.1007/0-387-21525-5_8}}</ref>
