|
|
2db4169bfa
|
major refactoring
--HG--
rename : lib/baker/__init__.py => interp/baker/__init__.py
rename : lib/grid/DD.py => interp/grid/DD.py
rename : lib/grid/DDD.py => interp/grid/DDD.py
rename : lib/grid/__init__.py => interp/grid/__init__.py
rename : lib/grid/qhull.py => interp/grid/qhull.py
rename : lib/grid/simplex.py => interp/grid/simplex.py
rename : lib/grid/smcqdelaunay.py => interp/grid/smcqdelaunay.py
rename : lib/baker/tools.py => interp/tools.py
|
2010-10-22 16:10:58 -06:00 |
|
|
|
df35cb174b
|
made a get_error function that is generic and functional. I'm still getting unsavory numbers for the cubic, 2-D case on my single test case. I will have to try out more refined grids, albeit the quadratic is consistently improving results for my case.
|
2010-05-05 23:03:12 -06:00 |
|
Stephen Mardson McQuay
|
c5adab295b
|
minor: but i'm on the verge of implementing the cubic error term for 3D
|
2010-04-30 16:23:29 -06:00 |
|
|
|
2cbd92e15b
|
wrapping up a night. there isn't enough consistent improvement to merit using this method. i must have a bug somewhere.
|
2010-04-29 23:29:35 -06:00 |
|
Stephen Mardson McQuay
|
3dcc10ea0e
|
working on the containing simplex problem. the get containing simplex function works, if the point is in the domain. I am trying to force the domain to contain the point (placing points along perimiter of the mesh). I am not doing that right, but have to run
--HG--
rename : bin/qhull-029.txt => data/qhull-029.txt
rename : bin/qhull-029.txt.gv => data/qhull-029.txt.gv
|
2010-04-24 18:26:44 -06:00 |
|
Stephen Mardson McQuay
|
cfcd1e15a2
|
working on the guarantee simplex routine. I have a test case to try it out against, and need to look at visiting neighbors of faces adjacent to points.
|
2010-04-23 16:29:31 -06:00 |
|
