Author:
Adm Mohammad,Garloff Jürgen,Titi Jihad,Elgayar Ali
Publisher
Springer International Publishing
Reference23 articles.
1. Benson, H.P.: Using concave envelopes to globally solve the nonlinear sum of ratios problem. J. Global Optim. 22, 343–364 (2002)
2. Berchtold, J., Bowyer, A.: Robust arithmetic for multivariate Bernstein-form polynomials. Comput. Aided Design 32, 681–689 (2000)
3. Busé, L., Goldman, R.: Division algorithms for Bernstein polynomials. Comput. Aided Geom. Design 25, 850–865 (2008)
4. Clauss, P., Chupaeva, I.Yu.: Application of symbolic approach to the Bernstein expansion for program analysis and optimization. In: Duesterwald, E. (ed.) Compiler Construction. Lecture Notes in Computer Science, vol. 2985, pp. 120–133. Springer, Berlin, Heidelberg (2004)
5. Clauss, P., Fernández, F.J., Garbervetsky, D., Verdoolaege, S.: Symbolic polynomial maximization over convex sets and its application to memory requirement estimation. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 17(8), 983–996 (2009)