A renumbering method to decrease matrix banding in equations describing branched neuron-like structures.

R M Eichler West; G L Wilcox

Home/Archive/PubMed

PubMed · 8884608

A renumbering method to decrease matrix banding in equations describing branched neuron-like structures.

R M Eichler West·G L Wilcox

View original source ↗Export metadata ↓

Abstract

The solution to matrix equations which describe branched neuron-like structures can be made more efficient by minimizing matrix banding. This can be accomplished through the reordering of the compartmental numbering system. The renumbering method presented here extends upon the numbering method of Hines ((1984) Int. J. Biomed. Comput., 15: 69-76). A demonstration of efficient numbering will be presented for several general cases of branching structures. Theoretical computational savings can be estimated for the above structures. An algorithm to renumber a matrix already in Hines form will be described. Branched nerve equations, electrical networks and chemical reaction models are examples of systems which can benefit from this application.

Explore related subjects

Models, Neurological Neurons Journal Article

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

R M Eichler West, G L Wilcox. 1996. A renumbering method to decrease matrix banding in equations describing branched neuron-like structures.. https://pubmed.ncbi.nlm.nih.gov/8884608/

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

PubMed2025

Balanced state of networks of winner-take-all units.

Irregularly timed action potentials, or spikes, are pervasively observed in the brain activity of awake mammals. However, the role of this temporal irregularity in neural computation is still not well understood. In canonical network models irregular spiking emerges via balanced, fluctuating input currents, leading to collective responses that track inputs linearly. How networks characterized by irregular spiking could support flexible nonlinear dynamics needed for general-purpose computation remains under ongoing debate. Here we characterize the dynamics of networks whose elementary unit is not a single neuron but a small group of neurons, with distinct tunings, that compete at each timestep via a winner-take-all (WTA) interaction. While WTA has long been proposed as an elementary functional motif in the brain and represents a powerful computational primitive, how large networks of such units behave has received less investigation. We show that these networks, like classic excitatory-inhibitory balanced networks, exhibit a chaotic fluctuation-driven regime characterized by sustained irregular activity resembling realistic cortical spiking, which we interpret as a multidimensional balance spread over several competing neural populations with different tunings. We develop a mean-field theory for the network, which shows how irregular spiking sustained by time-varying input fluctuations can support flexible nonlinear collective dynamics. Using the theory we predict and verify network regimes in which input fluctuations alone yield multistability, stable sequence generation, or complex heterogeneous firing rate dynamics-three core dynamical primitives thought to underlie memory-dependent neural computation-via consistent Poisson-like spiking produced through chaos. Thus, networks of WTA units support a chaotic fluctuation-driven regime characterized by irregular spiking that can power complex nonlinear collective dynamics. This represents a new model of brain activity capable of simultaneously reproducing realistic spike trains and diverse nonlinear firing rate patterns well posed for flexible computation, and which can be trained or fit to data.

Models, Neurological↗

PubMed1999

Computing with self-excitatory cliques: A model and an application to hyperacuity-scale computation in visual cortex.

We present a model of visual computation based on tightly inter-connected cliques of pyramidal cells. It leads to a formal theory of cell assemblies, a specific relationship between correlated firing patterns and abstract functionality, and a direct calculation relating estimates of cortical cell counts to orientation hyperacuity. Our network architecture is unique in that (1) it supports a mode of computation that is both reliable and efficient; (2) the current-spike relations are modeled as an analog dynamical system in which the requisite computations can take place on the time scale required for an early stage of visual processing; and (3) the dynamics are triggered by the spatiotemporal response of cortical cells. This final point could explain why moving stimuli improve vernier sensitivity.

Models, Neurological↗

PubMed1998

Neural feature abstraction from judgments of similarity.

The common neural network modeling practice of representing the elements of a task domain in terms of a set of features lacks justification if the features are derived through some form of ad hoc preabstraction. By examining a featural similarity model related to established multidimensional scaling techniques, a neural network is developed that generates features from similarity data and attaches weights to these features. The network performs a constrained search of a continuous solution space to determine the features and uses a previously developed regularization technique to minimize the number of features it derives. The network is demonstrated on artificial data, from which it recovers known features and weights, and on two real data sets involving the similarity of a set of geometric shapes and the abstract conceptual similarities of the 10 Arabic numerals. On the basis of these results, the relationship between the multidimensional scaling approach adopted by the network and an alternative additive clustering approach to feature extraction is discussed.

Models, Neurological↗