Numerical integration methods exploiting the characteristics of neuronal equation systems were investigated. The main observations was a high stiffness and a quasi-linearity of the system. The latter allowed for decomposition into two smaller systems by using a block diagonal Jacobian approximation. The popular backwards differentiation formulas methods (BDF) showed performance degradation for this during first experiments. Linearly implicit peer methods (PeerLI), a new class of methods, did not show this degradation. Parameters for PeerLI were optimized by experimental means and then compared in performance to BDF. Models were simulated in both Matlab and NEURON, a neuron modelling package. For small models PeerLI was competitive with BDF, especially with a block diagonal Jacobian. In NEURON the performance of the block diagonal Jacobian did no longer degrade for BDF, but instead showed degradation for PeerLI, especially for large models. With full Jacobian PeerLI was competitive with BDF, but with block diagonal Jacobian an increase of ca.50% was seen in simulation time. Overall PeerLI methods were competitive for certain problems, but did not give the desired performance gain for block diagonal Jacobian for large problems. There is, however, still a lot of room for improvement, since parameters were only determined experimentally and tuned to small problems. / Undersökningen gäller numeriska integrationsmetoder som utnyttjar egenskaper hos de ekvationer som beskriver neuronsystem, huvudsakligen utpräglad styvhet och kvasi-linjaritet. Den senare tillåter uppdelning i två mindre system med block-diagonal Jacobian-approximation. De populära bakåtderiveringsmetoderna (BDF) påverkades negativt av detta i de inledande experimenten. Linjärt implicita peer metoder (PeerLI), en ny metodklass, påverkades inte. Parametrarna i PeerLI optimerades experimentellt och metoderna jämfördes sedan med BDF. Modeller simulerades både i Matlab och neuron-modelleringsprogrammet NEURON. För små system var BDF och PeerLI likvärdiga, särskilt med block-diagonal Jacobian. I NEURON försämrades inte BDF av block-diagonal Jacobian, utan i stället PeerLI, särskilt för större modeller. Med full Jacobian var PeerLI och BDF lika bra, men med block-diagonal Jacobian ökade tiden med 50%. översiktligt var PeerLI likvärdig för vissa problem men gav inte önskvärd uppsnabbning för block-diagonal Jacobian för stora system. Men förbättringsmöjligheterna är många eftersom parameterinställningen gjordes experimentellt för små modeller.
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:kth-124145 |
| Date | January 2013 |
| Creators | The, Matthew |
| Publisher | KTH, Numerisk analys, NA |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Student thesis, info:eu-repo/semantics/bachelorThesis, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | TRITA-MAT-E ; 2013:33 |
Page generated in 0.0019 seconds