US 7,006,951 B2Grant
Method for solving finite element models using time slabbing
Issue Date:2006-02-28
•24 Claims
•8 Drawing Sheets
Abstract
A method for solving finite element problems in n+1 dimensions by iteratively extruding an n-dimensional finite element mesh in an n+1th dimension to form “slabs” which can be more easily solved within the entire n+1-dimensional problem. In a preferred embodiment, a three-dimensional unstructured finite element mesh representing a physical system is extruded in the time dimension. The four-dimensional prisms formed by the extrusion are divided into simplices, forming the four-dimensional finite element mesh of an individual time slab. Time slabs corresponding to a series of time intervals are sequentially generated and solved. In a preferred embodiment, only a few time slabs are stored in working memory at a time so that a reduced amount of memory (in comparison to conventional methods of solving comparable problems) is required.
Metadata
Assignee
- Object Reservoir, Inc.
Inventors
- Stuart W. Pond, Jr.
- Edward J. Barragy
Application Information
Application Number:US 09/895,820
Filing Date:2001-06-29
Priority Date:2000-06-29
Art Unit:2128
Classifications
IPC:
G06F17/10
Patent Drawings (8 sheets)
Description
Related Applications
[0001] This application claims priority under 35 U.S.C. § 119(e) to U.S. Patent Application No. 60/215,697 entitled “Method and System for Oil Reservoir Simulation and Modeling” by Stephen R. Kennon, Kok Thye Lim, Scott A. Canaan, Steven B. Ward, Stuart W. Pond, Jr. and Edward J. Barragy, filed Jun. 29, 2000, which is incorporated by reference as if set forth in its entirety herein.
Technical Field of the Invention
[0002] This invention relates generally to methods for modeling physical systems using finite element analysis and, more specifically, to methods for creating finite element models used in simulating geological structures and corresponding fluid flow, especially in hydrocarbon reservoirs.
Background of the Invention
[0003] Physical systems can be modeled mathematically to simulate their behavior under certain conditions. There are a wide variety of means to model these systems, ranging from the very simplistic to the extremely complicated. One of the more complicated means to model physical systems is through the use of finite element analysis. As the name implies, finite element analysis involves the representation of individual, finite elements of the physical system in a mathematical model and the solution of this model in the presence of a predetermined set of boundary conditions.
[0004] In finite element modeling, the region that is to be analyzed is broken up into sub-regions called elements. This process of dividing the region into sub-regions may be referred to as discretization or mesh generation. The region is represented by functions defined over each element. This generates a number of local functions that are much simpler than those which would be required to represent the entire region. The next step is to analyze the response for each element. This is accomplished by building a matrix that defines the properties of the various elements within the region and a vector that defines the forces acting on each element in the structure. Once all the element matrices and vectors have been created, they are combined into a structure matrix equation. This equation relates nodal responses for the entire structure to nodal forces. After applying boundary conditions, the structure matrix equation can be solved to obtain unknown nodal responses. Intra-element responses can be interpolated from nodal values using the functions which were defined over each element.
[0005] In prior art methods, when a solution to a structured three-dimensional model over time was desired, the model had be solved for a first time value, then again for a second time value, and so on, until a series of time steps covering the desired range was completed. If it was desired to model a temporal feature more accurately, the size of the time steps had to be decreased and the entire three-dimensional physical model had to be solved for a greater number of time values. The computing resources which were required to generate the solution obviously increased with the number of time steps for which the model was solved. There was no way to localize the smaller time steps to a particular physical volume of interest or to adapt the three-dimensional spatial model over time. Further, when an error occurred in the solution of the model for one of the time values, the model and/or the time steps had to be adjusted and the entire model solved again for each of the time values.
Summary of the Invention
[0006] One or more of the problems outlined above may be solved by the various embodiments of the present invention. Broadly speaking, the invention comprises a method for solving space-time problems involving three-dimensional space by constructing a three-dimensional finite element model, then repeatedly extruding the model in a temporal dimension to form a “time slab” and solving the slab. This method may provide a number of advantages over prior art methods, including decreased memory usage, the ability to refine the spatial mesh from one time slab to another, the ability to adapt the temporal mesh to achieve convergence of a solution for the slab, the ability to perform “checkpointing” of solutions for successive time slabs, and so on.
[0007] In one embodiment, the method comprises providing a three-dimensional mesh which models the system to be solved and extruding the three-dimensional mesh in a series of time slabs which are sequentially solved. Each slab is visited, solved, adapted and re-solved if necessary to meet any error criteria, and then archived. Each slab includes a plurality of nodes that represent a region of four-dimensional space (i.e., space-time.) As each slab is solved, it may be desirable to refine the slab in the particular spatial regions of interest (for example, to obtain more accurate solutions in these regions.) Likewise, it may be desirable to refine the slab in the temporal dimension (for instance, to achieve convergence of the solution for the slab.) The solution for each slab may therefore be examined to determine whether refinement of the slab is necessary and, if so, the slab is adapted spatially (new nodes are added) and/or temporally (time steps are shortened.) After the slab has been appropriately refined, a new solution for the slab is generated. Because the solutions of the previous time slabs were completed and archived, there is no need to re-solve those slabs.
[0008] In one embodiment, all of the slabs to be solved are generated prior to the solution of any one of the slabs. In another embodiment, a first slab is generated and solved before a second slab is generated. The slab may be refined and re-solved as necessary to obtain a valid solution. After this solution is obtained, the slab is extruded to form a subsequent slab. (Although each slab is extruded from the spatial mesh which forms the boundary between the slabs, this may be more conveniently referred to as extruding one slab from the previous slab.) This subsequent slab is then solved, and the process is repeated until the desired time range has been covered. In another embodiment, the current time slab and at least one subsequent slab are generated. The current slab is then solved, including any refinements which are necessary. After the current slab has been solved, a new slab is extruded from the subsequent slab rather than the current slab. Because any particular slab is generated from the previous slab before the previous slab is refined (during the process of solving it,) refinements to each slab which do not need to be carried through from one slab to the next are not propagated through the slabs.
[0009] Numerous alternative embodiments are also possible. Particularly, it should be noted that the present methods, though described primarily with reference to the modeling of three-dimensional physical systems (e.g., oil reservoirs,) may be applicable in other contexts as well.
Brief Description of the Drawings
[0010] Other objects and advantages of the invention may become apparent upon reading the following detailed description and upon reference to the accompanying drawings in which:
[0011] FIG. 1 is a flow diagram illustrating the basic steps of one embodiment of the present invention;
[0012] FIG. 2 is an illustration of the triangular and tetrahedral elements which comprise unstructured finite element meshes in one embodiment of the present invention;
[0013] FIG. 3 is a flow diagram illustrating a method according to an alternative embodiment of the present invention;
[0014] FIG. 4 is a flow diagram illustrating a method according to an alternative embodiment of the present invention;
[0015] FIG. 5 is a diagram illustrating the relationship of the time slabs in one embodiment of the present invention;
[0016] FIGS. 6A–6F are a series of diagrams showing the manner in which increased accuracy can be achieved in prior art methods and in one embodiment of the present invention;
[0017] FIG. 7 is a diagram illustrating the propagation of refinements to subsequent time slabs; and
[0018] FIG. 8 is a diagram illustrating the manner in which generating time slabs which follow a current time slab may limit propagation of refinements to the subsequent time slabs.
[0019] While the invention is subject to various modifications and alternative forms, specific embodiments thereof are shown by way of example in the drawings and the accompanying detailed description. It should be understood, however, that the drawings and detailed description are not intended to limit the invention to the particular embodiment which is described. This disclosure is instead intended to cover all modifications, equivalents and alternatives falling within the spirit and scope of the present invention as defined by the appended claims.
Detailed Description of a Preferred Embodiment
[0020] A preferred embodiment of the invention is described below. It should be noted that this and any other embodiments described below are exemplary and are intended to be illustrative of the invention rather than limiting.
[0021] The present method is particularly well-suited to solving space-time problems involving three-dimensional space. In the prior art, three-dimensional finite element models were solved for a particular point in time. Put another way, the models were three-dimensional instead of four-dimensional. If a solution for the three-dimensional model over time was required, the three-dimensional model was solved for a first time value, then for a second time value, then a third, and so on. Thus, the finite element model was not a four-dimensional model, but was instead a three-dimensional model which was stepped over a given range of time values. The series of three-dimensional solutions to the three-dimensional model could then be combined to construct a four-dimensional solution.
[0022] A preferred embodiment of the present method employs a series of four-dimensional finite element models to generate a four-dimensional solution. More particularly, an unstructured finite element mesh is generated in the form of a series of time slabs which model the desired physical system over a desired time span. Referring to FIG. 1 , a flow diagram illustrating the basic steps of one embodiment of the present method is shown. As shown in the figure, the method comprises generating a plurality of time slabs and solving them. Each of the time slabs is sequentially visited and solved to generate a solution for that slab. This process is continued until all of the time slabs have been solved. The combined solutions for all of the slabs comprise a solution for the three-dimensional system over time. The unstructured four-dimensional finite element model is capable of following irregular spatial and temporal features of the modeled system, and the solution of the successive time slabs greatly reduces the memory required to generate a solution.
[0023] The details of a preferred embodiment will be set forth below. It may be helpful, however, to first define a few terms.
[0024] A node is a point in space. In finite element modeling, nodes form the vertices of the elements which are modeled. The nodes also form part of a mesh of nodes and edges which define the boundaries between elements in the modeled space.
[0025] An edge is a line between two nodes which form vertices of an element. The edges form part of the mesh which defines the boundaries between elements in the modeled space.
[0026] A simplex is a spatial configuration of n dimensions determined by n+1 points in a space of dimension equal to or greater than n. In other words, a-simplex is a geometric spatial element having the minimum number of boundary points necessary to enclose a space in a given number of dimensions. For example, in two dimensions, a simplex comprises a triangle, together with the interior area bounded by the triangle (see FIG. 2 .) Two points are insufficient to form a simplex in two-dimensional space because no area is bounded by the points (and the lines which interconnect them.) While four points may be sufficient to bound a two-dimensional area, they do not comprise the minimum number of boundary points by which the two-dimensional area can be bounded. In three dimensions, a simplex comprises a tetrahedron, which is bounded by four vertices (see FIG. 2 .) In four dimensions, a simplex comprises a hypertetrahedron (sometimes referred to as a hypertet) having five vertices.
[0027] A mesh is a collection of elements that fill a space. These elements are representative of a system which resides in that space. Because each element can be defined by a plurality of nodes and/or the edges between those nodes, a mesh may alternatively be considered a collection of nodes and/or the edges between them. At various points in this disclosure, “mesh” will be used to alternately refer to collections of elements or nodes/edges, depending upon the context in which the term is used. The mesh may also be referred to herein as a finite element model or simply a model.
[0028] Referring to FIG. 3 , a flow diagram illustrating a method according to an alternative embodiment of the method is shown. The four-dimensional mesh of the time slabs in the preferred embodiment is generated from a three-dimensional mesh by extruding each of the simplices of the three-dimensional mesh in a fourth dimension (time.) The extrusion creates a four-dimensional prism from each of the three-dimensional simplices. These four-dimensional prisms are then divided into a plurality of four-dimensional simplices which form a four-dimensional finite element model. This process is shown graphically in FIG. 4 . The extrusion can be repeated to form a slab that extends over a predetermined time range (although it should be noted that a slab can consist of a single extruded layer.) The elements of this model can be selectively refined to obtain a finer mesh in areas of greater interest, and a coarser mesh in areas which are of less interest. The mesh can be refined in the spatial dimensions (x, y, z) and, unlike time-stepped models, in the temporal dimension as well.
[0029] The time slabs are solved sequentially. In other words, a first one of the slabs is solved, then the next slab is solved, then the next, and so on. In one embodiment, after each of the time slabs is solved, it is archived. Because of the causal nature of time, the assumption can be made that no data relating to earlier time slabs will change once those slabs are solved. If a solution to a particular time slab does not converge, or if the solution does not meet the error criteria, the solution can be discarded, the mesh refined, and the time slab resolved. It is not necessary to re-solve any of the earlier time slabs because the refinement and resolving of the current slab does not affect the earlier slabs. (In conventional methods, the same three-dimensional mesh is time-stepped over the desired range, so if changes in the mesh are necessary at a later time step, they will have to be present at the earlier time steps as well. Thus, such changes necessitate that the entire solution be discarded.)
[0030] Referring to FIG. 5 , a diagram illustrating the relationship of the time slabs in one embodiment of the present method is shown. In this figure, the time slabs which correspond to earlier times are lower and the time slabs which correspond to later times are higher. It is assumed in this figure that each time slab is generated, then solved, then archived. (Other embodiments may maintain more time slabs in memory or may generate a subsequent time slab before solving the current one.) Three adjacent time slabs are depicted in FIG. 5 . The earliest time slab 21 has been generated, solved and archived, so it is no longer in memory. Time slab 22 is the current slab. Time slab 22 has been generated and is being solved. This is the only time slab in memory in this embodiment. Time slab 23 has not yet been generated, and is therefore shown as a dashed outline. Time slab 23 will be generated after current time slab 22 has been solved and archived.
[0031] The present method has memory requirements which may be substantially less than conventional methods, depending upon the particular implementation. In one embodiment, all of the time slabs are stored in core memory while successive slabs are solved. This embodiment may provide only a minor improvement over the prior art in terms of memory usage. In another embodiment, only the slab for which a solution is currently being computed is retained in core memory—earlier slabs are archived since they are not needed for the current solution and will not be changed. In this case, the memory requirements are substantially reduced from the prior art. Still other embodiments may store more than one, but less than all of the time slabs in memory, thereby providing different magnitudes of reductions in memory usage.
[0032] In a preferred embodiment of the present method, the three-dimensional mesh representing the system to be modeled is preferably an unstructured mesh of three-dimensional simplices. (While some embodiments may be implemented using structured meshes, this disclosure will focus primarily on those embodiments which use unstructured meshes.) An unstructured mesh is preferred because the elements of unstructured meshes are not constrained by the same requirements as structured meshes (e.g., minimum size of elements) and are therefore capable of more closely matching nodes of the elements to points of interest (e.g., object surfaces or temporal disturbances.) As a result, unstructured meshes are typically capable of more accurately modeling physical systems than comparable structured meshes.
[0033] The three-dimensional mesh is extruded in the temporal dimension to form a time slab. The extrusion which forms the time slab extends generally from a first time to a second time, covering an interval which is a portion of the entire range of time over which a solution is desired. The time slabs may be said to generally correspond to a time interval because the nodes of the mesh may not correspond to only the “beginning” and “ending” times of the interval. The nodes are part of a four-dimensional mesh and may be adjusted temporally, as well as spatially, to more accurately reflect temporal and spatial features of the modeled system. Consequently, a particular time slab may not extend in a well-defined manner from a certain beginning time to a certain end time.
[0034] As indicated above, prior art methods do not actually solve a four-dimensional model. Instead, a three-dimensional model is solved at each of a plurality of time steps. Thus, if increased accuracy is desired in a particular time interval, the entire three-dimensional spatial model may be solved for an increased number of time values (using smaller time steps.) The structured mesh cannot be refined to have a first time step in a first spatial region and at the same time have a different time step in a second spatial region. Using the unstructured mesh of the present system and method, however, this is easily achieved.
[0035] This is illustrated in FIGS. 6A–6F . FIGS. 6A–6B comprise a series of diagrams showing the manner in which increased accuracy can be achieved in prior art methods and in one embodiment of the present method. FIG. 6A depicts a one-dimensional mesh 30 comprising nodes 31–33. Mesh 30 is stepped through times n, n+1 and n+2 to generate a solution over time. In other words, a solution is generated at time n, then another solution is generated at time n+1, and finally a solution is generated at time n+2. In comparison, FIG. 6B depicts a one-dimensional mesh 30 which is extruded to form a two-dimensional mesh. This single mesh includes nodes 31–33 and 41–43. A second two-dimensional mesh is defined by nodes 41–46. Each of these two-dimensional meshes comprises a time slab extending from time n to time n+1, or from time n+1 to time n+2. (In an alternative embodiment, nodes 31–33 and 41–46 could define a single time slab extending from time n to time n+2.)
[0036] If a solution for the model varies rapidly with time, it may be desirable to modify the model to obtain a higher level of accuracy in the solution. In the case of the prior art method, this may be accomplished by reducing the time steps at which solutions for the one-dimensional model are computed, as illustrated in FIG. 60 . As shown in this figure, solutions for the one-dimensional mesh are calculated at times n (30), n+0.5, (34), n+1.0, (35), n⇄1.5, (36) and n+2.0 (37). It can be seen from the figure that whenever time step is selected, this seine step is applied over the extent of the one-dimensional model 30—that time step is not varied from one part of the model to another. Consequently, if the rapid changes are confined to only a portion of the model, computational power may have to be wasted on computations involving unnecessary nodes. Using the present methods, the time slabs can be modified to add nodes only in the region of interest. Referring to FIG. 6 , the one-dimensional model is extruded to form two time slabs as shown in FIG. 6B , but then two additional nodes, 51 and 52, are added in the region which exhibits the rapid change (at the center of each slab.) Thus, computations involving times n+0.5 and n+1.5 involve only a single node each. space) is generated. This three-dimensional mesh may be generated by any suitable means. This three-dimensional
[0037] Similarly, if the solution for the model changes rapidly as a function of spatial position, but does so only at certain times, it may be possible to increase the accuracy of the solution for the model over time. As depicted in FIG. 6E , this can be accomplished in prior art methods by increasing the number of nodes in the one-dimensional mesh. In this figure, new nodes 38 and 39 have been added. This mesh is solved at each time step, whether the extra nodes are needed at that particular time or not. Using the present methods, however, the computational requirements can be decreased by extruding the original one-dimensional model to form the time slabs, then adding new nodes as necessary to increase accuracy in the time and region of interest. As shown in FIG. 6F , nodes 53 and 54 are added at time n+1. Consequently, the computational requirements associated with time n+1 are increased, but the computational requirements associated with times n and n+2 remain the same.
[0038] While the examples of FIGS. 6A–6F illustrate the case of a one-dimensional mesh which is solved over time, it should be noted that these examples can be extended to two, three, or even more dimensions (although the three-dimensional case is expected to be most prevalent.)
[0039] The usefulness of this capability can be illustrated using the following example. If a disturbance such as a pressure wave propagates through a reservoir, it may be desirable to improve the accuracy of the model by increasing the number of elements in the vicinity of the disturbance. Because the disturbance propagates through the reservoir as a function of time, the location at which the fine mesh is needed changes with time. In this instance, it is assumed that the disturbance will propagate through the entire space which is being modeled, so, at one time or another, each location in the modeled space will need to have an increased number of elements.
[0040] A structured three-dimensional mesh does not change with time. It is simply time-stepped, with each element in the mesh being advanced by the same interval (size of time step.) Thus, each region in the modeled space must have the maximum number of elements that will be desired at any time. A solution for the model at any given time requires solutions for all of these elements, regardless of whether the additional elements are needed at that particular time. As a result of the increased number of elements in the mesh, increased computing resources are required to generate a solution.
[0041] The present methods solve this problem by generating a space-time mesh that can be refined for particular regions of both space and time. While the n-dimensional mesh in the prior art is not altered from one time step to the next, the n+1-dimensional mesh used in the present method is generated slab-by-slab, with each slab being refined as needed to obtain the desired level of accuracy in particular areas. If this level of accuracy is not needed in later slabs, those slabs can be refined to consolidate elements in the mesh and thereby reduce the computational requirements of those slabs. Another advantage that may be provided by the present methods is that the nodes which define a particular slab need not all have the same time value. While prior art methods take all of the nodes of the mesh at a single point in time and calculate a solution, the present methods may calculate a solution for a set of nodes that have different time values. This may be useful, for example, to model a non-planar (e.g., spherical) wavefront passing through the modeled system.
[0042] It should be noted that the time slabs used in the present methods may comprise a single layer of elements, or multiple layers. A time slab which has a single layer may be generated by a single extrusion, resulting in each element having nodes on both sides of the slab. A time slab which has multiple layers may be generated by extruding an initial mesh in the temporal dimension, subdividing the resulting prisms into simplices, and repeating this process at least one more time to create additional layers of elements. In a multi-layer time slab, none of the elements will have nodes which lie on both faces of the slab, unless the slab is refined by collapsing together two or more elements which have nodes on both faces.
[0043] Generally speaking, the method comprises the successive generation and solution of N+1-dimensional finite element meshes, where each mesh extends generally over a corresponding interval of time (i.e., a time slab.) Because each time slab can be solved separately, the computational requirements for generation of a solution are simplified, and the memory requirements may be substantially reduced. The different embodiments may generate either structured or unstructured meshes (although an unstructured mesh is prefered) of two, three, four, or even more dimensions. The time slabs may be generated immediately prior to being solved, they may be generated one or two slabs ahead of the current slab (to limit the propagation of refinements,) or they may all be generated at once. The different embodiments may retain only the current time slab in memory, or they may retain several (e.g., the current slab and one or two succeeding slabs) or even all of the slabs in memory. Different embodiments may refine the time slabs to add nodes or collapse elements, or they may not refine the slabs at all.
[0044] As indicated above, the preferred embodiment generates four-dimensional time slabs from a three-dimensional finite element mesh. The initial three-dimensional mesh, as well as the four-dimensional time slabs comprise unstructured meshes. The generation of the four-dimensional mesh can be performed in a number of ways. A description of a preferred method follows. First, an unstructured three-dimensional mesh which is representative of the physical system to be modeled (i.e., a mesh X-Y-Z space) is generated. This three-dimensional mesh may be generated by any suitable means. This three-dimensional mesh is then extruded in the temporal dimension. (A preferred method of extrusion of the three-dimensional mesh will be described in more detail below.) The three-dimensional mesh is extruded over a certain interval which is equivalent to the minimum time step that would be desired at any region in the three-dimensional mesh during that interval. The extrusion creates a plurality of four-dimensional prisms, each of which is then broken up into three four-dimensional simplices, creating an unstructured four-dimensional mesh extending over the interval.
[0045] The extrusion and creation of simplices is then repeated for a succeeding interval. (It should be noted that each successive extrusion is made from the three-dimensional mesh displaced in the previous extrusion, and not from the four-dimensional simplices.) The four-dimensional mesh of the first interval is then examined to identify regions in which the mesh should be refined (i.e., nodes added and corresponding new simplices defined, or nodes eliminated and simplices collapsed.) In one instance, regions in which the minimum time step is not necessary may identified and elements in the region collapsed into fewer elements having larger time steps. This may result in an unstructured four-dimensional mesh which has varying time steps in different regions of the modeled four-dimensional space. (In an alternative embodiment, it is possible to generate a mesh that uses larger time steps and then add nodes in regions of interest, wherein the new nodes are at times which are intermediate to the original time steps.) In another instance, regions in which additional information is needed may be identified so that additional nodes can be inserted into the mesh and corresponding new elements defined.
[0046] As indicated above, this embodiment involves the generation of not only the time slab which will next be solved (the “current” time slab,) but also a succeeding time slab. By generating the succeeding time slab prior to refining the current time slab, refinements which are made to the current time slab will not propagate through the subsequent time slabs. This is illustrated in FIGS. 7 and 8 . FIG. 7 is a diagram illustrating the propagation of refinements to subsequent time slabs. In this figure, a one-dimensional mesh 60 is extruded over the interval t0 to t1 to form a first time slab 61. (It can be seen that the time slab in this instance comprises two layers.) Current time slab 61 is then refined. In this case, the refinement consists of the addition of two new nodes 63 and 64. After current time slab 61 is solved, a succeeding time slab 62 is generated by extruding the refined one-dimensional mesh at time t1. Succeeding time slab 62 therefore includes nodes 65–68, whether they are necessary or not, simply because they were extruded from nodes 63 and 64.
[0047] In the preferred embodiment, the second time slab is extruded over the interval t1 to t2 before refinements to the current time slab are made. This situation is illustrated in FIG. 8 . The current time slab 61 is again generated by extruding one-dimensional mesh 60 over the interval t0 to t1. The succeeding time slab 72 is extruded from the same one-dimensional mesh prior to making any refinements. After succeeding time slab 72 is generated, current time slab 61 is refined. Nodes 63 and 64 are again added to the current time slab. Because they form part of the boundary between current time slab 61 and succeeding time slab 72, these nodes are also part of the succeeding time slab. With a succeeding slab must therefore be refined to incorporate these nodes. While they are integrated into succeeding time slab 72, however, the additional nodes do not propagate through to the other side of the succeeding time slab. Consequently, they will not be included in the extrusion of the one-dimensional mesh to form a time slab from t2 to t3. They may nevertheless be added to succeeding time slab 72, if necessary, when that time slab is refined.
[0048] The benefits and advantages which may be provided by the present invention have been described above with regard to specific embodiments. These benefits and advantages, and any elements or limitations that may cause them to occur or to become more pronounced are not to be construed as a critical, required, or essential features of any or all of the claims. As used herein, the terms “comprises,” “comprising,” or any other variations thereof, are intended to be interpreted as non-exclusively including the elements or limitations which follow those terms. Accordingly, a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to the claimed process, method, article, or apparatus.
[0049] While the present invention has been described with reference to particular embodiments, it should be understood that the embodiments are illustrative and that the scope of the invention is not limited to these embodiments. Many variations, modifications, additions and improvements to the embodiments described above are possible. Particularly, these variations may include computers or other data processing devices, computer readable media (such as floppy disks, CD-ROMs, DVD-ROMs, etc.,) storage devices, computer memories and the like which contain software, firmware or other programming embodying the foregoing methods. It is contemplated that these variations, modifications, additions and improvements fall within the scope of the invention as detailed within the following claims.
Claims
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
What is claimed is:
1. A computer readable medium containing a plurality of computer executable instructions for performing a computer implemented method for determining a dynamic fluid flow representation of an n-dimensional spatial system of a physical geological reservoir, wherein n is not greater than three, the method comprising:
generating a time slab, wherein the time slab comprises an n+1-dimensional finite element mesh based on the n-dimensional spatial system, the n+1-dimensional finite element mesh including nodes in a first time plane and nodes in a second time plane;
refining the n+1-dimensional finite element mesh to include a node between the first and second time planes, the node associated with a sub region of the n-dimensional spatial system; and
generating the dynamic fluid flow representation of the physical geological reservoir based on the time slab.
2. The computer readable medium of claim 1 wherein the method further comprises extruding succeeding time slabs, wherein each succeeding time slab is extruded from a preceding time slab; and generating dynamic fluid flow representations for each succeeding time slab.
3. The computer readable medium of claim 2 wherein each succeeding time slab is extruded from the preceding time slab after the dynamic fluid flow representation has been generated for the preceding time slab.
4. The computer readable medium of claim 2 wherein each succeeding time slab is extruded from the preceding time slab before a dynamic fluid flow representation has been generated for the preceding time slab.
5. The computer readable medium of claim 2 wherein the method further comprises refining each time slab prior to generating the dynamic fluid flow representation for the time slab to create a refined time slab.
6. The computer readable medium of claim 5 wherein refining each time slab comprises incorporating into the refined time slab nodes which were added to a preceding time slab in a refinement of the preceding time slab.
7. The computer readable medium of claim 5 wherein refining each time slab comprises incorporating one or more new nodes into the refined time slab and defining one or more corresponding new elements in the refined time slab.
8. The computer readable medium of claim 5 wherein refining each time slab comprises removing one or more nodes from the refined time slab and collapsing one or more corresponding elements in the refined time slab.
9. The computer readable medium of claim 5 wherein refining each time slab comprises defining a plurality of distinct nodes at times between nodes in each time slab.
10. The computer readable medium of claim 2 wherein the method further comprises archiving the dynamic fluid flow representation for each time slab after the dynamic fluid flow representation is generated.
11. The computer readable medium of claim 10 wherein the method further comprises maintaining a current one dynamic fluid flow representation of the time slabs in memory while a dynamic fluid flow representation is generated for the succeeding one of the time slabs.
12. The computer readable medium of claim 2 wherein the method further comprises maintaining dynamic fluid flow representation for each previous one of the time slabs in memory while dynamic fluid flow representations are generated for each subsequent one of the time slabs.
13. The computer readable medium of claim 2 wherein generating dynamic fluid flow representations for each of the time slabs comprises, for at least one of the time slabs, computing a non-converging dynamic fluid flow representation for the at least one time slab, refining the at least one time slab, and computing a new dynamic fluid flow representation for the at least one time slab.
14. The computer readable medium of claim 2 wherein generating dynamic fluid flow representations for each of the time slabs comprises, for at least one of the time slabs, computing a first dynamic fluid flow representation for the at least one time slab, determining that the first dynamic fluid flow representation is not within an error tolerance, refining the at least one time slab, and computing a new dynamic fluid flow representation for the at least one time slab.
15. The computer readable medium of claim 2 wherein generating succeeding time slabs comprises generating each time slab as an n+1-dimensional unstructured finite element mesh.
16. A computer readable medium containing a plurality of computer executable instructions for performing a method for generating a finite element representation of a geological reservoir, the method comprising:
generating a time slab, wherein the time slab comprises an n+1-dimensional finite element mesh based on an n-dimensional finite element spatial mesh representation of the geological reservoir and wherein the n+1-dimensional finite element mesh corresponds to a time interval within a selected time range, wherein n is not greater than three;
generating a first representation for the time slab;
determining whether the first representation meets an error standard;
adding nodes to the n+1-dimensional finite element mesh in response to the determining, the nodes associated with a time within the time interval and a portion of the n-dimensional finite element spatial mesh representation; and generating a second representation for the time slab.
17. The computer readable medium of claim 16 wherein the n+1-dimensional finite element mesh comprises an n+1-dimensional unstructured finite element mesh.
18. The computer readable medium of claim 16 further comprising maintaining only the second representation in memory while the second representation is generated and archiving the time slab after the second representation is generated.
19. A computer implemented method for representing fluid flow in a physical geological reservoir, the method comprising:
providing a spatial mesh representation of the physical geological reservoir;
generating a first time slab based on the spatial mesh representation, the first time slab including a first set of nodes temporally separated by a first time step in a first region of the spatial mesh representation and including a second set of nodes temporally separated by a second time step in a second region of the spatial mesh representation, wherein generating the first time slab comprises extruding the spatial mesh representation from a first time to a second time and generating elements based on the extruded spatial mesh representation, wherein generating the first time slab further comprises adding a third set of nodes between the first and second times associated with the second region and adjusting the elements based on the third set of nodes, the second set of nodes including the third set of nodes, wherein the second time step is less than the first time step; and
generating a representation of fluid flow in the physical geological reservoir based on the first time slab.
20. The computer implemented method of claim 19, wherein generating the first time slab comprises generating an erred representation that is outside an error tolerance, the third set of nodes added in response to the erred representation.
21. The computer implemented method of claim 19, further comprising generating a second time slab and generating a second representation of fluid flow in the geological reservoir based on the second time slab.
22. The computer implemented method of claim 21, wherein the representation of fluid flow in the geological reservoir based on the first time slab is archived prior to generating the second representation.
23. The computer implemented method of claim 22, wherein archiving the representation of fluid flow includes removing the representation from core memory.
24. The computer implemented method of claim 21, wherein the representation of fluid flow in the geological reservoir is maintained in memory while the second representation is generated.
Patent Citations (66)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3029018(A) | 1962-04-01 | Floyd, Jr. | Applicant |
| US3302710(A) | 1967-02-01 | Odeh | Applicant |
| US4742473(A) | 1988-05-01 | Shugar et al. | Applicant |
| US4821164(A) | 1989-04-01 | Swanson | Applicant |
| US5255212(A) | 1993-10-01 | Kondoh et al. | Applicant |
| US5432718(A) | 1995-07-01 | Molvig et al. | Applicant |
| US5553009(A) | 1996-09-01 | Meshkat et al. | Examiner |
| US5572634(A) | 1996-11-01 | Duluk, Jr. | Applicant |
| US5604911(A) | 1997-02-01 | Ushiro | Applicant |
| US5617322(A) | 1997-04-01 | Yokota | Applicant |
| US5675521(A) | 1997-10-01 | Holzhauer et al. | Applicant |
| US5699271(A) | 1997-12-01 | Sagawa et al. | Applicant |
| US5710726(A) | 1998-01-01 | Rowney et al. | Applicant |
| US5740342(A) | 1998-04-01 | Kocberber | Applicant |
| US5754181(A) | 1998-05-01 | Amdursky et al. | Applicant |
| US5891131(A) | 1999-04-01 | Rajan et al. | Applicant |
| US5966524(A) | 1999-10-01 | Burnett et al. | Applicant |
| US5999187(A) | 1999-12-01 | Dehmlow et al. | Examiner |
| US6014473(A) | 2000-01-01 | Hossack et al. | Applicant |
| US6018497(A) | 2000-01-01 | Gunasekera | Applicant |
| US6028607(A) | 2000-02-01 | Chan | Applicant |
| US6041017(A) | 2000-03-01 | Goldsberry | Applicant |
| US6052520(A) | 2000-04-01 | Watts, III | Applicant |
| US6054992(A) | 2000-04-01 | Gibson | Applicant |
| US6064810(A) | 2000-05-01 | Raad et al. | Applicant |
| US6070125(A) | 2000-05-01 | Murphy et al. | Applicant |
| US6078869(A) | 2000-06-01 | Gunasekera | Applicant |
| US6106561(A) | 2000-08-01 | Farmer | Applicant |
| US6191796(B1) | 2001-02-01 | Tarr | Applicant |
| US6230101(B1) | 2001-05-01 | Wallis | Applicant |
| US6313837(B1) | 2001-11-01 | Assa et al. | Applicant |
| US6366279(B1) | 2002-04-01 | Gorman | Applicant |
| US6445390(B1) | 2002-09-01 | Aftosmis et al. | Applicant |
| US6448788(B1) | 2002-09-01 | Meaney et al. | Applicant |
| US6516080(B1) | 2003-02-01 | Nur | Applicant |
| US6552724(B1) | 2003-04-01 | Marshall | Applicant |
| US6587104(B1) | 2003-07-01 | Hoppe | Applicant |
| US6608628(B1) | 2003-08-01 | Ross et al. | Applicant |
| US6633837(B1) | 2003-10-01 | Dye et al. | Applicant |
| US6674432(B1) | 2004-01-01 | Kennon et al. | Applicant |
| US6695765(B1) | 2004-02-01 | Beebe et al. | Applicant |
| US6816820(B1) | 2004-11-01 | Friedl et al. | Examiner |
| US2002/0032494(A1) | 2002-03-01 | Kennon et al. | Applicant |
| US2002/0032550(A1) | 2002-03-01 | Ward et al. | Applicant |
| US2002/0035453(A1) | 2002-03-01 | Pond, Jr. et al. | Applicant |
| US2002/0046014(A1) | 2002-04-01 | Kennon | Applicant |
| US2002/0067373(A1) | 2002-06-01 | Roe et al. | Applicant |
| US2002/0072883(A1) | 2002-06-01 | Lim et al. | Applicant |
| US2002/0082813(A1) | 2002-06-01 | Lim et al. | Applicant |
| US2005/0015231(A1) | 2005-01-01 | Edwards et al. | Applicant |
| EP709789 | 1996-05-01 | Applicant | |
| EP709789(A2) | 1996-05-01 | Applicant | |
| EP801364(B1) | 2003-07-01 | Applicant | |
| FR2775094 | 1999-08-01 | Applicant | |
| GB2326747(A) | 1998-12-01 | Applicant | |
| WO99/40532 | 1999-08-01 | Applicant | |
| WO99/52048 | 1999-10-01 | Applicant | |
| WO99/57418 | 1999-11-01 | Applicant | |
| WO2/01251(A2) | 2002-01-01 | Applicant | |
| WO2/02901(A2) | 2002-01-01 | Applicant | |
| WO2/03101(A2) | 2002-01-01 | Applicant | |
| WO2/03103(A2) | 2002-01-01 | Applicant | |
| WO2/03262(A2) | 2002-01-01 | Applicant | |
| WO2/03263(A2) | 2002-01-01 | Applicant | |
| WO2/03264(A2) | 2002-01-01 | Applicant | |
| WO2/03265(A2) | 2002-01-01 | Applicant |
Non-Patent Literature (30)
- Zwart et al., “Space-Time Meshing for Two-Dimensional Moving Boundary Problems”, Proceedings of Seventh International Meshing Roundtable, 1998, pp. 187-199.Examiner
- Ho et al., “Generation and Rotation of 3-D Finite Element Mesh for Skewed Rotor Induction Motors Using Extrusion Technique”, IEEE Transactions on Magnetics, May 1999, pp. 166-1269.Examiner
- International Search Report dated Mar. 5, 2002.Applicant
- P.A. Forsyth, et al., “Local Mesh Refinement and Modeling of Faults and Pinchouts”, SPE Form Evaluation, Jun. 1986, vol. 1, No. 3, pp. 275-285. XP-002191830.Applicant
- Y. Ding, et al., “Development of Dynamic Local Grid Refinement in Reservoir Simulation”, Proceedings of the 13th SPE Symposium on Reservoir Simulation, New Orleans, LA, Feb.-Mar. 1993, pp. 501-510. XP-002191831.Applicant
- S. Vema, et al., “A Control Volume Scheme for Flexible Frids in Reservoir Simulation”, Proceedings of the 1997 SPE Reservior Simulation Symposium, Dallas, TX, Jun. 1997, pp. 215-227. XP-002191832.Applicant
- S. Kocberber, et al., “An Automatic, Unstructured Control Volume Generation System for Geologically Complex Reservoirs”, Proceedings of the 1997 SPE Reservior Simulation Symposium, Dallas, TX, Jun. 1997, pp. 241-252. XP-002191833.Applicant
- Y. Kuwauchi, et al., “Development and Applications of a Three Dimentsional Voronoi-Based Fexible Grid Black Oil Reservoir Simulator”, SPE Asia Specific Oil & Gas Congerence, Adelaide, Australia, Oct. 1996, pp. 1-12. XP-002191834.Applicant
- R. Page, et al., “A Functional Program Describing a Simple Reservoir Model and Its Potential for Parallel Computation”, Proceedings of the 1990 Symposium on Applied Computing, IEEE, Apr. 1990, pp. 85-91.Applicant
- C. Giertsen, et al., “Volume Visulization of Sparse Irregular Meshes”, Computer Graphics and Applications, IEEE, vol. 2, No. 2, Mar. 1992, pp. 40-48.Applicant
- S. Ghosh, “Curvilinear Local Grid Refinement”, SPE 50633, SPE European Petroleum Conference, The Netherlands, Oct. 20-22, 1998.Applicant
- H. N. Sharpe, et al., “A New Adaptive Orthogonal Grid Generation Procedure for Reservoir Simulation” 65th Annual Technical Conference and Exhibition of the Society of Petroleum Engineers. New Orelans. LA. Sep. 23-26. 1990.Applicant
- M. Wheeler, et al., “A Parallel Multiblock/Multidomain Approach for Reservoir Simulation”, Proceedings of the 1999 15th Symposium on Reservoir Simulation, Houston, TX, Feb. 1999, XP-002188857.Applicant
- D. Kahaner, et al., “An Expreimental Algorithm for N-Dimensional Adaptive Quadrature”, ACM Transactions on Mathematical Software (TOMS), Mar. 1979, pp. 86-96.Applicant
- Y. Ozdogan, “Seismic Data Processing”, Society of Exploration Geophysics, Tulsa, OK, 1991, p. 514-515.Applicant
- S. Norris, et al., “Modeling Fluid Flow Around Horizontal Wellbores”, Proceedings: SPE Annual Technical Conference and Exhibition 1990 Part 4, New Orleans, LA Sep. 23-26, 1990, vol. SIGMA, pp. 65-75.Applicant
- P. Perrochet, “Finite Hyperelements: A 4D Geometrical Framework Using Coariant Baes and Metric Tensors” Communications in Numberical Methods in Engineering, Jun. 1995, UK, vol. 11, No. 6, pp. 525-534.Applicant
- J.M.M. Regtien, et al., “Interactive Reservoir Simulation”, Proceedings of the 13th Symposium on Reservoir Simulation, San Antonio, TX Feb. 12-15, pp. 545-552.Applicant
- C. Buckalew, et al., “Oilfield Visulization on the PC Platform”, 2000 SPE/AAPG Western Regional Meeting, Jun. 19-23, 2000, pp. 1-5.Applicant
- E. Farkas, Linearization Techniques of Reservoir Simulation Equations: Fully Implicit Cases, Proceedigns of the 1997 SPE Reservoir Simulation Symposium, Dallas, Texas Jun. 8-11, 1997, pp. 87-95.Applicant
- E. Farkas, Linearization Techniques of Reservoir Simulation Equations: Fully Implicit Cases, Richardson, Texas, Dec. 1998, vol. 3, No. 4, pp. 316-323.Applicant
- P. Benedeck, Capacitances of Planar Multiconductor Configuration on a Dielectric Substrate by a Mixed Order Finite-Element Method, IEEE1974.Applicant
- Fu, et al., Time Integration Procedures for a Cyclic Thermoviscoplasticity Model for Pb-Sn solder applications, IEEE 1996.Applicant
- P. J. Zwart, et al., “Space-Time Meshing for Two-Dimensional Moving Boundary Problems”, Proceedings of the Seventh International Meshing Roundtable, pp. 187-199, 1998.Applicant
- S. L. Ho, et al., “Generation and Rotation of 3-D Finite Element Mesh for Skewed Rotor Induction Motors Using Extrusion Technique”, IEEE Transactions on Magnetics, pp. 1266-1269, May 1999.Applicant
- Cuisiat, F., et al. “Petroleum Reservior Simulation Coupling Flow and Deformation,” SPE 50636, pp. 63-72, 1998.Applicant
- Economides, M., et al. “Petroleum Production Systems,” Prentice-Hall PTR, ISBN 0-13-658683-X, pp. 57-70, 1994.Applicant
- Forsyth, Peter. “A Control-Volume, Finite-Element Method for Local Mesh Refinement in Thermal Reservoir Simulation,” SPE 18415, pp. 561-566, pp. 91-96, 1990.Applicant
- Naji, H., et al. “A Fully Imlicit, Three-Dimensional , Two-Phase, Control-Volume Finite Element Model for the Simulation Naturally Fractured Reservoirs,” SPE 36279, pp. 1-13, 1996.Applicant
- Young, Larry C. “Rigorous Treatment of Distorted Grids in 3D,” SPE 51899, pp. 1-14, 1999.Applicant