Reducing the complexity order of the algorithms for magnetic field nonlinear problems

Author： Munteanu Irina Ciobotaru Caˇtaˇlin Ioan Daniel

ISSN： 0332-1649

Source： COMPEL: Int J for Computation and Maths. in Electrical and Electronic Eng., Vol.21, Iss.2, 2002-02, pp. : 286-295

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Complexity and algorithms for nonlinear optimization problems

By Hochbaum Dorit

Annals of Operations Research, Vol. 153, Iss. 1, 2007-09 ,pp. : 257-296

Springer Publishing Company

Access to resources Recommend Favorite

Streaming cache placement problems: complexity and algorithms

By Oliveira Carlos A.S. Pardalos Panos M. Prokopyev Oleg A. Resende Mauricio G.C.

International Journal of Computational Science and Engineering, Vol. 3, Iss. 3, 2008-04 ,pp. : 173-183

Inderscience Publishers

Access to resources Recommend Favorite

Reducing computational effort in field optimisation problems

By Sykulski J.K.

COMPEL: Int J for Computation and Maths. in Electrical and Electronic Eng., Vol. 23, Iss. 1, 2004-03 ,pp. : 159-172

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

COEVOLUTIONARY GENETIC ALGORITHMS FOR NONCONVEX NONLINEAR PROGRAMMING PROBLEMS: REVISED GENOCOP III

By Sakawa Masatoshi Yauchi Katsuhiro

Cybernetics and Systems, Vol. 29, Iss. 8, 1998-11 ,pp. : 885-899

Taylor & Francis Ltd

Access to resources Recommend Favorite

Newton and quasi-Newton algorithms for non-linear electromagnetic-thermal coupled problems

By Driesen Johan Hameyer Kay

COMPEL: Int J for Computation and Maths. in Electrical and Electronic Eng., Vol. 21, Iss. 1, 2002-01 ,pp. : 116-125

Emerald Group Publishing Ltd

Access to resources Recommend Favorite