doi:10.1007/s40314-026-03654-zengJaiswal, AishwaryaKumar, SunilClavero, CarmeloA fast robust numerical method for singularly perturbed parabolic convection-diffusion systems with a non-smooth source termART-2026-148625This article develops and analyzes a fast robustly convergent numerical method to solve singularly perturbed parabolic convection-diffusion systems, which have a non-smooth source term. The diffusion parameters, which multiply the highest order derivative at each equation of the system, are allowed to be distinct and possibly of varying magnitudes. Then, in general, for sufficiently small values of the diffusion parameters, we observe overlapping boundary layer phenomenon in the exact solution of the continuous problem. Moreover, these boundary layers get accompanied with overlapping interior layers when there is a non-smooth source term in the problem. We establish a priori bounds on the solution and its derivatives, and also a decomposition of the solution into a smooth part, a boundary layer part and an interior layer part. To approximate the solution, we construct a fast numerical method, which uses an upwind finite difference scheme, defined on an appropriate Shishkin type mesh in space and the fractional implicit Euler method combined with the components-wise splitting approach, to discretize in time, on an evenly spaced time grid. This in turn implies that the approximation of the components of the numerical solution become decoupled, permitting us to handle only tridiagonal linear systems of order at each discrete time step. Further, due to overlapping boundary and interior layers the error analysis is challenging and requires the construction of novel barrier functions. It is proven that the proposed numerical method is uniformly convergent with first order accuracy in time and essentially first order in space. Numerical outcomes are presented in the form of tables alongside with a comparison of computational times for various test examples which corroborate in practice the theoretical results. The comparison distinctly illustrates the efficiency of our proposed algorithm.2026http://zaguan.unizar.es/record/17007310.1007/s40314-026-03654-zhttp://zaguan.unizar.es/record/170073oai:zaguan.unizar.es:170073info:eu-repo/grantAgreement/ES/DGA/E24-17Rinfo:eu-repo/grantAgreement/ES/MCINN/PID2022-136441NB-I00Computational & Applied Mathematics 45, 7 (2026), 267 [41 pp.]All rights reservedhttp://www.europeana.eu/rights/rr-f/info:eu-repo/semantics/embargoedAccess