✦ LIBER ✦

A separation theorem for nonsymmetric matrices

✍ Scribed by C.A Hall; T.A Porsching

Publisher: Elsevier Science
Year: 1968
Tongue: English
Weight: 143 KB
Volume: 23
Category: Article
ISSN: 0022-247X
DOI: 10.1016/0022-247x(68)90128-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new method for eigenvalues of nonsymme

A new method for eigenvalues of nonsymmetric matrices

✍ A.A. Shah 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 236 KB

Rayleigh quotient iteration fails for no

Rayleigh quotient iteration fails for nonsymmetric matrices

✍ Steve Batterson; John Smillie 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 177 KB

A Kharitonov-like theorem for interval p

A Kharitonov-like theorem for interval polynomial matrices

✍ H. Kokame; T. Mori 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 507 KB

A min–max theorem for complex symmetric

A min–max theorem for complex symmetric matrices

✍ Jeffrey Danciger 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 107 KB

Separation theorems for singular values

Separation theorems for singular values of matrices and their applications in multivariate analysis

✍ C.Radhakrishna Rao 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 691 KB

Breakdown-free version of ILU factorizat

Breakdown-free version of ILU factorization for nonsymmetric positive definite matrices

✍ A. Rafiei; F. Toutounian 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 422 KB

In this paper a new ILU factorization preconditioner for solving large sparse linear systems by iterative methods is presented. The factorization which is based on Abiorthogonalization process is well defined for a general positive definite matrix. Numerical experiments illustrating the performance