Home | Trees | Indices | Help |
|
---|
|
User utilities.
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|
|||
all | |||
predicate_op | |||
putmask | |||
shape | |||
complexfloating | |||
DomainType | |||
float32 | |||
float96 | |||
complex_ | |||
ones | |||
integer | |||
API = API_class()
|
|||
targetLangs =
|
|||
API_class | |||
argmax | |||
sign | |||
Macheps | |||
Continuous = Continuous Domain
|
|||
null_predicate = null_predicate_class(None)
|
|||
complex64 | |||
atleast_1d | |||
Discrete = Discrete Domain
|
|||
float_ | |||
less_equal | |||
float | |||
log | |||
complex128 | |||
int_ | |||
complex192 | |||
int0 | |||
int8 | |||
double | |||
finfo | |||
spy | |||
clip | |||
int | |||
logical_or | |||
deepcopy | |||
floating | |||
any | |||
null_predicate_class | |||
sqrt | |||
complex | |||
LargestInt32 = 2147483647
|
|||
fit_function | |||
int16 | |||
mat | |||
npy | |||
types | |||
int64 | |||
exp | |||
Inf = inf
|
|||
NaN = nan
|
|||
isfinite = <ufunc 'isfinite'>
|
|||
less = <ufunc 'less'>
|
|||
greater = <ufunc 'greater'>
|
|||
_classes =
|
|||
_functions =
|
|||
_mappings =
|
|||
rout = redirc.Redirector(redirc.STDOUT)
|
|||
rerr = redirc.Redirector(redirc.STDERR)
|
|||
_implicitSolveMethods =
|
|||
_1DimplicitSolveMethods =
|
|||
_all_complex =
|
|||
_all_float =
|
|||
_all_int =
|
|||
_all_numpy_complex =
|
|||
_all_numpy_float =
|
|||
_all_numpy_int =
|
|||
_complex_types =
|
|||
_float_types =
|
|||
_int_types =
|
|||
_num_equivtype =
|
|||
_num_maxmin =
|
|||
_num_name2equivtypes =
|
|||
_num_name2type =
|
|||
_num_type2name =
|
|||
_num_types =
|
|||
_pytypefromtype =
|
|||
_real_types =
|
|||
_seq_types =
|
|
Builds an implicit function representation of an N-dimensional curve specified by (N-1) equations. Thus argument f is a function of 1 variable. In the case of the 'fsolve' method, f may have dimension up to N-1. Available solution methods are: newton, bisect, steffensen, fsolve. All methods utilize SciPy's Minpack wrappers to Fortran codes. Steffenson uses Aitken's Delta-squared convergence acceleration. fsolve uses Minpack's hybrd and hybrj algorithms. Standalone option (True by default) returns regular function. If False, an additional argument is added, so as to be compatible as a method definition. |
Find index of the closest N-dimensional Point in the target N by M array or Pointset. Uses norm of order given by the Point or Pointset, unless they are inconsistent, in which case an exception is raised, or unless they are both arrays, in which case 2-norm is assumed. With the in_order boolean option (default True), the function will attempt to determine the local "direction" of the values and return an insertion index that will preserve this ordering. This option is incompatible with the tol option (see below). If the optional tolerance, tol, is given, then an index is returned only if the closest distance is within the tolerance. Otherwise, a ValueError is raised. This option is incompatible with the in_order option. |
Find the set of elements in (1D) input_array that are closest to elements in target_array. Record the indices of the elements in target_array that are within tolerance, tol, of their closest match. Also record the indices of the elements in target_array that are outside tolerance, tol, of their match. For example, given an array of observations with irregular observation times along with an array of times of interest, this routine can be used to find those observations that are closest to the times of interest that are within a given time tolerance. NOTE: input_array must be sorted! The array, target_array, does not have to be sorted. Inputs: input_array: a sorted float64 array target_array: a float64 array tol: a tolerance Returns: closest_indices: the array of indices of elements in input_array that are closest to elements in target_array Author: Gerry Wiener, 2004 Version 1.0 |
Returns the index into the 1D array x corresponding to the element of x that is either equal to v or the nearest to v. x is assumed to contain unique elements. if v is outside the range of values in x then the index of the smallest or largest element of x is returned. If next_largest == 1 then the nearest element taken is the next largest, otherwise if next_largest == 0 then the next smallest is taken. The optional argument indices speeds up multiple calls to this function if you have pre-calculated indices=argsort(x). |
Time-order event data dictionary items. Returns time-ordered list of (eventname, time) tuples. If 'evnames' argument included, this restricts output to only the named events. The 'nonames' flag (default False) forces routine to return only the event times, with no associated event names. The 'bytime' flag (default False) only works with nonames=False and returns the list in (time, eventname) order. |
Return function wrapping Generator argument gen's RHS function, but restricting input and output dimensions to those specified by x0_names. All other variable values will be given by those in xdict_base. In case of overflow or ValueError during a call to the wrapped function, an overflow penalty will be used for the returned values (default 1e4). if use_gen_params flag is set (default False) then: Return function has signature Rhs_wrap(x,t) and takes an array or list of x state variable values and scalar t, returning an array type of length len(x). The Generator's current param values (at call time) will be used. else: Return function has signature Rhs_wrap(x,t,pdict) and takes an array or list of x state variable values, scalar t, and a dictionary of parameters for the Generator, returning an array type of length len(x). NB: xdict_base will be copied as it will be updated in the wrapped function. |
Return function wrapping Generator argument gen's Jacobian function, but restricting input and output dimensions to those specified by x0_names. All other variable values will be given by those in xdict_base. In case of overflow or ValueError during a call to the wrapped function, an overflow penalty will be used for the returned values (default 1e4). if use_gen_params flag is set (default False) then: Return function Jac_wrap(x,t) takes an array or list of x variable values and scalar t, returning a 2D array type of size len(x) by len(x). The Generator's current param values (at call time) will be used. else: Return function Jac_wrap(x,t,pdict) takes an array or list of x variable values, scalar t, and a dictionary of parameters for the Generator, returning a 2D array type of size len(x) by len(x). NB: xdict_base will be copied as it will be updated in the wrapped function. |
Print an increasing number of dashes up to given width, reflecting i / total fraction of progress. Prints and refreshes on one line. |
Store PyDSTool objects to file. Argument should be a tuple or list, but if a singleton non-sequence object X is given then it will be saved as a list [ X ]. Some PyDSTool objects will not save using this function, and will complain about attributes that do not have definitions in __main__. |
Retrieve PyDSTool objects from file. Returns list of objects unless namelist option is given as a singleton string name. Also, if only one object X was stored, it will be returned as [X], and thus you will have to index the returned list with 0 to get X itself. Optional namelist argument selects objects to return by name, provided that the objects have name fields (otherwise they are ignored). If namelist is a single string name then a single object is returned. |
Find intersection of two lists, sequences, etc. Returns a list that includes repetitions if they occur in the inputs. |
Find union of two lists, sequences, etc. Returns a list that includes repetitions if they occur in the input lists. |
Find remainder of two lists, sequences, etc., after intersection. Returns a list that includes repetitions if they occur in the inputs. |
Zip arrays of field names and values into a dictionary. For instance, to use in Generator initialization arguments. Deprecated as of v0.89. |
Internal utility that makes the goofy destination directory string so that PyDSTool can find where the distutils fortran/gcc compilers put things. If your temp directory turns out to be different to the one created here, contact us on sourceforge.net, but in the meantime you can override destdir with whatever directory name you find that is being used. |
|
_functions
|
_all_complex
|
_all_float
|
_all_int
|
_all_numpy_complex
|
_all_numpy_float
|
_all_numpy_int
|
_complex_types
|
_num_equivtype
|
_num_maxmin
|
_num_name2equivtypes
|
_num_name2type
|
_num_type2name
|
_num_types
|
_pytypefromtype
|
_real_types
|
_seq_types
|
Home | Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Sun Dec 2 23:44:19 2012 | http://epydoc.sourceforge.net |