Computational decomposition and composition technique for approximate solution of nonstationary problems
<|reference_start|>Computational decomposition and composition technique for approximate solution of nonstationary problems: Stable computational algorithms for the approximate solution of the Cauchy problem for nonstationary problems are based on implicit time approximations. Computational costs for boundary value problems for systems of coupled multidimensional equations can be reduced by additive decomposition of the problem operator(s) and composition of the approximate solution using particular explicit-implicit time approximations. Such a technique is currently applied in conditions where the decomposition step is uncomplicated. A general approach is proposed to construct decomposition-composition algorithms for evolution equations in finite-dimensional Hilbert spaces. It is based on two main variants of the decomposition of the unit operator in the corresponding spaces at the decomposition stage and the application of additive operator-difference schemes at the composition stage. The general results are illustrated on the boundary value problem for a second-order parabolic equation by constructing standard splitting schemes on spatial variables and region-additive schemes (domain decomposition schemes).<|reference_end|>
@article{vabishchevich2024computational,
    title={Computational decomposition and composition technique for approximate
  solution of nonstationary problems},
    author={P.N. Vabishchevich},
    journal={arXiv preprint arXiv:2403.18472},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.18472},
    primaryClass={math.NA cs.NA}
}