Commit Graph

17071 Commits

Author SHA1 Message Date
Bård Skaflestad
3f7c7a822c Add stub implementation of algorithm for splitting blocks.
Currently lacks the construction of block-internal connections but
  does at least build.

  Not tested.
2010-08-19 16:33:13 +00:00
Jostein R. Natvig
a9034efbe7 Four-space indentation. 2010-08-19 11:02:50 +00:00
Jostein R. Natvig
ceb2e48422 Add comment. 2010-08-19 10:52:10 +00:00
Jostein R. Natvig
2648e559d3 A depth-first graph traversal to find connected components of graph. 2010-08-19 10:46:58 +00:00
Bård Skaflestad
8845c8d8f8 Be more explicit on the significance of the start pointers for 1:nbin. 2010-08-18 19:16:14 +00:00
Bård Skaflestad
02678a7fbe Implicit int went the way of the dodo in 1999. Catch up to this fact. 2010-08-18 16:22:35 +00:00
Bård Skaflestad
4a5610ca80 Add MEX support for inverting cell-to-block mappings (i.e.,
partition vectors) to create block-to-cell mappings.
2010-08-18 15:04:33 +00:00
Bård Skaflestad
548c626329 Add MEX'ed edition of 'partitionUI'. The MEX function only
implements the first edition of the 'partitionUI' algorithm (i.e.,
  before afg added sub-grid support in r2349), but it is nevertheless
  a useful experiment and facilitates testing a C/C++ implementation
  of the MsMFE method.
2010-08-13 17:24:19 +00:00
Bård Skaflestad
6f01206f60 Add preliminary support for wells in 'mex_ip_simple'. This is
untested, so disable direct MEX building for the time being.
2010-08-11 18:31:01 +00:00
Bård Skaflestad
483be79c66 Add support for number of connections different from number of faces.
This is a precursor to supporting wells as faces.
2010-08-09 08:51:01 +00:00
Bård Skaflestad
9c52face20 Don't require build(er|system) to #define COMPILING_FOR_MATLAB in
order to compile this file.
2010-08-03 14:27:13 +00:00
Bård Skaflestad
f2bb893b61 Remove macro definition which is no longer needed. 2010-07-09 10:39:26 +00:00
Bård Skaflestad
714dfd0545 Add first fully functioning M-callable C implementation of the
'ip_simple' mimetic inner product.  Coincides with the results from
  'computeMimeticIP' to (roughly) the order of round-off on a
  non-trivial test case.

  The calling interface is

      BI = mex_ip_simple(G, rock)

  and some latitude has been extended towards multiple data types in
  the various G fields (e.g., G.cells.facePos may be an 'int32').

  Additional clean-up and optimisation is likely.
2010-07-08 23:28:33 +00:00
Bård Skaflestad
4c469918e1 Implement cell loop (tentatively named mim_ip_simple_all()) and a
MEX gateway for easy testing from M.  Builds with fairly strict
  warnings, but is not tested yet.
2010-07-04 21:44:04 +00:00
Bård Skaflestad
ac97aa8c23 Correct a few embarrasing matrix dimension errors (in the "linear
pressure" part).
2010-07-02 22:19:38 +00:00
Bård Skaflestad
da327ba410 Split mim_ip_simple() up into two co-operating procedures,
- mim_ip_span_nullspace()
        Constructs orthogonal basis for mimetic IP null space.
    - mim_ip_linpress_exact()
        Adds term to impose exactness for linear pressure fields.

  Re-implement mim_ip_simple() in terms of these procedures.
2010-06-29 21:18:23 +00:00
Bård Skaflestad
9e1bbb200b Allow builder to -Define expansion of MAT_SIZE_T . 2010-06-29 19:11:26 +00:00
Bård Skaflestad
f1474e0b96 Don't fall prey to refactoring errors. 2010-06-28 22:54:31 +00:00
Bård Skaflestad
11f6693970 For kicks and giggles, add an (untested) C+BLAS/LAPACK
implementation of the 'ip_simple' mimetic inner product.

  Suggested by: jrn.
2010-06-28 22:47:55 +00:00
Bård Skaflestad
4e814fb0a5 For kicks and giggles, add an (untested) C+BLAS/LAPACK
implementation of the 'ip_simple' mimetic inner product.

  Suggested by: jrn.
2010-06-28 22:47:55 +00:00
Jostein R. Natvig
a3c93003ee Initial checkin of cornerpoint processing code.
Current status
--------------
Given vectors ZCORN, COORD and ACTNUM as well as the Cartesian
dimensions these vectors implicitly refer to, the code is
currently capable of

 * Identify unique points along each pillar
 * Assign point numbers for each point specified in ZCORN
 * Compute face topology, i.e., the corners that define the geometry
   of the faces as well as the cells that are connected through the face.
 * Identify and compute intesections that occur in the processing of
   face topology.

What remains is

 * Handle the face geometry of boundary faces. (simple)
 * Compute point coordinates of the final point list.
 * Put all pieces together in a tidy manner.
2009-06-11 07:33:50 +00:00