✦ LIBER ✦

On the Complexity of Approximating Extremal Determinants in Matrices

✍ Scribed by L. Khachiyan

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 525 KB
Volume: 11
Category: Article
ISSN: 0885-064X
DOI: 10.1006/jcom.1995.1005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On extreme matrices and extreme vectors

On extreme matrices and extreme vectors of cones in Rn

✍ Richard C. O'Brien 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 126 KB

Extremal problems on the set of nonnegat

Extremal problems on the set of nonnegative definite matrices

✍ Alexander Shapiro 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 579 KB

On the extremal points of a class of pol

On the extremal points of a class of polytopes of matrices

✍ Ahmad Muchlis 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 838 KB

On an extremal problem in the theory of

On an extremal problem in the theory of rational approximation

✍ D Khavinson; D Luecking 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 209 KB

On the characterization of the extremal

On the characterization of the extremal points of the unit sphere of matrices

✍ K. Ziętak 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 857 KB

An algorithm for approximating the singu

An algorithm for approximating the singular triplets of complex symmetric matrices

✍ V. Simoncini; E. Sjöström 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 172 KB 👁 2 views

We present an algorithm for the approximation of the dominant singular values and corresponding right and left singular vectors of a complex symmetric matrix. The method is based on two short-term recurrences first proposed by Saunders, Simon and Yip for a non-Hermitian linear system solver. With s