✦ LIBER ✦

A note on the computation of the CP-rank

✍ Scribed by Abraham Berman; Uriel G. Rothblum

Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 114 KB
Volume: 419
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2006.04.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on upper bounds on the cp-rank

✍ Naomi Shaked-Monderer 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 130 KB

A Note on the Computation of Orbits.

✍ P. Herget 📂 Article 📅 1934 🏛 John Wiley and Sons 🌐 English ⚖ 117 KB 👁 2 views

A note on the computation of Markovian s

A note on the computation of Markovian systems

✍ N. Limnios 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 180 KB

In this paper we propose a new method for the numerical resolution of the Kolmogorov equations for continuous time Markov chains. The numerical treatment required is very simple as for the discrete time Markov chain. An accurate error analysis is derived by Shur's theorem.

A note on the computation of the incompl

A note on the computation of the incomplete beta function

✍ Phien Huynh Ngoc 📂 Article 📅 1990 🏛 Elsevier Science ⚖ 312 KB

A note on the distribution of the Wilcox

A note on the distribution of the Wilcoxon rank sum statistic

✍ Derek K. Chang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 388 KB

On the computation of the rank of block

On the computation of the rank of block bidiagonal Toeplitz matrices

✍ Dimitrios Triantafyllou; Marilena Mitrouli 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 526 KB

In the present paper we study the computation of the rank of a block bidiagonal Toeplitz (BBT) sequence of matrices. We propose matrix-based, numerical and symbolical, updating and direct methods, computing the rank of BBT matrices and comparing them with classical procedures. The methods deploy the