The alternating group explicit (AGE) method for singularly perturbed boundary value problems (Q1805235): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Q1182354 / rank | |||
Property / reviewed by | |||
Property / reviewed by: Dana Petcu / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Group explicit iterative methods for solving large linear systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4774844 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3207312 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The alternating group explicit (AGE) method on a transputer network / rank | |||
Normal rank |
Latest revision as of 12:21, 23 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The alternating group explicit (AGE) method for singularly perturbed boundary value problems |
scientific article |
Statements
The alternating group explicit (AGE) method for singularly perturbed boundary value problems (English)
0 references
27 September 1995
0 references
The paper presents a computational method for the solution of singularly perturbed boundary value problems, designed on the basis of the alternating group explicit (AGE) method. The AGE scheme, which is analogous to the alternate direction implicit method and was earlier developed for solving two-point boundary value problems, employs the fractional splitting strategy: it is applied alternately at each half time step. A convergence analysis of the method is given. A parallel implementation of the method is also discussed. The proposed AGE algorithm is well fitted for parallel computing since it is having some groups of independent tasks. The strategy of implementing this algorithm on parallel computers is domain decomposition. Some numerical examples are solved and the solution by this method can be compared with the exact solution by some suggestive plots.
0 references
singular perturbations
0 references
alternating group explicit method
0 references
alternate direction implicit method
0 references
fractional splitting strategy
0 references
convergence
0 references
parallel implementation
0 references
parallel computing
0 references
domain decomposition
0 references
numerical examples
0 references