
doi: 10.1137/0607066
This paper deals with a subclass of differential/algebraic equations which can be solved by backward differentiation methods if their index (determined by the structure of the system) does not exceed two. The authors extend the algorithm given by the first author [On algorithms for obtaining a maximum transversal, ACM Trans. Math. Software 7, 315-330 (1981)] to the determination of whether the index is one, two, or greater and prove it works mathematically.
backward differentiation methods, sparse matrices, Other matrix algorithms, matrix index, transversals, Nonlinear ordinary differential equations and systems, index of nilpotency, Numerical methods for initial value problems involving ordinary differential equations, differential/algebraic equations
backward differentiation methods, sparse matrices, Other matrix algorithms, matrix index, transversals, Nonlinear ordinary differential equations and systems, index of nilpotency, Numerical methods for initial value problems involving ordinary differential equations, differential/algebraic equations
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 35 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
