Commit Graph

59 Commits

Author SHA1 Message Date
Stephen Mardson McQuay
cbc2d13e70 in progress 2011-03-03 00:01:46 -07:00
dbe981c24b added slave code 2011-03-02 23:51:43 -07:00
6e4d8c9505 joining code 2011-03-02 23:44:08 -07:00
639f732fce minor rename
--HG--
rename : bin/client.py => bin/master.py
2011-03-02 23:27:27 -07:00
Stephen Mardson McQuay
8b1670fdc0 added a server 2011-03-02 23:26:04 -07:00
Stephen Mardson McQuay
58d651969e added client 2011-03-02 23:15:14 -07:00
6ba2a2c624 minor: notes on profiling ... will delete 2011-02-21 16:48:21 -07:00
e8b15c14e2 used different exact func 2011-02-20 19:23:57 -07:00
Stephen Mardson McQuay
da95afb14d changed the 2D gmsh to work with new baker method 2011-02-20 19:23:01 -07:00
f03da63c4d messing around with the gmsh3D parser 2011-02-15 15:22:54 -07:00
6bc5908a9b renamed pattern test functions to be more meaningful 2011-02-15 11:12:56 -07:00
26196cd14b migrated test 2011-02-03 09:36:24 -07:00
33106985e1 working test, moving into a real test 2011-02-03 09:30:32 -07:00
Stephen Mardson McQuay
6751a22adb stubbed out a test for ordering 2011-02-02 18:40:23 -07:00
Stephen Mardson McQuay
2329479a64 minor 2011-02-02 11:52:53 -07:00
debfd4515a nothing 2011-01-28 12:21:26 -07:00
Stephen Mardson McQuay
2471f650bc updated some imports 2010-11-08 16:25:09 -07:00
8dff2747fd still proving out the 3D gmsh class, added correct funcs (3D) to the driver 2010-11-01 20:20:05 -06:00
8c0eb66e0b added a bunch of random point checks 2010-11-01 20:19:09 -06:00
Stephen Mardson McQuay
456ecf759f added one more 2D gmsh test case 2010-11-01 15:52:45 -06:00
Stephen Mardson McQuay
17b22c173d added a 3d gmsh test script 2010-11-01 15:51:40 -06:00
Stephen Mardson McQuay
699d0c1796 started testing the parametric varying of the solution scheme 2010-10-29 12:39:45 -06:00
7d32f4391f updated imports, and changed smberror to Exception 2010-10-23 17:06:11 -06:00
2eaec8268c created a distince gmsh 2D plugin 2010-10-23 16:57:44 -06:00
71761dd5a1 removed uneccesarry import from blender plotting file 2010-10-23 16:56:52 -06:00
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
91c8a661f4 working 2D gmsh parser 2010-10-22 09:20:59 -06:00
e4988fd150 implementing a 2D mesh object for gmsh files 2010-10-06 12:15:09 -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
3a1c13bcac implemented a function that will be used to provide a generic n-th order, nth-dimension error approximation function 2010-05-04 23:03:07 -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
Stephen Mardson McQuay
0a388ff1b5 trying to guarantee a containing simplex 2010-04-23 09:58:30 -06:00
Stephen Mardson McQuay
700ccc8c25 created a test for tesing the cubic interpolation 2010-03-20 20:09:46 -06:00
Stephen Mardson McQuay
1fc988428d putting together a simple test case so that I can test my quad/cubic interpolator 2010-03-20 17:10:02 -06:00
Stephen Mardson McQuay
993c901cec properly catching the LinAlgError. also, prepping to change the run_baker method (more generic) 2010-03-20 11:34:24 -06:00
Stephen Mardson McQuay
bd8f24d64f working on implementing the cubic interpolation. need to split that routine out of the run_baker method 2010-03-19 21:27:51 -06:00
Stephen Mardson McQuay
f089848a1b i think part of my problem (why i'm not always getting win), is that i do not guarantee that the simplex contains the point (especially with the random clounds; i think that the connectivity-based lookup is doing that fine 2010-03-18 23:50:40 -06:00
Stephen Mardson McQuay
9836fdcbfe added files. still not consistently getting better numbers 2010-03-18 23:32:24 -06:00
Stephen Mardson McQuay
b33159f8a9 working on getting baker to work in 3D. the code runs, but the numbers are odd. I suspect the rectangular grid, and am going to try a random cloud of points. 2010-03-18 23:18:59 -06:00
smcquay@cfdviz2
c5d8fff883 moved some files around to conform to python best practicies
--HG--
rename : lib/baker.py => lib/baker/__init__.py
rename : lib/tools.py => lib/baker/tools.py
rename : lib/grid.py => lib/grid/__init__.py
rename : lib/smcqdelaunay.py => lib/grid/smcqdelaunay.py
2010-03-08 13:05:42 -07:00
Stephen Mardson McQuay
9a1b8d14b2 finally added proper (in my opinon) exception handling to the grid's run_baker method. it should properly autocorrect, and switch the extra point lookup scheme to connectivity-based if solving the system of equations yields a singular solution 2010-03-05 08:58:07 -07:00
smcquay@cfdviz2
a25e6d03d1 partially implemented using new data structure in point lookup
I spoke with Dr. Gorrell about first trying to call the nearest-neighbor routine, releasing the trapped exception where the matrix ends up being singular, and trapping it in the grid object's run_baker, where I could then call the connectivity-based lookup routine. Those are my next steps, as well as starting to think about pushing the 3D front ahead this week.
2010-02-26 14:44:29 -07:00
Stephen Mardson McQuay
2792329eaa cleaned up the method (removed print statements) i'm ready to now add this method as an option to the mesh object 2010-02-21 20:52:51 -07:00
Stephen Mardson McQuay
a3d72ed200 wrote the method that returns grid objects based on connectivity
I'm going to hurry and clean up this method, but for now it is verbose, and uses sets. i'm going to just check it in for future reference
2010-02-21 20:42:32 -07:00
Stephen Mardson McQuay
0ef6897aee made a simplex class, going to move this into the face class to simplify 2010-02-21 19:02:45 -07:00
smcquay@cfdviz2
6c4c6d4cfe moved teh grid code into the grid class
by next friday i need to have implemented a way to select between normal kdtree point lookups, and nearest-neighbor lookups. Hopefully i'll have that done tonight.
2010-02-20 13:18:24 -07:00
Stephen Mardson McQuay
2cf9a0b574 mostly fixed a bug in my qdelaunay parsing. implemented a blender viewer ... mostly
the qdelaunay app doesn't alway display all faces for a point. lame. I worked around it by creating the point-> face relationships manually.

There is a max recursion something happeneing when I try to save so pickle. look into this.

I spent some time writing a visualizer for blender. 10 lines of code. simple stuff.

next steps would be to move the KDTree into the mesh object. GOOD LUCK (me)!!

--HG--
rename : bin/grid_driver.py => bin/grid_random.py
rename : bin/grid_driver.py => bin/grid_regular.py
2010-02-14 20:56:41 -07:00