✦ LIBER ✦

A modification to a decomposition algorithm of Gordon and Srikanthan

✍ Scribed by Hwang, F.K.

Book ID: 119772714
Publisher: IEEE
Year: 1997
Tongue: English
Weight: 33 KB
Volume: 46
Category: Article
ISSN: 0018-9340
DOI: 10.1109/12.609284

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Modification of Krawczyk’s Algorithm

✍ Wolfe, M. A. 📂 Article 📅 1980 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 400 KB

A Parallel Grid Modification and Domain

A Parallel Grid Modification and Domain Decomposition Algorithm for Local Phenomena Capturing and Load Balancing

✍ Daoqi Yang 📂 Article 📅 1997 🏛 Springer US 🌐 English ⚖ 636 KB

A Modification of Lee's Path Connection

A Modification of Lee's Path Connection Algorithm

✍ Akers, Sheldon B. 📂 Article 📅 1967 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 375 KB

Analysis of a Quadratic Programming Deco

Analysis of a Quadratic Programming Decomposition Algorithm

✍ Bencteux, G.; Cancés, E.; Hager, W. W.; Bris, C. Le 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 316 KB

A decomposition algorithm applied to pla

A decomposition algorithm applied to planning the interdiction of stochastic networks

✍ Harald Held; Raymond Hemmecke; David L. Woodruff 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 99 KB

A space-saving modification of Davidson'

A space-saving modification of Davidson's eigenvector algorithm

✍ Johan H. van Lenthe; Peter Pulay 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 522 KB

A modification of Davidson's eigenvalue algorithm, based on the conjugate gradient method, is described. This method needs storage only for a few vectors (five to seven, depending on the implementation), making it practical for very large problems where disk storage is the limiting factor, without t