Method of Elimination
In this chapter, we discuss the method of elimination as outlined in Algorithm 1.3. We have already used elimination at several places in the book. A simple dependence problem, by definition, is one where elimination is trivial. For a simple problem, the method of elimination lets us find integer solutions almost as easily as real solutions. The prime example of that was seen in Chapter 2 for dependence problems involving one-dimensional arrays in single loops. Our focus here is on problems where that is not the case. We have already seen dependence problems where elimination is nontrivial, for instance, in the example of Chapter 1 and in Example 3.4.
KeywordsReal Solution Integer Solution Dependence Problem Dependence Equation Dependence Constraint
Unable to display preview. Download preview PDF.