✦ LIBER ✦

The use of Faber polynomials to solve systems of linear equations

✍ Scribed by N.A. Farkova

Publisher: Elsevier Science
Year: 1988
Weight: 778 KB
Volume: 28
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(88)90038-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A polynomial algorithm for solving syste

A polynomial algorithm for solving systems of two linear diophantine equations

✍ Jean-François Romeuf 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 987 KB

An efficient univariate method to solve

An efficient univariate method to solve systems of non-linear equations

✍ Guillermo F. Barreto; Italo H. Farina 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 947 KB

The use of gradient methods to solve spa

The use of gradient methods to solve sparse nonsymmetric systems of algebraic equations

✍ A.L. Goncharov 📂 Article 📅 1989 🏛 Elsevier Science ⚖ 348 KB

Solving systems of sparse linear equatio

Solving systems of sparse linear equations

✍ L.F. Escudero 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 530 KB

Multivariate Polynomial System Solving U

Multivariate Polynomial System Solving Using Intersections of Eigenspaces

✍ H. Michael Möller; Ralf Tenberg 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 336 KB

The solutions of a polynomial system can be computed using eigenvalues and eigenvectors of certain endomorphisms. There are two different approaches, one by using the (right) eigenvectors of the representation matrices, one by using the (right) eigenvectors of their transposed ones, i.e. their left

The effective use of fixed point calcula

The effective use of fixed point calculations in solving systems of linear algebraic equations

✍ V.I. Gordonova 📂 Article 📅 1970 🏛 Elsevier Science ⚖ 435 KB