2016
DOI: 10.1016/j.amc.2015.11.091
|View full text |Cite
|
Sign up to set email alerts
|

Efficient index reduction algorithm for large scale systems of differential algebraic equations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
3
1
1

Relationship

3
2

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 32 publications
0
5
0
Order By: Relevance
“…The index reduction algorithm with dummy-states, described in Söderlind and Mattsson (1993), reduces the system to index one, so that it can be simulated with common solvers. Alternative methods to handle index reduction have been proposed in Qin et al (2016Qin et al ( , 2018. Simulation without index reduction is also possible, but less reliable.…”
Section: Index Reductionmentioning
confidence: 99%
“…The index reduction algorithm with dummy-states, described in Söderlind and Mattsson (1993), reduces the system to index one, so that it can be simulated with common solvers. Alternative methods to handle index reduction have been proposed in Qin et al (2016Qin et al ( , 2018. Simulation without index reduction is also possible, but less reliable.…”
Section: Index Reductionmentioning
confidence: 99%
“…All codes are written in Matlab 2016a under Windows 10 system and run on a personal computer with Intel(R) Core(TM) i5-3570 CPU @ 3.40 GHz, 4.00 GB RAM and 64-bit operating system. We do corresponding random trials for FPIA, extended signature matrix method (ESMM [14]), MPA and BPA with r = {10, 20, 40} and n = 800 : 200 : 2400, and calculate their constants in µ • n ν using the standard least-square method. The running times of these algorithms are shown in Figure 1, respectively; some ratios of the running times are given in Figure 2.…”
Section: Numerical Experimentationmentioning
confidence: 99%
“…They compute the fine BTF for system's numerical scheme via valid global offset vectors or the local offsets of each separated coarse block. Qin and Tang et al in [14] generalized the Σ method for large-scale DAE systems. In addition, there are other index reduction methods for different DAEs [15][16][17][18][19][20][21].…”
Section: Introductionmentioning
confidence: 99%
“…They compute the fine BTF for system's numerical scheme via valid global offset vectors or the local offsets of each separated coarse block. Qin and Tang et al in [13] generalized the Σ method for large-scale DAE systems. In addition, there are other index reduction methods for different DAEs [14][15][16][17][18][19][20].…”
Section: Introductionmentioning
confidence: 99%