𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Announcement: Sparse Approximate Solution of Linear

Book ID
114063346
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
31 KB
Volume
436
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Errata to β€œefficient approximate solutio
Errata to β€œefficient approximate solution of sparse linear systems” solution of
πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 29 KB

The following changes should be made to the above-mentioned article. ## β€’ Page 45, line 2: replace A = D(A) + A + + A-with A = -D(A) + A + + A-. β€’ Page 48, line 27: replace n' = (n27l'1) 1/w+l with n' = n 1'5. β€’ Page 48, line 30: replace O(n(~r + logn)) ~/~+1 with O(nl"5(lr + logn)). β€’ Page 51, l

Approximate inverse preconditioning in t
Approximate inverse preconditioning in the parallel solution of sparse eigenproblems
✍ Luca Bergamaschi; Giorgio Pini; Flavio Sartoretto πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 116 KB πŸ‘ 2 views

A preconditioned scheme for solving sparse symmetric eigenproblems is proposed. The solution strategy relies upon the DACG algorithm, which is a Preconditioned Conjugate Gradient algorithm for minimizing the Rayleigh Quotient. A comparison with the well established ARPACK code shows that when a smal