|
| void | coreneuron::scopmath::sparse::delete_item (Item *item) |
| |
| void | coreneuron::scopmath::sparse::linkitem (Item *item, Item *ii) |
| |
| void | coreneuron::scopmath::sparse::insert (SparseObj *so, Item *item) |
| |
| void | coreneuron::scopmath::sparse::increase_order (SparseObj *so, unsigned row) |
| |
| template<enabled_code code_to_enable = enabled_code::all> |
| Elm * | coreneuron::scopmath::sparse::getelm (SparseObj *so, unsigned row, unsigned col, Elm *new_elem) |
| | Return pointer to (row, col) element maintaining order in rows. More...
|
| |
| List * | coreneuron::scopmath::sparse::newlist () |
| | The following routines support the concept of a list. More...
|
| |
| void | coreneuron::scopmath::sparse::freelist (List *list) |
| |
| void | coreneuron::scopmath::sparse::check_assert (SparseObj *so) |
| |
| void | coreneuron::scopmath::sparse::re_link (SparseObj *so, unsigned i) |
| |
| void | coreneuron::scopmath::sparse::free_elm (SparseObj *so) |
| |
| void | coreneuron::scopmath::sparse::init_minorder (SparseObj *so) |
| |
| void | coreneuron::scopmath::sparse::reduce_order (SparseObj *so, unsigned row) |
| |
| void | coreneuron::scopmath::sparse::get_next_pivot (SparseObj *so, unsigned i) |
| |
| void | coreneuron::scopmath::sparse::initeqn (SparseObj *so, unsigned maxeqn) |
| |
| void | coreneuron::scopmath::sparse::spar_minorder (SparseObj *so) |
| | Minimum ordering algorithm to determine the order that the matrix should be solved. More...
|
| |
| void | coreneuron::scopmath::sparse::init_coef_list (SparseObj *so, int _iml) |
| |
| void | coreneuron::scopmath::sparse::subrow (SparseObj *so, Elm *pivot, Elm *rowsub, int _iml) |
| |
| void | coreneuron::scopmath::sparse::bksub (SparseObj *so, int _iml) |
| |
| int | coreneuron::scopmath::sparse::matsol (SparseObj *so, int _iml) |
| |
| template<typename SPFUN > |
| void | coreneuron::scopmath::sparse::create_coef_list (SparseObj *so, int n, SPFUN fun, _threadargsproto_) |
| |
| template<enabled_code code_to_enable = enabled_code::all> |
| double * | coreneuron::scopmath::sparse::thread_getelm (SparseObj *so, int row, int col, int _iml) |
| |
| template<typename SPFUN > |
| void * | coreneuron::nrn_cons_sparseobj (SPFUN fun, int n, Memb_list *ml, _threadargsproto_) |
| | sparse matrix dynamic allocation: create_coef_list makes a list for fast setup, does minimum ordering and ensures all elements needed are present. More...
|
| |
| template<typename F > |
| int | coreneuron::sparse_thread (SparseObj *so, int n, int *s, int *d, double *t, double dt, F fun, int linflag, _threadargsproto_) |
| | This is an experimental numerical method for SCoP-3 which integrates kinetic rate equations. More...
|
| |
| template<typename SPFUN > |
| int | coreneuron::_cvode_sparse_thread (void **vpr, int n, int *x, SPFUN fun, _threadargsproto_) |
| |
| void | coreneuron::_nrn_destroy_sparseobj_thread (SparseObj *so) |
| |