Commit Graph

14710 Commits

Author SHA1 Message Date
Atgeirr Flø Rasmussen
877ede21eb Added copyright block to all source code files. 2010-10-12 07:25:46 +00:00
Bård Skaflestad
0bf40b266d Add local definition of MAT_SIZE_T, contingent upon preprocessor
symbol 'MATLAB_MEX_FILE' that is automatically defined by MATLAB's
  MEX function.

  Add declarations for factorisation, lin-sys solution, and matrix
  inversion for (symmetric) positive definite full matrices in full
  and packed formats.  Will be used in the coarse-system assembly
  process.
2010-09-02 16:25:29 +00:00
Bård Skaflestad
8dc4adbe51 Move solvers/common solvers/euler and solvers/mimetic to dune-porsol 2010-08-23 09:23:09 +00:00
Bård Skaflestad
2bced196f6 Move solvers/common solvers/euler and solvers/mimetic to dune-porsol 2010-08-23 09:23:09 +00:00
Bård Skaflestad
f4e9a3ed2f Initial implementation of hybrid system infrastructure. Actual
assembly and system solve not currently implemented.  This is untested.
2010-08-03 17:01:33 +00:00
Bård Skaflestad
4cb92b1e16 The LAPACK and BLAS operators do not modify their (char*)
parameters.  Declare these operators as taking (const char*)s.
2010-07-03 11:07:56 +00:00
Bård Skaflestad
a586f5040f Appease the -pedantic -ansi gods. 2010-06-29 15:32:03 +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
0e306b45ef 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