✦ LIBER ✦

Modification of the algorithm for the matrix diagonalization related to the quantum-chemical calculations

✍ Scribed by Yu. F. Sigolaev; B. I. Ionin

Book ID: 111460787
Publisher: Springer
Year: 2010
Tongue: English
Weight: 109 KB
Volume: 80
Category: Article
ISSN: 1070-3632
DOI: 10.1134/s1070363210110265

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Quantum inverse scattering method and th

Quantum inverse scattering method and the diagonal-to-diagonal transfer matrix of vertex models

✍ T.T. Truong; K.D. Schotte 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 933 KB

On Algorithms For Permuting Large Entrie

On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix

✍ Duff, I. S.; Koster, J. 📂 Article 📅 2001 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 244 KB

On the convergence of row-modification a

On the convergence of row-modification algorithm for matrix projections

✍ Xiaomi Hu; Jürgen Hansohm; Linda Hoffmann; Ye Emma Zohner 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 232 KB

Fast algorithms for placing large entrie

Fast algorithms for placing large entries along the diagonal of a sparse matrix

✍ Vamsi Kundeti; Sanguthevar Rajasekaran 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 285 KB

a b s t r a c t Solving a sparse system of linear equations Ax = b is one of the most fundamental operations inside any circuit simulator. The equations/rows in the matrix A are often rearranged/permuted before factorization and applying direct or iterative methods to obtain the solution. Permuting

Modification of the algorithm for calcul

Modification of the algorithm for calculating the nucleolus of a centered game

✍ C. Šimelis 📂 Article 📅 1982 🏛 Springer 🌐 English ⚖ 280 KB

The NIPALS algorithm for the calculation

The NIPALS algorithm for the calculation of the principal components of a matrix

✍ B.G.M. Vandeginste; C. Sielhorst; M. Gerritsen 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 183 KB