这在 fork-join 问题实现中很常见，因为递归分解问题的过程将会创建大量的新 Problem 对象。

This is typical of fork-join problem implementations because the process of recursively dividing the problem will create a potentially large number of new Problem objects.

youdao

基于区域递归分解算法是一种有效的四边形网格生成算法，能较好地运用于复杂的单连通和多连通图形区域，自动化程度高。

This paper presents an efficient algorithm for creating automatic quadrilateral mesh based on a recursive decomposition domain of quadrilateral elements.

youdao

递归的系统分解和从抽象到具体的转换。

Recursive system decomposition and transformation from the abstract to the concrete.

youdao

I have used divide and conquer, as we seen before, to recursively break it into smaller problems. But the smaller problem of fib of 4 and the smaller problem of fib of 3 overlap with each other.

正如我们之前看到的，我已经进行了划分,并且递归性的把它分解为更小的问题,但是fib的简化问题,和fib的简化问题会相互重叠。

麻省理工公开课 - 计算机科学及编程导论课程节选