✦ LIBER ✦

An application of legendre functions in the inversion of a Hilbert Matrix

✍ Scribed by O.R. Ainsworth; C.K. Liu

Publisher: Elsevier Science
Year: 1975
Tongue: English
Weight: 125 KB
Volume: 299
Category: Article
ISSN: 0016-0032
DOI: 10.1016/0016-0032(75)90123-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Application of Legendre functions in

An Application of Legendre functions in the inversion of the Hilbert matrix, by O.R. Ainsworth and C.K. Liu (J. Franklin Inst., Vol. 299, No. 4, pp.297-299, April 1975).

📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 34 KB

Tor gives the inverse to the Hilbert fun

Tor gives the inverse to the Hilbert function of a graded algebra

✍ Moss E. Sweedler 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 566 KB

The inverse of a rectangular matrix: Som

The inverse of a rectangular matrix: Some applications in molecular dynamics

✍ M. Gussoni; G. Dellepiane; S. Abbate 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 468 KB

The Theory of Involutive Divisions and a

The Theory of Involutive Divisions and an Application to Hilbert Function Computations

✍ Joachim Apel 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 600 KB

Generalising the divisibility relation of terms we introduce the lattice of so-called involutive divisions and define the admissibility of such an involutive division for a given set of terms. Based on this theory we present a new approach for building a general theory of involutive bases of polynom

Computation of the generalized inverse o

Computation of the generalized inverse of a polynomial matrix and applications

✍ N.P. Karampetakis 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 963 KB

An algorithm for the numerical inversion

An algorithm for the numerical inversion of a tridiagonal matrix

✍ Kumar, Surendra ;Shashi, ;Pethö, Árpad 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 280 KB 👁 2 views

This paper presents an algorithm for obtaining the inverse of a tridiagonal matrix numerically. The algorithm does not require diagonal dominance in the matrix and is also computationally efficient.