2020
DOI: 10.1155/2020/6671926
|View full text |Cite
|
Sign up to set email alerts
|

On Solving System of Linear Differential-Algebraic Equations Using Reduction Algorithm

Abstract: In this paper, we present a new reduction algorithm for solving system of linear differential-algebraic equations with power series coefficients. In the proposed algorithm, we transform the given system of differential-algebraic equations into another simple equivalent system using the elementary algebraic techniques. This algorithm would help to implement the manual calculations in commercial packages such as Mathematica, Maple, MATLAB, Singular, and Scilab. Maple implementation of the proposed algorithm is d… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 20 publications
0
2
0
Order By: Relevance
“…As a consequence, many numerical methods were developed to solve higher index DAEs such as range-Kutta [13,17], projected Taylor series methods [18], hybrid block algorithms [19], stabilization methods [20][21][22], augmented Lagrangian method [23], sequential regularization methods [24], and the differential transform method (DTM) [25,26]. For the solution of DAEs, one can also nd in the literature the power series method combined with the Adomian polynomials [27,28] and other methods [29][30][31][32][33]. A very popular approach to treat higher index DAEs is rst to reduce the index by di erentiating the constraints one or more times with respect to time to obtain an ordinary di erential system or an index-1 DAE.…”
Section: Introductionmentioning
confidence: 99%
“…As a consequence, many numerical methods were developed to solve higher index DAEs such as range-Kutta [13,17], projected Taylor series methods [18], hybrid block algorithms [19], stabilization methods [20][21][22], augmented Lagrangian method [23], sequential regularization methods [24], and the differential transform method (DTM) [25,26]. For the solution of DAEs, one can also nd in the literature the power series method combined with the Adomian polynomials [27,28] and other methods [29][30][31][32][33]. A very popular approach to treat higher index DAEs is rst to reduce the index by di erentiating the constraints one or more times with respect to time to obtain an ordinary di erential system or an index-1 DAE.…”
Section: Introductionmentioning
confidence: 99%
“…e reason is that these DAEs are in fact ill-posed problems in a certain sense and direct discretizations do not lead to satisfactory results in general [8][9][10][11]. ere are several methods in the literature for solving DAEs, which include Runge-Kutta methods [8,12], projected explicit and implicit Taylor series methods [13], hybrid block methods [14], variational methods [15], reduction methods [16,17], transformation methods [18], Adomian decomposition method [19], and the differential transform method [20]. One can find several techniques for solving DAEs of the form (1) [21][22][23][24][25][26][27][28].…”
Section: Introductionmentioning
confidence: 99%