✦ LIBER ✦

A Method to Compute Minimal Polynomials

✍ Scribed by Peskin, Barbara R,; Richman, David R.

Book ID: 118212474
Publisher: Society for Industrial and Applied Mathematics
Year: 1985
Weight: 1019 KB
Volume: 6
Category: Article
ISSN: 0196-5212
DOI: 10.1137/0606029

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A method of Samuelson and minimal polyno

A method of Samuelson and minimal polynomials

✍ Hsin Chu 📂 Article 📅 1968 🏛 Elsevier Science 🌐 English ⚖ 304 KB

Some polynomials that are hard to comput

Some polynomials that are hard to compute

✍ J.von zur Gathen; V. Strassen 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 441 KB

On the computation of minimal polynomial

On the computation of minimal polynomials

✍ David R. Richman 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 758 KB

Polynomial Eigenvalue Solutions to Minim

Polynomial Eigenvalue Solutions to Minimal Problems in Computer Vision

✍ Kukelova, Z.; Bujnak, M.; Pajdla, T. 📂 Article 📅 2012 🏛 IEEE 🌐 English ⚖ 515 KB

Using Schubert Basis to Compute with Mul

Using Schubert Basis to Compute with Multivariate Polynomials

✍ Axel Kohnert; Sébastien Veigneau 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 241 KB

Schubert polynomials are a linear basis of the ring of polynomials in x , . . . , x 1 n Ž with coefficients in y , . . . , y . We describe the multiplicative structure multiplica-1 n . tion by a single variable of this space. We also describe the structure of the ring as a free module of rank n! ov

A minimal residual method for linear pol

A minimal residual method for linear polynomials in unitary matrices

✍ M. Dana; Kh. D. Ikramov 📂 Article 📅 2006 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 242 KB