✦ LIBER ✦

A series of identities for the coefficients of inverse matrices on a Hamming scheme

✍ Scribed by Miwako Mishima; Masakazu Jimbo

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 213 KB
Volume: 156
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00056-3

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, a series of identities concerned with inverse matrices of a linear combination of association matrices on Hamming schemes is given, which is useful in the field of statistical design of experiments.

📜 SIMILAR VOLUMES

A note on a certain inverse pair of mult

A note on a certain inverse pair of multiple series identities

✍ R.K. Raina; H.M. Srivastava 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 290 KB

On the comparative magnitude of gaussian

On the comparative magnitude of gaussian growth coefficients for mutually inverse matrices

✍ Kh.D. Ikramov 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 218 KB

Inclusions and Identities for the Moore-

Inclusions and Identities for the Moore-Penrose Inverse of a Closed Linear Operator

✍ C. W. Groetsch 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 334 KB 👁 1 views

A number of operator inclusions, and identities, involving the Moore-Penrose inverse of a closed densely defined linear operator, are presented. Some of these inclusions generalize known identities in the case when the operator is bounded and has closed range. An application to a known compactness c

A fast algorithm for the inversion of ge

A fast algorithm for the inversion of general Toeplitz matrices

✍ P.G. Martinsson; V. Rokhlin; M. Tygert 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 590 KB

we propose a "fast" algorithm for the construction of a data-sparse inver'~ of a general Toeplitz matrix. The computational cost for inverting an N × N Toeplitz matrix equals the cost of four length-N FFTs plus an O(N)-term. This cost should be compared to the O(Nlog2N) cost of previously published

A parallel processed scheme for the eige

A parallel processed scheme for the eigenproblem of positive definite matrices

✍ M.A. Shalaby 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 402 KB

A p-adic algorithm for computing the inv

A p-adic algorithm for computing the inverse of integer matrices

✍ H. Haramoto; M. Matsumoto 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 270 KB

A method for computing the inverse of an (n × n) integer matrix A using p-adic approximation is given. The method is similar to Dixon's algorithm, but ours has a quadratic convergence rate. The complexity of this algorithm (without using FFT or fast matrix multiplication) is O(n 4 (log n) 2 ), the s