For good performance of every computer program, the good cache utilization is crucial. In numerical algebra libraries (such as BLAS or LAPACK) is good cache utilization achieved by explicit {\it loop restructuring} (mainly loop blocking), but it requires difficult cache behavior analysis. In this paper, we represent recursive implementation of some routines from numerical algebra library. This implementation leads to good cache utilization with no need to analyze cache behavior due to the "natural" partition of data.