# Patent

## Title
Apparatus, method and system for improved reservoir simulation using a multiplicative overlapping Schwarz preconditioning for adaptive implicit linear systems

## Abstract

A method, system and apparatus are disclosed for conducting a reservoir simulation, using a reservoir model of a gridded region of interest. The grid of the region of interest includes one or more types of cells, the type of cell being distinguished by the number of unknown variables representing properties of the cells. The cells share a common variable as an unknown variable. The method includes the steps of identifying different cell types for the grid; constructing an overall matrix for the reservoir model based on the different cell types; at least partially decoupling the common variable from the other unknown variables in the matrix by using a reduction process to yield a reduced matrix; mathematically breaking up the variables in the reduced matrix into k subsets by cell types; applying an overlapping multiplicative Schwartz procedure to the reduced matrix to obtain a preconditioner and using the preconditioner to solve for the unknown variables.

## Background
CROSS REFERENCE TO RELATED APPLICATION
This is a Utility Application of prior pending Provisional Application Ser. No. 60/674,936, filed on Apr. 26, 2005, entitled “Apparatus, Method and System for Improved Reservoir Simulation Using a Multiplicative Overlapping Schwarz Preconditioning for Adaptive Implicit Linear Systems.”


BACKGROUND OF THE INVENTION
1. Field of the Invention
This invention relates to apparatuses, methods and systems for use in reservoir simulation. In particular, the invention provides methods, apparatuses and systems for more effectively and efficiently simulating fluid flow in reservoirs using an overlapping multiplicative Schwarz method of preconditioning adaptive implicit linear systems.
2. Background
Reservoir simulation often requires the numerical solution of the equations that describe the physics governing the complex behaviors of multi-component, multiphase fluid flow in natural porous media in the reservoir and other types of fluid flow elsewhere in the production system. The governing equations typically used to describe the fluid flow are based on the assumption of thermodynamic equilibrium and the principles of conservation of mass, momentum and energy, as described in Aziz, K. and Settari, A., Petroleum Reservoir Simulation, Elsevier Applied Science Publishers, London, 1979. The complexity of the physics that govern reservoir fluid flow leads to systems of coupled nonlinear partial differential equations that are not amenable to conventional analytical methods. As a result, numerical solution techniques are necessary.
A variety of mathematical models, formulations, discretization methods, and solution strategies have been developed and are associated with a grid imposed upon an area of interest in a reservoir. Detailed discussions of the problems of reservoir simulation and the equations dealing with such problems can be found, for example, in a PCT published patent application to ExxonMobil, International Publication No. WO 01/40937, incorporated herein by reference and in U.S. Pat. No. 6,662,146 B1 (the '146 patent”), incorporated herein by reference. Reservoir simulation can be used to predict production rates from reservoirs and can be used to determine appropriate improvements, such as facility changes or drilling additional wells, that can be implemented to improve production.
A grid imposed upon an area of interest in a model of a reservoir may be structured or unstructured. Such grids are comprised of cells, each cell having one or more unknown properties, but with all the cells in the grid having one common unknown variable, generally pressure. Other unknown properties may include, but are not limited to, fluid properties such as water saturation or temperature for example, or to “rock properties,” such as permeability or porosity to name a few. A cell treated as if it has only a single unknown variable (typically pressure) is called herein a “single variable cell,” or an “IMPES cell” while a cell with more than one unknown is called herein a “multi-variable cell” or an “implicit cell.”
The most popular approaches for solving the discrete form of the nonlinear equations are the FIM (fully implicit method) and IMPES (Implicit Pressure, Explicit Saturations) systems, as described by Peaceman, D., Fundamentals of Reservoir Simulation, published by Elsevier London, 1977, and Aziz, K. and Settari, A.: Petroleum Reservoir Simulation, Elsevier Applied Science Publishers, London, 1979. There are a wide variety of specific FIM and IMPES formulations, as described by Coats, K. H.: “A Note on IMPES and Some IMPES-Based Simulation Models”, SPEJ (5) No. 3, (September 2000), at 245, incorporated herein by reference.
The fully implicit method (FIM) assumes that all the variables and the coefficients that depend on these variables are treated implicitly. In a FIM system, all cells have a fixed number of unknowns, greater than one unknown, represented herein by the letter “m”. As a result, the FIM is unconditionally stable, so that one can theoretically take any time step size. At each time step, a coupled system of nonlinear algebraic equations, where there are multiple degrees of freedom (implicit variables) per cell, must be solved. The most common method to solve these nonlinear systems of equations is the Newton-Raphson scheme, which is an iterative method where the approximate solution to the nonlinear system is obtained by an iterative process of linearization, linear system solution and updating. The Newton-Raphson method provides that for f(x)=0, a solution can be found using an iteration:

xn+1=xn−(f(xn)/f′ (xn))   (Eq. 1)

And, given an appropriate starting point, for an equation x=g(x), the iteration xn+1=g(xn) will converge to a root “a”, if |g′(a)|\1t1.
FIM simulations are computationally demanding. A linear system of equations with multiple implicit variables per cell arise at each Newton-Raphson iteration. The efficiency of a reservoir simulator depends, to a large extent, on the ability to solve these linear systems of equations in a robust and computationally efficient manner.
In an IMPES method, only one variable, typically pressure, is treated implicitly. All other variables, including but not limited to saturations and compositions, are treated explicitly. Moreover, the flow terms (transmissibilities) and the capillary pressures are also treated explicitly. For each cell, the conservation equations are combined to yield a pressure equation. These equations form a linear system of coupled equations, which can be solved for the implicit variable, typically pressure. After the pressure is obtained, the saturations and capillary pressures are updated explicitly. Explicit treatment of saturation (and also of transmissibility and capillary pressure) leads to conditional stability. That is, the maximum allowable time step depends strongly on the characteristics of the problem, such as the maximum allowable throughput, and/or saturation change, for any cell. When the time step size is not too restrictive, the IMPES method is extremely useful. This is because the linear system of equations has one implicit variable, usually pressure, per cell. In most practical settings, however, the stability restrictions associated with the IMPES method lead to impractically small time steps.
The adaptive implicit method (AIM) was developed in order to combine the large time step size of FIM with the low computational cost of IMPES. See Thomas, G. W. and Thurnau, D. H, “Reservoir Simulation Using an Adaptive Implicit Method,” SPEJ (October, 1983), p 759 (“Thomas and Thurnau”), incorporated herein by reference. In an AIM system, the cells of the grid may have a variable number of unknowns. The AIM method is based on the observation that in most cases, for a particular time step only a small fraction of the total number of cells in the simulation model requires FIM treatment, and that the simpler IMPES treatment is adequate for the vast majority of cells. In an AIM system, the reservoir simulator adaptively and automatically selects the appropriate level of implicitness for a variable (e.g. pressure, saturation) on a cell by cell basis. (See Thomas & Thurnau.) Rigorous stability analysis can be used to balance the time step size with the target fraction of cells having the FIM treatment. See Coats, K. H. “IMPES Stability: Selection of Stable Timesteps”, SPEJ (June 2003), pp 181-187, incorporated herein by reference. The computer solution for AIM systems, however, can be difficult and inefficient because of the variable number of unknowns per cell. The '146 patent by Watts describes a recent attempt to address this problem. The '146 patent describes:

    
    
        “a method for performing reservoir simulation by solving a mixed implicit-IMPES matrix (MIIM) equation. The MIIM equation arises from a Newton iteration of a variable implicit reservoir model. The variable implicit reservoir model comprises a plurality of cells including both implicit cells and IMPES cells. The MIIM equation includes a scalar IMPES equation for each of the IMPES cells and a set of implicit equations for each of the implicit cells.”
    
    


(The 146 patent at Col. 8, lines 8-16.) The '146 patent presents “a method of solving an implicit linear equation,” having the form:

Ax=C,   (Eq. 2)

where A is a known matrix, C is a known vector and x is an unknown vector. (the '146 patent, col. 9, lines 62-66.)

The '146 patent discloses at least three ways of solving the mixed implicit-IMPES equation. The first is a “first linear solver method” which includes these steps:

    
    
        “1. Construct a global IMPES pressure matrix equation from the mixed implicit-IMPES matrix equation . . . .
        2. Compute the coefficients for the saturation equations (1.2.30) at the implicit cells.
        3. Solve the global IMPES pressure matrix equation for . . . a single intermediate pressure at each cell in the reservoir, and compute pressure changes based on the intermediate pressures . . . and pressures . . . prevailing at the beginning of the iteration;
        4. Update implicit equation residuals at the implicit cells based on the pressures changes [of step 3]. . . ;
        5. At the implicit cells, solve for improved saturations . . . in saturation equations . . . derived using a constraint of total velocity conservation between cells.
        6. Update implicit equation residuals at the implicit cells and at the fringe of IMPES cells that are in flow communication with the implicit cells based on the saturation solutions obtained in step 5.
        7. Determine if a convergence condition is satisfied.”
    
    


(The '146 Patent at col. 22, line 59 through col. 23, line 28.) See also FIG. 6A of the '146 Patent and related discussion therein. The practitioner repeats steps 2-6 until convergence. (The '146 Patent at col. 23 lines 26-28.)
The second method of the '146 patent uses the following steps:

    
    
        1. Construct a global IMPES pressure matrix equation from the mixed implicit-IMPES matrix equation . . . .
        2. Solve the global IMPES pressure matrix equation for intermediate pressures . . . i.e. a single intermediate pressure at each cell in the reservoir, and compute pressure changes . . . based on the intermediate pressures . . . and pressures . . . prevailing at the beginning of the iteration.
        3. Compute implicit equation residuals at the implicit cells based on the pressures changes . . . computed in step 2.
        4. At the implicit cells, solve for improved saturations . . . and second intermediate pressures . . . by performing one or more iterations with a selected preconditioner . . . .
        5. Update implicit equation residuals at the implicit cells and at the fringe of IMPES cells that are in flow communication with the implicit cells based on the improved saturations and second intermediate pressures obtained in step 4.
        6. Determine if a convergence condition is satisfied.
    
    


(The '146 Patent at col. 24, lines 19-52.) See also FIG. 6B of the '146 Patent and related discussion therein. The practitioner repeats steps 2-6 until convergence. (The '146 Patent at col. 24, lines 51-52.)
The third method of the '146 patent “effectively requires an unstructured implicit equation solver.” Steps 1-3 and 6 of the third method of the '146 patent are the same as in the second method. Steps 4 (“4.sup.II) and 5 (“5.sup.II”) of the third method are:

    
    
        4.sup.II. Solve for saturations S.subj.sup.n+2⁄3 and pressures P.subj.sup.n+2⁄3 at the implicit cells while holding fixed the pressures in the surrounding fringe (of IMPES cells) to the values . . . determined during the IMPES pressure solution. Any method can be used to generate the solutions for saturations . . . and pressures . . . , but it must be able to deal with the unstructured form of the implicit cell equations.
        5.sup.II. Update residuals in the fringe of IMPES cells. Since the implicit equations have been solved, their residuals will satisfy the convergence criteria.

(The '146 Patent at col. 25, lines 40-57.) See also FIG. 6C of the '146 Patent and related discussion therein.

    
    


However, the approaches to solving this problem available today have significant disadvantages. For example, it is well known that reservoir simulation matrices can best be approximately factored if they are ordered cell by cell. This means that all operations in the factorization and preconditioning step are performed as sub-matrix operations. These sub-matrices have relatively small dimensions. For FIM matrices with m unknowns per block, these sub-matrix blocks are all of order m×m. Thus for optimum efficiency the short length software loops for performing these m×m block operations may be unrolled, in order to significantly increase the overall speed of the matrix solution. By contrast with the m×m sub-matrix blocks of a FIM system, this unrolling approach for AIM systems cannot be efficiently implemented due to the varying dimensions of the sub-matrix blocks. The '146 patent does not appear to disclose an efficient unrolling technique for FIM or AIM systems.
In addition, methods without spatial overlapping can entail a slow convergence. Such methods require significant computing resources, which increases cost and lowers efficiency. The 146 patent does not appear to disclose spatial overlapping.
The present invention includes use of a global pressure matrix solution combined with efficient unrolling of loops, including spatial overlapping, in the approximate factorization of the multivariable sub-system, as a preconditioning for AIM systems.
SUMMARY OF THE INVENTION
In view of the above problems, an object of the present invention is to provide methods, apparatuses and systems for more effectively and efficiently simulating fluid flow in reservoirs while eliminating or minimizing the impact of the problems and limitations described.
Other objects, features and advantages of the present invention will become apparent to those of skill in art by reference to the figures, the description that follows and the claims.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1a illustrates a representation of a reservoir.
FIG. 1b illustrates an exploded view of a section in the reservoir depicted in FIG. 1a. 
FIG. 2 is a representation of a region of interest in a reservoir, gridded in accordance with a preferred embodiment of the present invention.
FIG. 3 depicts a simplified, two-dimensional view of a region of interest in a reservoir, gridded in accordance with a preferred embodiment of the present invention.
FIG. 4 is a flowchart of a preferred embodiment of the present invention.
FIG. 5 is a flowchart of a preferred embodiment of step 250 of FIG. 4, focusing on a Quasi-IMPES reduction.
FIG. 6 is a flowchart of an alternate preferred embodiment of step 250 of FIG. 4, focusing on True-IMPES reduction.
FIG. 7 is a representation of a region of interest in accordance with a preferred embodiment of the present invention.
FIG. 8 is a flowchart of a preferred embodiment of the present invention for the step of constructing the k subsets (step 260 of FIG. 4).
FIG. 9 is a depiction of a flowchart for a preferred embodiment of step 745 of FIG. 8.
FIG. 10 depicts the result of a restriction operator R1 selection using a preferred embodiment of the present invention and the region of interest example depicted in FIG. 7.
FIG. 11 depicts the result of a restriction operator Ri selection using a preferred embodiment of the present invention and the region of interest example depicted in FIG. 7, where i is equal to two.
FIG. 12 depicts the result of a restriction operator Ri selection using a preferred embodiment of the present invention and the example depicted in FIG. 7, where i is equal to three.
FIG. 13 is a depiction of a flowchart for a detailed version of a preferred embodiment of FIG. 8 step 770, which is the step of constructing the padded restrictor, {circumflex over (R)}i.
FIG. 14 is a depiction of the result of a padded restrictor, {circumflex over (R)}i, as applied to the example of FIG. 11, where i is equal to two.
FIG. 15 is a depiction of the result 654 of a padded restrictor, {circumflex over (R)}i, as applied to the example of FIG. 12, where i is equal to three.
FIG. 16 is a flowchart of a preferred embodiment of step 270 of FIG. 4, depicting use of an overlapping k-block multiplicative Schwarz algorithm to produce a preconditioner.



DETAILED DESCRIPTION OF THE DRAWINGS
In the following detailed description of the preferred embodiments and other embodiments of the invention, reference is made to the accompanying drawings. It is to be understood that those of skill in the art will readily see other embodiments and changes may be made without departing from the scope of the invention.
The following terms are defined below for clarification and are used to describe the drawings and embodiments of the invention:
“IMPES cell”: a cell having only a single unknown variable (typically pressure). Also called a “single variable cell.”
“Implicit cell”: a cell having more than one unknown variable. Also called a “multi-variable cell.”
“Multi-variable cell”: a cell having more than one unknown variable. Also called an “implicit cell.”
“Single variable cell”: a cell treated as if it has only a single unknown variable (typically pressure). Also called an “IMPES cell”
For convenience, the description has been divided up into sections. Section 1 includes a general description of preferred embodiments of the present invention. Section 2 is a description of constructing the k sub-collections in accordance with a preferred embodiment of the present invention. Section 3 discusses preconditioning in accordance with a preferred embodiment of the present invention. Section 4 discusses efficient unrolling of do-loops in accordance with a preferred embodiment of the present invention. Section 5 contains an error analysis discussion.
Section 1: General Description
FIG. 1a illustrates a representation of a reservoir 10, with a section 12, which is depicted in an exploded (two dimensional) view in FIG. 1b. Reservoirs 10 (below the water table) typically contain fluid 20, such as oil, gas, water or a mixture of two or three of those substances filling the pore spaces between the porous media 30 (such as, for example, sandstone or limestone) that makes up the rock of the reservoir.
FIG. 2 depicts a three-dimensional view of a gridding of a region of interest in a reservoir (not depicted in FIG. 2) in accordance with a preferred embodiment of the invention. (Of course, “gridding of a region of interest” means imposing a grid on a model of the region of interest, generally stored on computer readable media, not imposing a physical grid of some sort underground in the region of interest in the Earth itself.) The region of interest 50 is gridded into cells 60. Although a structured grid is depicted in FIG. 2, the gridding in accordance with the present invention may be structured or unstructured. Commercial software applications for gridding regions of interest, such as GOCAD, FLOGRID and PETREL, are readily available.
FIG. 3 depicts a simplified, two-dimensional view of a region of interest 105 in a reservoir gridded into cells, such as cell 106, in accordance with a preferred embodiment of the present invention. In the example of FIG. 3, different types of cells are illustrated as having different shadings. The cells each have one or more unknown properties, represented by variables. The different cell types are distinguished by the number of variables, representing the unknown properties that the different cells have. There may be implicit cells, having more than one unknown variable, and IMPES cells, which if present, have a single unknown variable. In the example depicted in FIG. 3, cells with no shading (“IMPES cells” 110) have one unknown property, represented by one variable, and cells with densely dotted shading (“type 2 cells” 120) have three unknowns properties, represented by three variables.
The one common unknown variable is typically pressure, but could be some other variable. Type 1 cells, if any, are the IMPES cells. Multivariable cell types are numbered sequentially herein, starting at two, based on their number of unknown variables, with type 2 cells having the lowest number of unknown variables greater than one, type 3 cells having the next highest number of unknown variables, and so on in increasing numbers of unknown variables. Although it is common to have one or more cells having only one unknown variable (IMPES cells), cells with only a single unknown variable are not required to be present in the grid in order to practice the present invention.
FIG. 4 is a flowchart of a preferred embodiment of the present invention. After starting 200, a region of interest in a reservoir is selected 210 for modeling. The region of interest is gridded 220, the grid being comprised of cells having unknown properties represented by variables, each cell having one common unknown variable. Typically, as listed in step 220 of FIG. 4, the common unknown variable is pressure. The grid may be structured or unstructured. Different types of cells present in the region of interest are identified 230 based on their number of unknown variables.
Continuing to refer to FIG. 4, a matrix is constructed 240 to represent the region of interest based on the different types of cells. For the example of FIG. 3, which has two types of cells in the region of interest 105, type 1 cells 110, having one unknown variable, and type 2 cells 120, having three unknown variables, the AIM matrix A would be written in block 3×3 form as follows:




  
    
      
        A
        =
        
          [
          
            
              
                
                  A
                  ss
                
              
              
                
                  A
                  sq
                
              
              
                
                  A
                  se
                
              
            
            
              
                
                  A
                  qs
                
              
              
                
                  A
                  qq
                
              
              
                
                  A
                  qe
                
              
            
            
              
                
                  A
                  es
                
              
              
                
                  A
                  eq
                
              
              
                
                  A
                  ee
                
              
            
          
          ]
        
      
    
    
      
        (
        
          Eq
          .
          
            
          
          ⁢
          3
        
        )
      
    
  




where s denotes non-pressure variables in the type 2 cells 120, q denotes pressures in type 2 cells 120 and e denotes pressures in type 1 cells 110. All variables are ordered cell by cell, according to the above matrix partitioning.

For a single variable cell-type, the matrix A requires one block row and one block column. But for each multivariable cell-type, the matrix A requires two additional block rows and two additional block columns. For the example of FIG. 3, which has two types of cells only one of which is a multivariable cell type, the matrix A requires, as depicted above, one block column and one block row for the single variable cell type (the type 1 cells 110) and requires two additional block rows and two additional block columns for the single multivariable cell type (the type 2 cells 120) for a total of three block columns and three block rows. And, for example, if one had three types of cells, one of which being a type 1 cell and the others being multivariable cell types, the matrix A would have five block rows and five block columns.
The following equation is used to solve for the unknown variables, called x:

Ax=b   (Eq. 4)

where x is a block vector of the variables representing unknown properties of the cells and b is a block vector of known quantities. This is the same equation as Eq. 2 herein (as given in the '146 patent), with the “C” of Eq. 2 replaced by the letter “b.” The form given in Eq. 4 was chosen because it is consistent with other writings and work of the instant inventors, but the two equations are identical. In Eq. 4, block vector x and block vector b are the same length. The length of block vector x and block vector b is same as the total number of cells in the region of interest. For the example depicted in FIG. 3, where the region of interest 105 is ten cells tall by eleven cells wide, the length of both vector x and vector b is one hundred and ten, which is the same as the total number of cells.

Referring again to FIG. 4, the next step to solving Eq. 4, is to at least partially decouple 250 pressure from the other variables in the matrix by using a reduction process to yield a reduced matrix. (In embodiments where something other than pressure is the common unknown variable, that variable (not pressure) would be at least partially decoupled from the other variables in this step.) There are many different known reduction processes that may be used to decouple pressure from the other variables in accordance with the present invention. Some reduction processes may be more appropriate in some situations than others might be. Two reduction processes that may be used are a Quasi-IMPES reduction and a True-IMPES reduction, both more fully discussed below. The True-IMPES reduction typically yields a more nearly symmetric pressure matrix than Quasi-IMPES. Quasi-IMPES works well if symmetry is not a major issue for the preconditioning method. But some preconditioning methods, such as an algebraic multi-grid (AMG) preconditioning method, are more effective for symmetric and nearly symmetric matrices than for non-symmetric matrices. Accordingly, a True-IMPES would be more appropriate, for example, if an AMG method is used to solve for pressure.
In reservoir simulation, using an IMPES reduction is a common practice for approximately decoupling pressure from the other variables. In Wallis, J. R., Kendall, R. P., and Little, T. E.: “Constrained Residual Acceleration of Conjugate Residual Methods”, SPE 13536, presented at the SPE Symposium on Reservoir Simulation, Houston, Tex., Feb. 10-13, 1985 (Wallis, et al 1985”), incorporated herein by reference, the authors use an algebraic procedure in a method called “CPR.” The CPR method as described in the cited paper is applied to linear systems associated with FIM. That algebraic procedure is called herein a “Quasi-IMPES reduction.”
FIG. 5 depicts a flowchart of a preferred embodiment of an aspect of the present invention implementing the Quasi-IMPES reduction. The Quasi-IMPES reduction is described by the following scaling matrix Q, where Q is set 252 so:




  
    
      
        Q
        =
        
          [
          
            
              
                I
              
              
                0
              
              
                0
              
            
            
              
                
                  Q
                  qs
                
              
              
                I
              
              
                0
              
            
            
              
                
                  Q
                  es
                
              
              
                0
              
              
                I
              
            
          
          ]
        
      
    
    
      
        (
        
          Eq
          .
          
            
          
          ⁢
          5
        
        )
      
    
  




and where

Qqs=−diag(Aqs)diag−1(Ass)   (Eq. 6)

and

Qes=−diag(Aes)diag−1(Ass)   (Eq. 7)

where diag(Aqs), diag(Ass) and diag(Aes) denote block diagonal matrices consisting of the main diagonal blocks of Aqs, Ass and Aes respectively. I is an identity matrix having ones on the diagonals and zeros elsewhere.

Continuing with FIG. 5, both sides of Eq. 4, Ax=b , are multiplied 253 by Q, so that Ax=b becomes:

Ãx={tilde over (b)}  (Eq. 8).

The reduced matrix Ã is calculated as the product of the scaling matrix Q and the matrix A:

Ã=QA   (Eq. 9)

and

{tilde over (b)}=Qb   (Eq. 10)

The True-IMPES reduction is another reduction process that may be performed in accordance with the present invention. A preferred embodiment of the present invention using a True-IMPES reduction is depicted in FIG. 6. The True-IMPES reduction is discussed in Stone, H. L. and Garder, Jr., A. O.: “Analysis of Gas-Cap or Dissolved-Gas Drive Reservoirs”, AIME (1961), Vol. 222, incorporated herein by reference. A True-IMPES scaling matrix (called herein T) may be calculated. Referring to FIG. 6, start 255 by setting 256 T as follows:




  
    
      
        T
        =
        
          [
          
            
              
                I
              
              
                0
              
              
                0
              
            
            
              
                
                  T
                  qs
                
              
              
                I
              
              
                0
              
            
            
              
                
                  T
                  es
                
              
              
                0
              
              
                I
              
            
          
          ]
        
      
    
    
      
        (
        
          Eq
          .
          
            
          
          ⁢
          11
        
        )
      
    
  




In the True-IMPES reduction: for T:

Tqs=−colsum(Aqs)colsum−1(Ass)   (Eq. 12)

Tes=−colsum(Aes)colsum−1(Ass)   (Eq. 13)

where colsum(Aqs), colsum(Ass) and colsum(Aes) denote block diagonal matrices, and where each diagonal block is the sum of the blocks in the corresponding block column of Aqs, Ass and Aes respectively.

Referring back to FIG. 6, multiply 257 both sides of Eq. 4, Ax=b, by T to yield Eq. 8, Ãx={tilde over (b)}, but where

{tilde over (b)}=Tb   (Eq. 14)

and reduced matrix Ã:

Ã=TA   (Eq. 15)

In addition, other types of reductions could be used for step 250 in FIG. 4.
Referring again to FIG. 4, the set of all of the unknown variables of the grid will be broken up 260 into a number of subsets. Let k be the number of implicit cell types plus one, the “one” representing a global set, typically with a single, common unknown variable, usually pressure. Recall that implicit cells are those cells having more than one unknown variable. The k subsets may overlap. Section 2 contains a description of a preferred embodiment of step 260 in FIG. 4 for constructing the k subsets.
Preconditioners are applied to equations to make them easier to solve. To construct a preconditioner for Eq. 8, Ãx={tilde over (b)}, an overlapping multiplicative Schwarz procedure, which can take various forms, is applied (step 280 of FIG. 4). This is further discussed in Section 3.
Section 2: Breaking up the Region of Interest into k Subsets
FIG. 7 depicts a region of interest 605, having type-1 cells with one unknown variable, type-2 cells with three unknown variables and type-3 cells with four unknown variables. There are three different types of cells in the example of FIG. 7; as a result, k is equal to three, where k is the number of implicit cell types plus one. Recall that an implicit cell type is a cell type with more than one unknown variable per cell. Unknown variables for the cells are indicated by letters placed within the relevant cells 606. In the example of FIG. 7, a pressure unknown variable is generally, labeled P, and non-pressure unknown variables, e.g., saturations, compositions, temperature, are generically labeled X1, X2, . . . , Xn. In the example of FIG. 7, type-1 cells 610 are labeled with a single P 608; type-2 cells 620 (i.e., three unknown variables, with a 25% shading pattern) are labeled with P, X1 612 (for oil saturation), and X2 613 (for water saturation), and type-3 cells 625 (i.e., four unknown variables, a divot shading pattern in FIG. 7) are labeled P, X1, X2, and X3 622 (for temperature).
FIG. 8 is a flowchart of a preferred embodiment of the present invention for the step of constructing the k subsets (step 260 on FIG. 4). Start 700 from step 250 of FIG. 4 and let 710 the total number of cells in the region of interest be l1, let N be the total number of variables, and let k be equal to the number of implicit cell types plus one. Type-i cells have ni variables per cell, where i=2, . . . , k. Type 1 cells are the IMPES cells (if any). In the example depicted in FIG. 7, l1 would be 110, N would be 188 and k would be 3. Let 720 i equal to 1. Generate 725 restriction matrix R1, which selects Set 1, comprising the set of the pressure variable (or in other embodiments, whatever the common unknown variable is, if that is not pressure) for all cells, including the IMPES cells present, if any. This allows selection of all the cells in the region of interest. In order for this to work properly, the common unknown variable (pressure, in this example) should be in the first position in each cell. If the common unknown variable is in a different position, the algorithm would have to be modified accordingly.
A detailed version of FIG. 8's step 725 (for i equal to one) and step 745 (for i greater than one) is depicted in FIG. 9. Start 800 from step 720 in FIG. 8, for step 725 (or from step 740 in FIG. 8, for step 745). Let 810:

Vi={v1(i), v2(i), . . . , vli(i)}  (Eq. 16)

Set 812 rpq(i) equal to zero, p equal to a range of 1, . . . , li; and q equal to a range of 1, . . . , N. Let 814 p equal 1. Set 816 q as the solution vector unknown number corresponding to variable number p in Set i (vp(i)=xq). Set 818 rpq(i) equal to one. Determine 820 whether p is equal to li. If not, set 822 p equal to p+1 and return to step 816. If p is equal to li, set 824 Ri equal to




  
    
      [
      
        r
        pq
        
          (
          i
          )
        
      
      ]
    
    
      
        
          p
          =
          1
        
        ,
        
          l
          i
        
      
      
        
          q
          =
          1
        
        ,
        N
      
    
  
  .




Set 826 Pi equal to RiT and return to FIG. 8 (to step 740 if using FIG. 9 for step 725 or to step 765 if using FIG. 9 for step 745).

FIG. 10 depicts the result of a restriction operator R1 selection using the example depicted in FIG. 7. The use of restriction operator R1 in this example results in a Set 1 630, where pressure is the only unknown variable. Each cell 606 that has pressure 608 as an unknown variable is selected, whether it is a cell-with-only-one-unknown-variable 635 or a cell-with-more-than-one-unknown 640, 645.
Referring again to FIG. 8, set 740 i equal to i plus one. Generate 745 a li×N restriction matrix Ri, which selects Set i variables, where Set i comprises the set of li variables defined by ni variables for each cell of Type-i and nj variables of any Type-j cell (where j is less than i) that has a Type-i neighbor sharing more than a single point. Again, FIG. 9 depicts a detailed flowchart for a preferred embodiment of step 745 of FIG. 8. The Type-j cells having Type-i neighbors are called “neighbor cells” herein. The variables are ordered cell by cell.
FIG. 11 depicts the result 650 of a restriction operator Ri selection using the example depicted in FIG. 7, where i is equal to two. In FIG. 1 as in FIG. 7, type-1 cells such as 610 are labeled with a single P; type-2 cells such as 620 (i.e., three unknown variables) are labeled with P, X1, and X2, and type-3 cells 625 (i.e., four unknown variables) are labeled P, X1, X2, and X3. Because i is equal to two, type-2 cells such as 620 are selected. In addition, neighbor cells that are type j cells, where j is less than i and that border the type-2 cells at more than one point are also selected. In this case type-j cells would be type 1 cells that border the type-2 cells at more than one point, such as 640. All R2 selected cells are shown with a 25% pattern, regardless of their number of variables.
Similarly, FIG. 12 depicts the result 652 of a restriction operator Ri selection using the example depicted in FIG. 7, where i is equal to three. In FIG. 12 as in FIG. 7, type-1 cells 610 are labeled with a single P, type-2 cells, such as 620, are labeled with P, X1, and X2, and type-3 cells, such as 625, are labeled P, X1, X2, and X3. All type-3 cells are selected. Neighbor cells to the type-3 cells, being type-j cells where j is less than i, such as 670, 675 are also selected. All R3 selected cells are shown with a divot (stippling?) pattern, regardless of their number of variables.
Referring again to FIG. 8, once the Type-i cells and their respective Type-j neighbor cells are selected, then the next step is to add appropriate numbers of dummy variables to the neighbor cells, by constructing 765 a padded restrictor {circumflex over (R)}i. A detailed version of step 770 is depicted in FIG. 13 and is discussed below. Continuing with FIG. 8, if 780 i is not equal to k, then return to step 740. If i is equal to k, then go 795 to step 270 of FIG. 4.
Although FIG. 8 first sets i equal to one in step 720 and proceeds in increasing orders of i in this example (see step 740) and increases until i equals k (see step 780), the methodology of these steps (i.e. the order in which i's are selected for generation of the corresponding restriction matrices) is order independent. In other embodiments, one could start with i equal to k and proceed by decreasing i until i equals one, or proceed to select i in any order one chooses.
FIG. 13 depicts a detailed version of a preferred embodiment of FIG. 8 step 770, which is the step of constructing the padded restrictor, {circumflex over (R)}i. The padded restrictor adds dummy variables as needed to the selected neighbor cells. Recall from step 826 of FIG. 9 that Pi equals RiT where RiT is the transpose of Ri. Starting 850 from step 745 of FIG. 8, set 852 i equal to two. Let 854 li be the number of variables in Set i, mi be the number of cells represented by the variables of Set i, and ni be the number of unknowns for Type-i cells. Set 856 q equal to one. Let 858 Cq be the number of the cell in Set i that contains variable number q (“q-cell”) and let Dq be the unknown number within cell Cq corresponding to variable number q. Let 860 spq(i) be entries in an (mini)×li matrix, Si. Determine 862 whether p is equal to: (Cq−1)*ni+Dq. If not, then set 864 spq(i) equal to zero. If so, then set 866 spq(i) equal to one. Determine 868 whether q is equal to 1i. If q is not equal to 1i, set 870 q equal to q plus 1 and return to step 858. If q is equal to 1i, then determine 872 whether p is equal to mini. If p is not equal to mini set p equal to p plus one and return to step 858. If p is equal to mini, then calculate 876 {circumflex over (R)}i as the product of Si and Ri and let {circumflex over (P)}i be the transpose of {circumflex over (R)}i. Generate 878 the padded Schwarz matrix:

Âi={circumflex over (R)}iÃ{circumflex over (P)}i+Di   (Eq. 17)

and for each zero row (a row with all zeroes) in {circumflex over (R)}iÃ{circumflex over (P)}i, set a non-zero (1) in its main diagonal. The matrix Di represents these diagonal entries added to prevent singularity of Âi due to the addition of the dummy equations and variables. Determine 880 whether i is equal to k. If i is not equal to k, set 882 i equal to i plus one and return to step 854. If i is equal to k, then go to step 780 of FIG. 8. Remember that the common variable (typically pressure) is preferably always in the first position in each cell; if it is not in the first position, then the algorithms would need to be modified accordingly.

FIG. 14 depicts the result 651 of a padded restrictor, {circumflex over (R)}i, as applied to FIG. 11, with i equal to two. In FIG. 14, as in FIG. 11 and FIG. 7, type-1 cells such as 610 are labeled with a single P; type-2 cells such as 620 (i.e., three unknown variables) are labeled with P, X1, and X2, and type-3 cells 625 (i.e., four unknown variables) are labeled P, X1, X2, and X3. Because i was equal to two, type-2 cells such as 620 were selected in FIG. 11, along with neighbor cells such as 640 that are type-j cells, where j is less than i and that border the type-2 cells at more than one point. As in FIG. 11, all R2 selected cells are shown with a 25% pattern, regardless of their number of variables. Now in FIG. 14, dummy cells indicated by the symbol D have been added to the neighbor cells that were selected such as 640 so that the selected neighbor cells have the same number of variables as the selected type-2 cells, that is three variables.
FIG. 15 depicts the result 654 of a padded restrictor, {circumflex over (R)}i, as applied to FIG. 12, with i equal to three. In FIG. 15, as in FIG. 12 and FIG. 7, type-1 cells 610 are labeled with a single P, type-2 cells, such as 620, are labeled with P, X1, and X2, and type-3 cells, such as 625, are labeled P, X1, X2, and X3. Because i was equal to three, all type-3 cells were selected in FIG. 12 along with neighbor cells to the type-3 cells that are type-j cells, where j is less than i, and that border the type-3 cells at more than one point. As i is equal to three for FIG. 12, j is equal to one or two, so type-1 and type-2 cells neighboring type-3 cells, such as 670 a type-2 cell and 675 a type-1 cell, were selected. As in FIG. 12, all R3 selected cells are shown with a divot pattern, regardless of their number of variables. Now in FIG. 15, dummy cells indicated by the symbol D have been added to the neighbor cells that were selected such as 670, 675 so that the selected neighbor cells have the same number of variables as the selected type-3 cells, that is four variables.
Section 3: Preconditioning
Section 3, Case 1: Use of an Overlapping Multiplicative Schwarz Algorithm.
FIG. 16 is a flowchart of a preferred embodiment of step 270 as depicted in FIG. 4, focusing on use of our overlapping multiplicative Schwarz algorithm to produce a preconditioner.) A residual vector is represented by:

r=b−Ã{tilde over (x)}  (Eq. 18)

where {tilde over (x)} is the most recent approximate solution vector. Let M−1 be an approximate inverse of Ã. A preconditioned residual {tilde over (r)}=M−1r is used to improve the approximation of x:

x≈{tilde over (x)}+{tilde over (r)}  (Eq. 19)

This is the same x as in Eq. 4, but the effort here is directed to obtaining approximate solutions for x. Temporary variable s is used to hold intermediate residuals, and yi is an intermediate solution for all the unknown variables on sub-space Vi. The use of the overlapping multiplicative Schwarz preconditioning can be defined by the following steps. Referring to FIG. 16, start 400 from step 260 of FIG. 4. As an initial step, set 410 i equal to one. Solve 420 for the pressures y in all cells, using the equation:

Âiyi={circumflex over (R)}ir   (Eq. 20)

and set 430 the approximate solution x to be

x={circumflex over (P)}iyi   (Eq. 21)

and set 430 s=r−Ãx. Determine 440 if i is equal to k. If i is equal to k, then go 450 to step 280 of FIG. 4. If i is not equal to k, set 460 i equal to i plus one. Solve 470 for yi using:

Âiyi={circumflex over (R)}is   (Eq. 22)

Using the new value of yi, calculate 480 a new value of x equal to x plus {circumflex over (P)}iyi. Then calculate 490 a new value of s as:

s←s−Ã{circumflex over (P)}iyi   (Eq. 23)

Return to step 440, repeating steps 440 through 480 until i is equal to k. Then proceed 450 to step 280 of FIG. 4.
Section 3, Case 2: Use of an Overlapping Multiplicative Schwarz Algorithm with Inexact Local Solves
In practical applications, Equations 20 and 22 may be replaced with inexact local solves. Examples include but are not limited to block ILU(K), Nested Factorization, Line Gauss-Seidel or a preconditioned iterative solution using acceleration methods such as GMRES or ORTHOMIN. See Y. Saad and M. H. Schultz.: “GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems”, SIAM Journal on Scientific and Statistical Computing, 7, PP 856-869, 1986; Vinsome, “P. K. W: “Orthomin, an Iterative Method for Solving Sparse Sets of Simultaneous Linear Equations”, SPE 5729 presented at the Fourth Symposium of Numerical Simulation of Reservoir Performance of the Society of Petroleum Engineers of AIME held in Los Angeles, Calif., Feb. 19-20, 1976, all incorporated by reference.
Section 4: Efficient Unrolling
In the preferred embodiments of the invention, efficiency is increased by using an efficient loop unrolling methodology. The padded AIM sub-matrix Âi={circumflex over (R)}iÃ{circumflex over (P)}i+Di (i>1) is partitioned in the fixed implicit ni×ni sub-matrix blocks. Thus Âi is factored or approximately factored using fixed block-size sub-matrix operations. Also in the solution or approximate solution step using the factors of Âi fixed block-size sub-matrix operations are employed. These sub-matrix operations are performed with high efficiency by unrolling inner do-loops (i.e. write out the code in fall instead of using do-loops) associated with the block dimension ni. The introduction of dummy variables and equations causes the factored Âi matrices have fixed-sized sub-matrix blocks and makes unrolling practical for AIM preconditioning.
The unrolling method is particularly useful in the implementation of steps 420 and 470 of FIG. 16, which are the most computationally expensive steps in FIG. 16. This loop unrolling technique may also be used in other steps of the invention to also increase efficiency. For example, by grouping all cells of the same type and then partitioning Ã by these groups generates sub-matrix blocks which may themselves be further partitioned into small fixed size sub-matrix blocks. The efficient use of these sub-blocks in the matrix-vector multiply step in step 490 in FIG. 16 involves unrolling loops whose length is associated with the small dimensions of these sub-blocks.
For the software implementation the AIM sub-matrix Âi={circumflex over (R)}iÃ{circumflex over (P)}i+Di, i=2, . . . , k is partitioned into fixed implicit ni×ni sub-matrix blocks which are used in all factorizations or approximate factorizations of Âi and in the Schwarz preconditioning steps. These sub-matrix operations may be done with high efficiency by unrolling inner loops associated with the block dimension ni.
Section 5: Error Analysis.
The following is an error analysis of a method using multiplicative Schwartz algorithm with no overlap, similar to what might be used in accordance with the 146 patent. Eq. 8 may be written as




  
    
      
        
          
            [
            
              
                
                  
                    A
                    ss
                  
                
                
                  
                    A
                    sq
                  
                
                
                  
                    A
                    se
                  
                
              
              
                
                  
                    A
                    qs
                  
                
                
                  
                    A
                    qq
                  
                
                
                  
                    A
                    qe
                  
                
              
              
                
                  
                    A
                    es
                  
                
                
                  
                    A
                    eq
                  
                
                
                  
                    A
                    ee
                  
                
              
            
            ]
          
          ⁡
          
            [
            
              
                
                  
                    x
                    s
                  
                
              
              
                
                  
                    x
                    q
                  
                
              
              
                
                  
                    x
                    e
                  
                
              
            
            ]
          
        
        =
        
          [
          
            
              
                
                  r
                  s
                
              
            
            
              
                
                  r
                  q
                
              
            
            
              
                
                  r
                  e
                
              
            
          
          ]
        
      
    
    
      
        (
        
          Eq
          .
          
            
          
          ⁢
          24
        
        )
      
    
  




The following system with auxiliary matrix A* is equivalent to the original system:




  
    
      
        
          
            (
            
              
                
                  
                    A
                    qq
                  
                
                
                  
                    A
                    qe
                  
                
                
                  
                    -
                    
                      A
                      qq
                    
                  
                
                
                  0
                
              
              
                
                  
                    A
                    eq
                  
                
                
                  
                    A
                    ee
                  
                
                
                  0
                
                
                  
                    A
                    es
                  
                
              
              
                
                  0
                
                
                  0
                
                
                  
                    A
                    qq
                  
                
                
                  
                    A
                    qs
                  
                
              
              
                
                  
                    A
                    sq
                  
                
                
                  
                    A
                    se
                  
                
                
                  0
                
                
                  
                    A
                    ss
                  
                
              
            
            )
          
          ⁡
          
            [
            
              
                
                  
                    x
                    q
                  
                
              
              
                
                  
                    x
                    e
                  
                
              
              
                
                  
                    
                      x
                      ~
                    
                    q
                  
                
              
              
                
                  
                    x
                    s
                  
                
              
            
            ]
          
        
        =
        
          [
          
            
              
                
                  r
                  q
                
              
            
            
              
                
                  r
                  e
                
              
            
            
              
                0
              
            
            
              
                
                  r
                  s
                
              
            
          
          ]
        
      
    
    
      
        (
        
          Eq
          .
          
            
          
          ⁢
          25
        
        )
      
    
  




This auxiliary matrix A* may be approximately factored as




  
    
      
        
          A
          *
        
        ≈
        
          
            [
            
              
                
                  
                    A
                    qq
                  
                
                
                  
                    A
                    qe
                  
                
                
                  0
                
                
                  0
                
              
              
                
                  
                    A
                    eq
                  
                
                
                  
                    A
                    ee
                  
                
                
                  0
                
                
                  0
                
              
              
                
                  0
                
                
                  0
                
                
                  
                    A
                    qq
                  
                
                
                  
                    A
                    qs
                  
                
              
              
                
                  
                    A
                    sq
                  
                
                
                  
                    A
                    se
                  
                
                
                  
                    A
                    sq
                  
                
                
                  
                    A
                    ss
                  
                
              
            
            ]
          
          ⁡
          
            [
            
              
                
                  I
                
                
                  0
                
                
                  
                    -
                    I
                  
                
                
                  0
                
              
              
                
                  0
                
                
                  I
                
                
                  0
                
                
                  0
                
              
              
                
                  0
                
                
                  0
                
                
                  I
                
                
                  0
                
              
              
                
                  0
                
                
                  0
                
                
                  0
                
                
                  I
                
              
            
            ]
          
        
      
    
    
      
        (
        
          Eq
          .
          
            
          
          ⁢
          26
        
        )
      
    
  




with error matrix





  
    
      
        
          E
          *
        
        =
        
          [
          
            
              
                0
              
              
                0
              
              
                0
              
              
                0
              
            
            
              
                0
              
              
                0
              
              
                
                  A
                  eq
                
              
              
                
                  A
                  es
                
              
            
            
              
                0
              
              
                0
              
              
                0
              
              
                0
              
            
            
              
                0
              
              
                0
              
              
                0
              
              
                0
              
            
          
          ]
        
      
    
    
      
        (
        
          Eq
          .
          
            
          
          ⁢
          27
        
        )
      
    
  




As shown below, applying such a methodology would converge more slowly and in most cases take more computer time than with using the present invention. An error analysis of an overlapping multiplicative Schwarz method in accordance with a preferred embodiment of the present invention is now described.
Ã is partitioned into a block 4×4 form:




  
    
      
        
          A
          ~
        
        =
        
          [
          
            
              
                
                  A
                  ss
                
              
              
                
                  A
                  sq
                
              
              
                
                  A
                  sb
                
              
              
                0
              
            
            
              
                
                  A
                  qb
                
              
              
                
                  A
                  qq
                
              
              
                
                  A
                  qb
                
              
              
                0
              
            
            
              
                
                  A
                  bs
                
              
              
                
                  A
                  bq
                
              
              
                
                  A
                  bb
                
              
              
                
                  A
                  bi
                
              
            
            
              
                0
              
              
                0
              
              
                
                  A
                  ib
                
              
              
                
                  A
                  ii
                
              
            
          
          ]
        
      
    
    
      
        (
        
          Eq
          .
          
            
          
          ⁢
          28
        
        )
      
    
  




where Ass and Aqq are the same as in Eq. 3. The block Aee in Eq. 3 has been further subdivided into two parts: explicit cells with at least one implicit neighboring cell (Abb) and those with no implicit neighbors (Aii).

For the overlapping two-block multiplicative Schwarz, define the prolongation operators R1 and R2 as:




  
    
      
        
          R
          1
        
        =
        
          [
          
            
              
                0
              
              
                0
              
              
                0
              
            
            
              
                
                  I
                  q
                
              
              
                0
              
              
                0
              
            
            
              
                0
              
              
                
                  I
                  b
                
              
              
                0
              
            
            
              
                0
              
              
                0
              
              
                
                  I
                  i
                
              
            
          
          ]
        
      
    
    
      
        (
        
          Eq
          .
          
            
          
          ⁢
          29
        
        )
      
    
  
  
    
      
        
          R
          2
        
        =
        
          [
          
            
              
                
                  I
                  s
                
              
              
                0
              
              
                0
              
            
            
              
                0
              
              
                
                  I
                  q
                
              
              
                0
              
            
            
              
                0
              
              
                0
              
              
                
                  I
                  b
                
              
            
            
              
                0
              
              
                0
              
              
                0
              
            
          
          ]
        
      
    
    
      
        (
        
          Eq
          .
          
            
          
          ⁢
          30
        
        )
      
    
  




where Is, Iq, Ib and Ii are identity matrices of conformable order to the partitioning of Ã.

The following system with auxiliary matrix A* is equivalent to the original system:




  
    
      
        
          
            [
            
              
                
                  
                    A
                    qq
                  
                
                
                  
                    A
                    qb
                  
                
                
                  0
                
                
                  
                    -
                    
                      A
                      qb
                    
                  
                
                
                  
                    -
                    
                      A
                      qq
                    
                  
                
                
                  0
                
              
              
                
                  
                    A
                    bq
                  
                
                
                  
                    A
                    bb
                  
                
                
                  
                    A
                    bi
                  
                
                
                  
                    -
                    
                      A
                      bb
                    
                  
                
                
                  
                    -
                    
                      A
                      bq
                    
                  
                
                
                  0
                
              
              
                
                  0
                
                
                  
                    A
                    ib
                  
                
                
                  
                    A
                    ii
                  
                
                
                  
                    -
                    
                      A
                      ib
                    
                  
                
                
                  0
                
                
                  0
                
              
              
                
                  0
                
                
                  0
                
                
                  0
                
                
                  
                    A
                    bb
                  
                
                
                  
                    A
                    bq
                  
                
                
                  
                    A
                    bs
                  
                
              
              
                
                  0
                
                
                  0
                
                
                  0
                
                
                  
                    A
                    qb
                  
                
                
                  
                    A
                    qq
                  
                
                
                  
                    A
                    qs
                  
                
              
              
                
                  
                    A
                    sq
                  
                
                
                  
                    A
                    sb
                  
                
                
                  0
                
                
                  0
                
                
                  0
                
                
                  
                    A
                    ss
                  
                
              
            
            ]
          
          ⁡
          
            [
            
              
                
                  
                    x
                    q
                  
                
              
              
                
                  
                    x
                    b
                  
                
              
              
                
                  
                    x
                    i
                  
                
              
              
                
                  
                    
                      x
                      ~
                    
                    b
                  
                
              
              
                
                  
                    
                      x
                      ~
                    
                    q
                  
                
              
              
                
                  
                    x
                    s
                  
                
              
            
            ]
          
        
        =
        
          [
          
            
              
                
                  r
                  q
                
              
            
            
              
                
                  r
                  b
                
              
            
            
              
                
                  r
                  i
                
              
            
            
              
                0
              
            
            
              
                0
              
            
            
              
                
                  r
                  s
                
              
            
          
          ]
        
      
    
    
      
        (
        
          Eq
          .
          
            
          
          ⁢
          31
        
        )
      
    
  




This auxiliary matrix may be approximately factored as:

A*=L*U*+E*   (Eq. 32)

where





  
    
      
        
          L
          *
        
        =
        
          [
          
            
              
                
                  A
                  qq
                
              
              
                
                  A
                  qb
                
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
            
            
              
                
                  A
                  bq
                
              
              
                
                  A
                  bb
                
              
              
                
                  A
                  bi
                
              
              
                0
              
              
                0
              
              
                0
              
            
            
              
                0
              
              
                
                  A
                  ib
                
              
              
                
                  A
                  ii
                
              
              
                0
              
              
                0
              
              
                0
              
            
            
              
                0
              
              
                0
              
              
                0
              
              
                
                  A
                  bb
                
              
              
                
                  A
                  bq
                
              
              
                
                  A
                  bs
                
              
            
            
              
                0
              
              
                0
              
              
                0
              
              
                
                  A
                  qb
                
              
              
                
                  A
                  qq
                
              
              
                
                  A
                  qs
                
              
            
            
              
                
                  A
                  sq
                
              
              
                
                  A
                  sb
                
              
              
                0
              
              
                
                  A
                  sb
                
              
              
                
                  A
                  sq
                
              
              
                
                  A
                  ss
                
              
            
          
          ]
        
      
    
    
      
        (
        
          Eq
          .
          
            
          
          ⁢
          33
        
        )
      
    
  




and





  
    
      
        
          U
          *
        
        =
        
          [
          
            
              
                I
              
              
                0
              
              
                0
              
              
                0
              
              
                
                  -
                  I
                
              
              
                0
              
            
            
              
                0
              
              
                I
              
              
                0
              
              
                
                  -
                  I
                
              
              
                0
              
              
                0
              
            
            
              
                0
              
              
                0
              
              
                I
              
              
                0
              
              
                0
              
              
                0
              
            
            
              
                0
              
              
                0
              
              
                0
              
              
                I
              
              
                0
              
              
                0
              
            
            
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                I
              
              
                0
              
            
            
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                I
              
            
          
          ]
        
      
    
    
      
        (
        
          Eq
          .
          
            
          
          ⁢
          34
        
        )
      
    
  




and the error matrix is:





  
    
      
        
          E
          *
        
        =
        
          [
          
            
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
            
            
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
            
            
              
                0
              
              
                0
              
              
                0
              
              
                
                  A
                  ib
                
              
              
                0
              
              
                0
              
            
            
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
            
            
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
            
            
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
            
          
          ]
        
      
    
    
      
        (
        
          Eq
          .
          
            
          
          ⁢
          35
        
        )
      
    
  




Thus with exact solution on both overlapping subspaces, the only residual error is associated with non-boundary explicit cells with explicit boundary cell neighbors.
These error terms are typically much smaller than the error terms in Eq. 27. Since the latter error terms have additional couplings with non-pressure variables. Note also that it is these pressure-to-non-pressure couplings that the IMPES reduction step attempts to reduce.
Although the foregoing is provided for purposes of illustrating, explaining and describing certain embodiments of the automated repetitive array microstructure defect inspection invention in particular detail, modifications and adaptations to the described methods, systems and other embodiments will be apparent to those skilled in the art and may be made without departing from the scope or spirit of the invention.

## Claims

1. A computer implemented method for conducting a reservoir simulation, comprising:
a. building, using a computer system, a reservoir model of a region of interest, by gridding the region of interest to generate a grid, the grid being comprised of one or more types of cells, the types of cells being distinguished by a number of unknown variables representing properties of the cells, with each cell having a common variable as an unknown variable;
b. identifying, using the computer system, different cell types for the grid;
c. constructing, using the computer system, a matrix of coefficients for the reservoir model based on the different cell types;
d. at least partially decoupling, using the computer system, the common variable from other unknown variables in the matrix by using a reduction process to yield a reduced matrix;
e. mathematically breaking up, using the computer system, the common variable and the other unknown variables in the reduced matrix into a number of subsets, wherein the number of subsets is determined based on the different cell types;
f. applying, using the computer system, an overlapping multiplicative Schwartz procedure to the subsets of the reduced matrix to obtain a preconditioner;
g. conducting, using the computer system, the reservoir simulation using the preconditioner; and
h. generating, using the computer system, a plan based on the reservoir simulation, wherein the plan is implemented to improve production from a reservoir.

2. The method of claim 1, wherein the building step (a) results in a grid that is structured.

3. The method of claim 1, wherein the building step (a) results in a grid that is unstructured.

4. The method of claim 1 wherein the common variable is pressure.

5. The method of claim 1 wherein the common variable is temperature.

6. The method of claim 1, wherein the step (g) of conducting the reservoir simulation further comprises using the preconditioner to solve for the unknown variables.

7. The method of claim 6 wherein the common variable is pressure and wherein the matrix that is constructed in constructing step (c) is written in block form, based on the number of types of cells in the region of interest.

8. The method of claim 7, wherein for a single variable cell-type in the grid, the matrix requires one block row and one block column and wherein for each multi-variable cell-type in the grid, the matrix requires two additional block rows and two additional block columns.

9. The method of claim 8 wherein the step (d) of at least partially decoupling the common variable from the other unknown variables in the matrix is performed using a True-IMPES reduction.

10. The method of claim 8 wherein the step (d) of at least partially decoupling the common variable from the other unknown variables in the matrix is performed using a Quasi-IMPES reduction.

11. The method of claim 1, wherein the matrix that is constructed in constructing step (c) is written in block form, based on the different cell types in the region of interest.

12. The method of claim 11, wherein the grid has a single variable cell-type and the matrix requires one block row and one block column.

13. The method of claim 11, wherein for a single variable cell-type in the grid, the matrix requires one block row and one block column and wherein for each multi-variable cell-type in the grid, the matrix requires two additional block rows and two additional block columns.

14. The method of claim 1 wherein the step (d) of at least partially decoupling the common variable from the other unknown variables in the matrix is performed using a Quasi-IMPES reduction.

15. The method of claim 1 wherein the step (d) of at least partially decoupling the common variable from the other unknown variables in the matrix is performed using a True-IMPES reduction.

16. The method of claim 1 wherein step (e) of mathematically breaking up the common variable and the other unknown variables in the reduced matrix further comprises:
(e)(1) letting a total number of cells in the region of interest be li, letting N be a total number of unknown variables over all cells, letting k equal to a number of implicit cell types plus one, wherein an implicit cell comprises more than one unknown variable, with type-i cells having ni variables per cell, where i=1, 2, . . . , k with type 1 cells being IMPES cells, if any;
(e)(2) setting i equal to one;
(e)(3) generating li×N restriction matrix Ri: where li is the total number of cells and N is the total number of unknown variables, so that Ri selects Set i variables;
(e)(4) setting i equal to i plus one;
(e)(5) generating a li×N restriction matrix Ri, which selects the Set i variables;
(e)(6) determining a padded restrictor Ri^;
(e)(7) if i is not equal to k, repeating steps (e)(4) through (e)(6) until i is equal to k.

17. The method of claim 16, wherein determining the padded restrictor step (e)(6) further comprises:
(e)(6)(i) letting Vi={v1(i), v2(i), . . . , vli(i)}, wherein Vi represents a range of values of unknown variables for each of the type-i cells;
(e)(6)(ii) setting rpq(i) equal to zero, p equal to a value in a range of 1, . . . , li; and q equal to a value in a range of 1, . . . ,N, wherein rpq(i) represents a type-i restriction cell;
(e)(6)(iii) letting p equal 1, wherein p represents a value in a range of the total number of cells;
(e)(6)(iv) setting q as the unknown variable number corresponding to cell number p in Set i (vp(i)=xq), wherein xq represents the unknown variable and q represents a value in a range of the total number of unknown variables;
(e)(6)(v) setting rpq(i) equal to one;
(e)(6)(vi) determining whether p is equal to li and if not, setting p equal to p+1 and returning to step (e)(6)(iv), while if p is equal to li, setting Ri equal to [rpq(i)]p=1, . . . li, q=1, . . . ,N; and
(e)(6)(vii) setting Pi equal to RTi, wherein Pi is a transpose of the restriction matrix.

18. The method of claim 1 where step (f) of applying an overlapping multiplicative Schwartz procedure to the subsets of the reduced matrix to obtain a preconditioner further comprises:
(f)(1) setting i equal to one;
(f)(2) solving for the pressures yi in all cells, using the equation Âiyi={circumflex over (R)}ir,

wherein Âi represents a padded Schwarz matrix, {circumflex over (P)}i represents the padded restrictor, and r represents a residual vector;
(f)(3) setting the approximate solution x to be x={circumflex over (P)}iyi and setting s equal to r−Ãx,

wherein {circumflex over (P)}i represents a transpose of {circumflex over (P)}i, s represents a temporary variable for storing intermediate residuals, Ã represents a Schwarz matrix, and x represents the solution vector;
(f)(4) determining whether i is equal to k, and if it is not,
(f)(4)(i) setting i equal to i plus 1;
(f)(4)(ii) solving for yi, using Âiyi={circumflex over (R)}is;
(f)(4)(iii) using the new value of yi, calculate a new value of x equal to x plus {circumflex over (P)}iyi;
(f)(4)(iv) calculating a new value of s equal to s minus the product of Ã{circumflex over (P)}iyi; and
(f)(4)(v) returning to determining step (f)(4) until i is equal to k.

19. The method of claim 1 wherein there are k−1 different cell types with m>1, wherein m represents the unknown variables of a cell of the reduced matix, and step (e) of mathematically breaking up the common variable and the other unknown variables in the reduced matrix in the reduced matrix further comprises:
(e)(1) for each cell of type mi>1, i=1 to k−1, forming a subsystem composed of type mi cells and their neighbors of different type, each subsystem having a constant block size;
(e)(2) for neighbors of type n>mi, picking the common m variables when constructing the subsystems; and
(e)(3) for n<m, picking all the n variables, and padding the system with m-n dummy variables.

20. A computer implemented method for conducting a reservoir simulation, using a reservoir model of a region of interest, the region of interest having been gridded to generate a grid, the grid of the region of interest being comprised of one or more types of cells, the types of cells being distinguished by a number of unknown variables representing properties of the cells, with each cell having a common variable as an unknown variable, comprising:
a) identifying, using the computer system, different cell types for the grid;
b) constructing, using the computer system, a matrix of coefficients for the reservoir model based on the different cell types;
c) at least partially decoupling, using the computer system, the common variable from other unknown variables in the matrix by using a reduction process to yield a reduced matrix;
d) mathematically breaking up, using the computer system, the common variable and the other unknown variables in the reduced matrix into a number of subsets, wherein the number of subsets is determined based on the different cell types, further comprising:
(d)(1) means for letting a total number of cells in the region of interest be li, letting N be a total number of unknown variables over all cells, letting k equal to a number of implicit cell types plus one, wherein an implicit cell comprises more than one unknown variable, with type-i cells having ni variables per cell, where i=1, 2, . . . , k with type 1 cells being IMPES cells, if any;
(d)(2) setting i equal to one;
(d)(3) generating li×N restriction matrix Ri: where li is the total number of cells and N is the total number of unknown variables, so that Ri selects Set i variables;
(d)(4) setting i equal to i plus one;
(d)(5) generating a li×N restriction matrix Ri, which selects the Set i variables;
(d)(6) determining the padded restrictor Ri^;
(d)(7) means for, if i is not equal to k, repeating steps (d)(4) through (d)(6) until i is equal to k;
e) applying, using the computer system, an overlapping multiplicative Schwartz procedure to the subsets of the reduced matrix to obtain a preconditioner;
f) using, using the computer system, the preconditioner of step(e) to solve for the unknown variables;
g) conducting, using the computer system, the reservoir simulation using the preconditioner; and
h) generating, using the computer system, a plan based on the reservoir simulation, wherein the plan is implemented to improve production from a reservoir.

21. The method of claim 20 wherein the step (d)(6) determining the padded restrictor step further comprises:
(d)(6)(i) letting Vi={v1(i), v2(i), . . . , vli(i)}, wherein Vi represents a range of values of unknown variables for each of the type-i cells;
(d)(6)(ii) setting rpq(i) equal to zero, p equal to a value in a range of 1, . . . , li; and q equal to a value in a range of 1, . . . , N, wherein rpq(i) represents a type-i restriction cell;
(d)(6)(iii) letting p equal 1, wherein p represents a value in a range of the total number of cells;
(d)(6)(iv) setting q as the unknown variable number corresponding to cell number p in Set i (vp(i)=xq), wherein xq represents the unknown variable and q represents a value in a range of the total number of unknown variables;
(d)(6)(v) setting rpq(i) equal to one;
(d)(6)(vi) determining whether p is equal to li and if not, setting p equal to p+1 and returning to step (e)(6)(iv), while if p is equal to li, setting Ri equal to [rpq(i)]p=1, . . . li, q=1, . . . , N; and
(d)(6)(vii) setting Pi equal to RTi, wherein Pi is a transpose of the restriction matrix.

22. The method of claim 21 wherein step (e) of applying an overlapping multiplicative Schwartz procedure to the subsets of the reduced matrix to obtain a preconditioner further comprises:
(e)(1) setting i equal to one;
(e)(2) solving for the pressures y in all cells, using the equation Âiyi={circumflex over (R)}ir, wherein Âi represents a padded Schwarz matrix, Âi represents the padded restrictor, and r represents a residual vector;
(e)(3) setting the approximate solution x to be x={circumflex over (P)}iyi and setting s equal to r−Ãx, wherein {circumflex over (P)}i represents a transpose of {circumflex over (P)}i, s represents a temporary variable for storing intermediate residuals, Ã represents a Schwarz matrix, and x represents the solution vector;
(e)(4) determining whether i is equal to k, and if it is not,
(e)(4)(i) setting i equal to i plus 1;
(e)(4)(ii) solving for yi, using Âiyi={circumflex over (R)}is;
(e)(4)(iii) using the new value of yi, calculate a new value of x equal to x plus {circumflex over (P)}iyi;
(e)(4)(iv) calculating a new value of s equal to s minus the product of Ã{circumflex over (P)}iyi; and
(e)(4)(v) returning to determining step (e)(4) until i is equal to k.

23. The method of claim 20 wherein the common variable is pressure.

24. The method of claim 20 wherein the common variable is temperature.

25. The method of claim 20 wherein the step (d) of at least partially decoupling the common variable from the other unknown variables in the matrix is performed using a Quasi-IMPES reduction.

26. The method of claim 20 wherein the step (d) of at least partially decoupling the common variable from the other unknown variables in the matrix is performed using a True-IMPES reduction.

27. A program storage device readable by a machine, tangibly embodying a program of instructions executable by the machine to perform method steps for conducting a reservoir simulation using a reservoir model wherein a region of interest has been gridded, interest to generate a grid, the grid of the region of interest being comprised of one or more types of cells, the types of cells being distinguished by a number of unknown variables representing properties of the cells, with each cell having a common variable as an unknown variable, said storage device comprising instructions for:
a) identifying different cell types for the grid;
b) constructing a matrix of coefficients for the reservoir model based on the different cell types;
c) at least partially decoupling the common variable from other unknown variables in the matrix by using a reduction process to yield a reduced matrix;
d) mathematically breaking up the common variable and the other unknown variables in the reduced matrix into a number of subsets, wherein the number of subsets is determined based on the different cell types;
e) applying an overlapping multiplicative Schwartz procedure to the subsets of the reduced matrix to obtain a preconditioner;
f) using the preconditioner to solve for the unknown variables;
g) conducting the reservoir simulation using the preconditioner; and
h) generating a plan based on the reservoir simulation, wherein the plan is implemented to improve production from a reservoir.

28. The program storage device of claim 27, wherein the grid is structured.

29. The program storage device of claim 27, wherein the grid is unstructured.

30. The program storage device of claim 27, wherein the common variable is pressure.

31. The program storage device of claim 27, wherein the common variable is temperature.

32. The program storage device of claim 27, wherein the matrix that is constructed in constructing step (b) is written in block form, based on the number of types of cells in the region of interest.

33. The program storage device of claim 27, wherein the grid has a single variable cell-type and the matrix requires one block row and one block column.

34. The program storage device of claim 33, wherein for a single variable cell-type in the grid, the matrix requires one block row and one block column and wherein for each multi-variable cell-type in the grid, the matrix requires two additional block rows and two additional block columns.

35. The program storage device of claim 27, wherein the step (c) of at least partially decoupling the common variable from the other unknown variables in the matrix is performed using a Quasi-IMPES reduction.

36. The program storage device of claim 27, wherein the step (c) of at least partially decoupling the common variable from the other unknown variables in the matrix is performed using a True-IMPES reduction.

37. The program storage device of claim 27, wherein step (d) of mathematically breaking up the common variable and the other unknown variables in the reduced matrix further comprises:
(d)(1) letting a total number of cells in the region of interest be li, letting N be a total number of unknown variables over all cells, letting k equal to a number of implicit cell types plus one, wherein an implicit cell comprises more than one unknown variable, with type-i cells having ni variables per cell, where i=1, 2, . . . , k with type 1 cells being IMPES cells, if any;
(d)(2) setting i equal to one;
(d)(3) generating li×N restriction matrix Ri: where li is the total number of cells and N is the total number of unknown variables, so that Ri selects Set i variables;
(d)(4) setting i equal to i plus one;
(d)(5) generating a li×N restriction matrix Ri, which selects the Set i variables;
(d)(6) determining the padded restrictor Ri^;
(d)(7) if i is not equal to k, repeating steps (d)(4) through (d)(6) until i is equal to k.

38. The program storage device of claim 27, wherein step (e) of applying an overlapping multiplicative Schwartz procedure to the subsets of the reduced matrix to obtain a preconditioner further comprises:
(e)(1) setting i equal to one;
(e)(2) solving for the pressures y in all cells, using the equation Âiyi={circumflex over (R)}ir, wherein Âi represents a padded Schwarz matrix, {circumflex over (P)}i represents the padded restrictor, and r represents a residual vector;
(e)(3) setting the approximate solution x to be x={circumflex over (P)}iyi and setting s equal to r−Ãx, wherein {circumflex over (P)}i represents a transpose of {circumflex over (P)}i, s represents a temporary variable for storing intermediate residuals, Ã represents a Schwarz matrix, and x represents the solution vector;
(e)(4) determining whether i is equal to k, and if it is not,
(e)(4)(i) setting i equal to i plus 1;
(e)(4)(ii) solving for yi, using Âiyi={circumflex over (R)}is;
(e)(4)(iii) using the new value of yi, calculate a new value of x equal to x plus {circumflex over (P)}iyi;
(e)(4)(iv) calculating a new value of s equal to s minus the product of Ã{circumflex over (P)}iyi; and
(e)(4)(v) returning to determining step (e)(4) until i is equal to k.

39. A computing system responsive to input data, adapted for solving a system of nonlinear equations that represent a particular entity, said simulation apparatus generating a set of simulation results when said system of nonlinear equations are solved, said set of simulation results including one or more parameters which characterize said particular entity, wherein a representation of the entity has been gridded to generate a grid, the grid of the representation of the entity being comprised of one or more types of cells, the types of cells being distinguished by a number of unknown variables representing properties of the cells, but with each cell having a common variable as an unknown variable, comprising:
one or more processors and
a memory storing instructions for:
a) a first means for identifying different cell types for the grid;
b) a second means for constructing a matrix of coefficients for a reservoir model based on the different cell types;
c) a third means for at least partially decoupling the common variable from other unknown variables in the matrix by using a reduction process to yield a reduced matrix;
d) a fourth means for mathematically breaking up the common variable and the other unknown variables in the reduced matrix into a number of subsets, wherein the number of subsets is determined based on the different cell types;
e) a fifth means for applying an overlapping multiplicative Schwartz procedure to the subsets of the reduced matrix to obtain a preconditioner;
f) a sixth means for using the preconditioner to solve for the unknown variables;
g) a seventh means for conducting the reservoir simulation using the preconditioner; and
h) an eighth means for generating a plan based on the reservoir simulation, wherein the plan is implemented to improve production from a reservoir.

40. The computing system of claim 39, wherein the grid is structured.

41. The computing system of claim 39, wherein the grid is unstructured.

42. The computing system of claim 39, wherein the common variable is pressure.

43. The computing system of claim 39, wherein, wherein the matrix that is constructed by constructing the second means (b) is written in block form, based on the number of types of cells in the region of interest.

44. The computing system of claim 43, wherein the grid has a single variable cell-type and the matrix requires one block row and one block column.

45. The computing system of claim 44, wherein for a single variable cell-type in the grid, the matrix requires one block row and one block column and wherein for each multi-variable cell-type in the grid, the matrix requires two additional block rows and two additional block columns.

46. The computing system of claim 39, wherein the third means (c) of at least partially decoupling the common variable from the other unknown variables in the matrix includes means for using a Quasi-IMPES reduction.

47. The computing system of claim 39, wherein the third means (c) of at least partially decoupling the common variable from the other unknown variables in the matrix includes means for using a True-IMPES reduction.

48. The computing system of claim 39, wherein the fourth means (d) for mathematically breaking up the common variable and the other unknown variables in the reduced matrix further comprises:
(d)(1) means for letting a total number of cells in the region of interest be li, letting N be a total number of unknown variables over all cells, letting k equal to a number of implicit cell types plus one, wherein an implicit cell comprises more than one unknown variable, with type-i cells having ni variables per cell, where i=1, 2, . . . , k with type 1 cells being IMPES cells, if any;
(d)(2) means for setting i equal to one;
(d)(3) means for generating li×N restriction matrix Ri: where li is the total number of cells and N is the total number of unknown variables, so that Ri selects Set i variables;
(d)(4) means for setting i equal to i plus one;
(d)(5) means for generating a li×N restriction matrix Ri, which selects the Set i variables;
(d)(6) means for determining the padded restrictor Ri^;
(d)(7) means for, if i is not equal to k, repeating steps (d)(4) through (d)(6) until i is equal to k.

49. The computing system of claim 39, wherein fifth means (e) for applying an overlapping multiplicative Schwartz procedure to the subsets of the reduced matrix to obtain a preconditioner further comprises:
(e)(1) means for setting i equal to one;
(e)(2) means for solving for the pressures y in all cells, using the equation Âiyi={circumflex over (R)}ir, wherein Âi represents a padded Schwarz matrix, {circumflex over (P)}i represents the padded restrictor, and r represents a residual vector;
(e)(3) setting the approximate solution x to be x={circumflex over (P)}iyi and setting s equal to r−Ãx, wherein {circumflex over (P)}i represents a transpose of Âi, s represents a temporary variable for storing intermediate residuals, Ã represents a Schwarz matrix, and x represents the solution vector;
(e)(4) means for determining whether i is equal to k, and if it is not,
(e)(4)(i) means for setting i equal to i plus 1;
(e)(4)(ii) solving for yi, using Âiyi={circumflex over (R)}is;
(e)(4)(iii) using the new value of yi, calculate a new value of x equal to x plus {circumflex over (P)}iyi;
(e)(4)(iv) calculating a new value of s equal to s minus the product of Ã {circumflex over (P)}iyi; and
(e)(4)(v) means for returning to determining step (e)(4) until i is equal to k.

50. A computing system responsive to a set of input data for displaying a gridded representation of an earth formation comprising a grid comprised of a plurality of cells and a plurality of simulation results associated with, respectively, with the plurality of cells, with types of cells of the grid being distinguished by a number of unknown variables representing properties of the cells, but with each cell having a common variable as an unknown variable, comprising:
one or more processors and
a memory storing instructions for:
a) a first means for identifying different cell types for the grid;
b) a second means for constructing an overall matrix of coefficients for a reservoir model based on the different cell types;
c) a third means for at least partially decoupling the common variable from other unknown variables in the matrix by using a reduction process to yield a reduced matrix;
d) a fourth means for mathematically breaking up the common variable and the other unknown variables in the reduced matrix into a number of subsets, wherein the number of subsets is determined based on the different cell types;
e) a fifth means for applying an overlapping multiplicative Schwartz procedure to the subsets of the reduced matrix to obtain a preconditioner;
f) a sixth means for using the preconditioner to solve for the unknown variables;
g) a seventh means for conducting the reservoir simulation using the preconditioner; and
h) an eighth means for generating a plan based on the reservoir simulation, wherein the plan is implemented to improve production from a reservoir.

51. The computing system of claim 50 wherein the grid is unstructured, the common variable is pressure, and wherein the fourth means (d) for mathematically breaking up the common variable and the other unknown variables in the reduced matrix farther comprises:
(d)(1) means for letting a total number of cells in the region of interest be li, letting N be a total number of unknown variables over all cells, letting k equal to a number of implicit cell types plus one, wherein an implicit cell comprises more than one unknown variable, with type-i cells having ni variables per cell, where i=1, 2, . . . , k with type 1 cells being IMPES cells, if any;
(d)(2) means for setting i equal to one;
(d)(3) means for generating li×N restriction matrix Ri: where li is the total number of cells and N is the total number of unknown variables, so that Ri selects Set i variables;
(d)(4) means for setting i equal to i plus one;
(d)(5) means for generating li×N restriction matrix Ri, which selects the Set i variables;
(d)(6) means for determining the padded restrictor Ri^;
(d)(7) means for, if i is not equal to k, repeating steps (d)(4) through (d)(6) until i is equal to k.

52. The computing system of claim 51 wherein the fifth means (e) for applying an overlapping multiplicative Schwartz procedure to the subsets of the reduced matrix to obtain a preconditioner further comprises:
(e)(1) means for setting i equal to one;
(e)(2) means for solving for the pressures y in all cells, using the equation Âiyi={circumflex over (R)}ir, wherein Âi represents a padded Schwarz matrix, {circumflex over (R)}i represents the padded restrictor, and r represents a residual vector;
(e)(3) means for setting the approximate solution x to be x={circumflex over (P)}iyi and setting s equal to r−Ãx, wherein {circumflex over (P)}i represents a transpose of {circumflex over (R)}i, s represents a temporary variable for storing intermediate residuals, Ã represents a Schwarz matrix, and x represents the solution vector;
(e)(4) means for determining whether i is equal to k, and if it is not,
(e)(4)(i) means for setting i equal to i plus 1;
(e)(4)(ii) means for solving for yi, using Âiyi={circumflex over (R)}is;
(e)(4)(iii) using the new value of yi, calculate a new value of x equal to x plus {circumflex over (P)}iyi;
(e)(4)(iv) means for calculating a new value of s equal to s minus the product of Ã {circumflex over (P)}iyi; and
(e)(4)(v) means for returning to determining step (e)(4) until i is equal to k.