Decomposition method
Decomposition method is a generic term for solutions of various problems and design of algorithms in which the basic idea is to decompose the problem into subproblems. The term may specifically refer to:
- Decomposition method in large-scale optimization [1]
- Decomposition method (constraint satisfaction) in constraint satisfaction
- Decomposition method (multidisciplinary design optimization) in multidisciplinary design optimization
- Adomian decomposition method, a non-numerical method for solving nonlinear differential equations
- Domain decomposition methods in mathematics, numerical analysis, and numerical partial differential equations
- Cholesky decomposition method
- Decomposition method in queueing network analysis
See also
This disambiguation page lists articles associated with the title Decomposition method.
If an internal link led you here, you may wish to change the link to point directly to the intended article.
If an internal link led you here, you may wish to change the link to point directly to the intended article.
- ^ J. -Y. Li, Z. -H. Zhan, K. C. Tan and J. Zhang, "Dual Differential Grouping: A More General Decomposition Method for Large-Scale Optimization," in IEEE Transactions on Cybernetics, vol. 53, no. 6, pp. 3624-3638, June 2023, doi: 10.1109/TCYB.2022.3158391.