𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Errata to “efficient approximate solution of sparse linear systems” solution of

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
29 KB
Volume
38
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

✦ Synopsis

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, line 24: replace O(n/(n') 2) with O((n/n')2). • Page 54, line 5: replace ~-~ with Tj.

📜 SIMILAR VOLUMES

Efficient solution of sparse sets of des
Efficient solution of sparse sets of design equations
✍ M.A. Stadtherr; W.A. Gifford; L.E. Scriven 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 946 KB

A new algorithm is described which can help the engineer find efficient strategies for solving sets of equations of the sorts that arise in process design. The algorithm systematically exploits small subsets of equations that can be solved directly because they are linear in certain variables or can

Solution of finite-horizon multivariate
Solution of finite-horizon multivariate linear rational expectations models and sparse linear systems
✍ Michael Binder; Hashem Pesaran 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 179 KB

This paper presents e$cient methods for the solution of xnite-horizon multivariate linear rational expectations (MLRE) models, linking the solution of such models to the problem of solving sparse linear equation systems with a block-tridiagonal coe$cient matrix structure. Two numerical schemes for t

Processor Efficient Parallel Solution of
Processor Efficient Parallel Solution of Linear Systems of Equations
✍ Gilles Villard 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 65 KB

We present a deterministic parallel algorithm that solves a n-dimensional system Ax s b of linear equations over an ordered field or over a subfield of the complex Ž 2 . Ž Ä Ž . 2 numbers. This algorithm uses O log n parallel time and O max M n , n Ž . 4 . Ž . log log n rlog n arithmetic processors