Steepest Descent Method in the Wolfram Language and Mathematica System
Закрыть
Articolul precedent
Articolul urmator
620 10
Ultima descărcare din IBN:
2023-05-11 15:43
SM ISO690:2012
UNGUREANU, Valeriu. Steepest Descent Method in the Wolfram Language and Mathematica System. In: Proceedings IMCS-55: The Fifth Conference of Mathematical Society of the Republic of Moldova, 28 septembrie - 1 octombrie 2019, Chișinău. Chișinău, Republica Moldova: "VALINEX" SRL, 2019, pp. 335-338. ISBN 978-9975-68-378-4.
EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core
Proceedings IMCS-55 2019
Conferința "Conference of Mathematical Society of the Republic of Moldova"
Chișinău, Moldova, 28 septembrie - 1 octombrie 2019

Steepest Descent Method in the Wolfram Language and Mathematica System


Pag. 335-338

Ungureanu Valeriu
 
Moldova State University
 
 
Disponibil în IBN: 29 noiembrie 2019


Rezumat

The gradient method, known also as the steepest descent method, includes related algorithms with the same computing scheme based on a gradient concept. The illustrious French mathematician Augustin-Louis Cauchy proposed the method in 1847, much more before the appearing of modern computers. The method is very simple and may be successfully used for computing local minima, generally in combination with other methods as Newton’s method. The Wolfram Language and Mathematica system are ideal tools for expositions and experiments.

Cuvinte-cheie
optimization methods, method of steepest descent, the Wolfram language, Mathematica system