𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Estimates of the trace of the inverse of a symmetric matrix using the modified Chebyshev algorithm

✍ Scribed by Gérard Meurant

Publisher
Springer US
Year
2008
Tongue
English
Weight
264 KB
Volume
51
Category
Article
ISSN
1017-1398

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing entries of the inverse of a sp
Computing entries of the inverse of a sparse matrix using the FIND algorithm
✍ S. Li; S. Ahmed; G. Klimeck; E. Darve 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 538 KB

An accurate and efficient algorithm, called fast inverse using nested dissection (FIND), for computing non-equilibrium Green's functions (NEGF) for nanoscale transistors has been developed and applied in the simulation of a novel dual-gate metal-oxide-semiconductor field-effect transistor (MOSFET) d

Approximating the inverse of a symmetric
Approximating the inverse of a symmetric positive definite matrix
✍ Gordon Simons; Yi-Ching Yao 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 405 KB

It is shown for an n x n symmetric positive definite matrix T = (t, j) with negative offdiagonal elements, positive row sums and satisfying certain bounding conditions that its inverse is well approximated, unifornaly to order l/n 2, by a matrix S = (s,,,

Estimating the extremal eigenvalues of a
Estimating the extremal eigenvalues of a symmetric matrix
✍ V. Pan 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 364 KB

Almtraet--Lower and upper bounds on the absolute values of the eigenvalues of an n x n real symmetric matrix A are given by (trace A ,,)t/m for both negative and positive even m. (The bounds are within a factor of 2 from the eigenvalues already for m > log 2 n.) We present algorithms for computing t