✦ LIBER ✦

An algorithm for constructing doubly stochastic matrices for the inverse eigenvalue problem

✍ Scribed by Mourad, Bassam; Abbas, Hassan; Mourad, Ayman; Ghaddar, Ahmad; Kaddoura, Issam

Book ID: 121259471
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 415 KB
Volume: 439
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2013.04.023

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The inverse eigenvalue problem for symme

The inverse eigenvalue problem for symmetric doubly stochastic matrices

✍ Suk-Geun Hwang; Sung-Soo Pyo 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 173 KB

For a positive integer n and for a real number s, let s n denote the set of all n × n real matrices whose rows and columns have sum s. In this note, by an explicit constructive method, we prove the following. (i) Given any real n-tuple = (λ 1 , λ 2 , . . . , λ n ) T , there exists a symmetric matri

An inverse problem for symmetric doubly

An inverse problem for symmetric doubly stochastic matrices

✍ Mourad, Bassam 📂 Article 📅 2003 🏛 Institute of Physics 🌐 English ⚖ 130 KB

A note on the inverse eigenvalue problem

A note on the inverse eigenvalue problem for symmetric doubly stochastic matrices

✍ Maozhong Fang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 84 KB

Extremal inverse eigenvalue problem for

Extremal inverse eigenvalue problem for symmetric doubly arrow matrices

✍ Liu, Zhibing; Wang, Kanmin; Xu, Chengfeng 📂 Article 📅 2013 🏛 Springer-Verlag 🌐 English ⚖ 537 KB

Comment on “A note on the inverse eigenv

Comment on “A note on the inverse eigenvalue problem for symmetric doubly stochastic matrices”

✍ Xu, Wei-Ru; Lei, Ying-Jie; Gu, Xian-Ming; Lu, Yong; Niu, Yan-Ru 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 192 KB

Methods for constructing distance matric

Methods for constructing distance matrices and the inverse eigenvalue problem

✍ Thomas L. Hayden; Robert Reams; James Wells 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 143 KB

Let h 1 P R kÂk and h 2 P R lÂl be two distance matrices. We provide necessary conditions on P R kÂl in order that be a distance matrix. We then show that it is always possible to border an n Â n distance matrix, with certain scalar multiples of its Perron eigenvector, to construct an n 1 Â n 1 dis