𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A “Look-around Lanczos” algorithm for solving a system of linear equations

✍ Scribed by P.R. Graves-Morris


Book ID
110385941
Publisher
Springer US
Year
1997
Tongue
English
Weight
580 KB
Volume
15
Category
Article
ISSN
1017-1398

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Iteration algorithms for solving a syste
✍ Xizhao Wang; Zimian Zhong; Minghu Ha 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 107 KB

In this paper, we discuss the solution of a system of fuzzy linear equations, X = AX + U , and its iteration algorithms where A is a real n × n matrix, the unknown vector X and the constant U are all vectors consisting of n fuzzy numbers, and the addition, scale-multiplication are deÿned by Zadeh's

A new algorithm for solving large inhomo
✍ S. Ramasesha 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 314 KB 👁 1 views

## Abstract An algorithm based on a small matrix approach to the solution of a system of inhomogeneous linear algebraic equations is developed and tested in this short communication. The solution is assumed to lie in an initial subspace and the dimension of the subspace is augmented iteratively by

A transpose-free “Lanczos/Orthodir” algo
✍ Claude Brezinski 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 360 KB

The method of Lanczos for solving systems of linear equations is implemented via recurrence relationships between formal orthogonal polynomials. In this Note, a new procedure for computing the coefficients of these recurrence relations is proposed. In contrast with all other procedures. it does not