Computational Mathematics |
|
 |
2003, The Second Special Issue
I.A. Blatov, L.M. Isaeva
The wide range of literary sources is dedicated to algorithms of construction of mobile adaptive grids automatically fine-tuned to features of the solution of a problem [1]. However; to our knowledge; in the literature there are no rigorous mathematical proofs of convergence of such algorithms to limiting splittings; on which one the estimation of error at a given number of clusters would be optimum or close to optimum. In the present study the rigorous mathematical proofs of convergence of algorithm of adaptation for modelling singular perturbed problem are given. And outcomes numerical experiment verifying idealized conclusions.