Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

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

R M Eichler West1, G L Wilcox

  • 1Graduate Program in Neuroscience, Minnesota Supercomputer Institute, Minneapolis, USA.

Journal of Neuroscience Methods
|September 1, 1996
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Peripherally mediated opioid combination therapy in mouse and pig.

The journal of pain·2024
Same author

Overexpression of the aryl hydrocarbon receptor in frontal fibrosing alopecia and lichen planopilaris: a potential pathogenic role for dioxins?: an investigational study of 38 patients.

Journal of the European Academy of Dermatology and Venereology : JEADV·2020
Same author

Ligand requirements for involvement of PKCε in synergistic analgesic interactions between spinal μ and δ opioid receptors.

British journal of pharmacology·2014
Same author

Analgesic synergy between opioid and α2 -adrenoceptors.

British journal of pharmacology·2014
Same author

Nociceptive characteristics of tumor necrosis factor-alpha in naive and tumor-bearing mice.

Neuroscience·2005
Same author

Functional interactions between tumor and peripheral nerve in a model of cancer pain in the mouse.

Pain medicine (Malden, Mass.)·2004
Same journal

Pupil-DLC: an open-source deep learning pipeline for scalable, marker-less tracking of pupil dynamics across conscious and unconscious states.

Journal of neuroscience methods·2026
Same journal

Time as the language of Behavior: events, sequences, patterns and meanings.

Journal of neuroscience methods·2026
Same journal

Detection of cochlear microphonic for differential diagnosis between auditory neuropathy mice and noise-induced sensorineural hearing loss mice.

Journal of neuroscience methods·2026
Same journal

Assessment metrics for pain control in rats: A methodological commentary.

Journal of neuroscience methods·2026
Same journal

Infant EEG preprocessing pipelines: A capability framework and current gaps in practice.

Journal of neuroscience methods·2026
Same journal

Methods for measuring neural activity during voluntary wheel running.

Journal of neuroscience methods·2026
See all related articles

Minimizing matrix banding through compartmental reordering improves computational efficiency for branched neuron models. This method enhances solving complex systems like nerve equations and electrical networks.

Area of Science:

  • Computational neuroscience
  • Mathematical modeling
  • Biophysics

Background:

  • Solving matrix equations for branched structures like neurons is computationally intensive.
  • Existing methods, such as Hines' numbering, can be improved for efficiency.
  • Efficient numerical solutions are crucial for simulating complex biological and physical systems.

Purpose of the Study:

  • To present a novel compartmental reordering method for minimizing matrix banding in branched structures.
  • To demonstrate the efficiency of this renumbering technique on various branching models.
  • To provide a theoretical basis for estimating computational savings.

Main Methods:

  • Developing a reordering algorithm that minimizes matrix bandwidth.
  • Extending the compartmental numbering system based on Hines' method.

Related Experiment Videos

  • Applying the algorithm to general branching structures and analyzing theoretical savings.

    • Main Results:

    • The proposed reordering method effectively minimizes matrix banding.
    • Demonstrated efficient numbering for several general branching structures.
    • Provided a framework for estimating theoretical computational savings.

    Conclusions:

    • Compartmental reordering is an effective strategy to enhance the efficiency of solving matrix equations for branched systems.
    • The presented algorithm offers significant computational advantages for simulating neuron-like structures, electrical networks, and chemical reaction models.
    • This approach contributes to more efficient computational neuroscience and related fields.