✦ LIBER ✦

On a new method for sparse matrix updating in unconstrained minimization

✍ Scribed by Angelo Lucia; Leroy F. Stutzman

Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 310 KB
Volume: 5
Category: Article
ISSN: 0098-1354
DOI: 10.1016/0098-1354(81)80007-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new conic method for unconstrained min

A new conic method for unconstrained minimization

✍ A Bacopoulos; C.A Botsaris 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 768 KB

A class of methods for unconstrained min

A class of methods for unconstrained minimization based on stable numerical integration techniques

✍ C.A Botsaris 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 1000 KB

A new approach for sparse matrix vector

A new approach for sparse matrix vector product on NVIDIA GPUs

✍ F. Vázquez; J. J. Fernández; E. M. Garzón 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 315 KB

On a one-dimensional search procedure in

On a one-dimensional search procedure in methods of unconstrained minimization of a function of several variables

✍ Yu.E. Nesterov 📂 Article 📅 1982 🏛 Elsevier Science ⚖ 422 KB

A new technique to generate a sparse mat

A new technique to generate a sparse matrix using the method of moments for electromagnetic scattering problems

✍ Sadasiva M. Rao; Griffin K. Gothard 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB 👁 3 views

the method of finite difference in a following paper. The results are useful in susceptibility or radiated emission tests and transmission line theory.

A network flow algorithm to minimize bea

A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy

✍ Ravindra K. Ahuja; Horst W. Hamacher 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 108 KB 👁 1 views