Changeset 1653

Timestamp:

Jul 28, 2005, 3:15:48 PM (18 years ago)

Author:

ole

Message:

Comments

File:

• inundation/ga/storm_surge/pyvolution/least_squares.py (modified) (4 diffs)

inundation/ga/storm_surge/pyvolution/least_squares.py

@@ -394 +394 @@
         """
 
+
+        #FIXME (Ole): Check that this function is memeory efficient.
+        #6 million datapoints and 300000 basis functions
+        #causes out-of-memory situation
+        #First thing to check is whether there is room for self.A and self.AtA
+        #
+        #Maybe we need some sort of blocking
+
         from quad import build_quadtree
         from util import ensure_numeric
@@ -445 +453 @@
         #Remove points falling outside mesh boundary
         #This reduced one example from 1356 seconds to 825 seconds
-        #And more could be had by writing util.inside_polygon in C
         if precrop is True:
             from Numeric import take
@@ -772 +779 @@
 
         Pre Condition:
-          self.A, self.At and self.B have been initialised
+          self.A, self.AtA and self.B have been initialised
 
         Inputs:
@@ -805 +812 @@
 
 
-        return conjugate_gradient(self.B, Atz, Atz,imax=2*len(Atz) )
+        return conjugate_gradient(self.B, Atz, Atz, imax=2*len(Atz) )
         #FIXME: Should we store the result here for later use? (ON)