✦ LIBER ✦

New look-ahead Lanczos-type algorithms for linear systems

✍ Scribed by C. Brezinski; M. Redivo Zaglia; H. Sadok

Publisher: Springer-Verlag
Year: 1999
Tongue: English
Weight: 189 KB
Volume: 83
Category: Article
ISSN: 0029-599X
DOI: 10.1007/s002110050439

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A breakdown-free Lanczos type algorithm

A breakdown-free Lanczos type algorithm for solving linear systems

✍ C. Brezinski; M. Redivo Zaglia; H. Sadok 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 490 KB

Look-ahead Levinson and Schur algorithms

Look-ahead Levinson and Schur algorithms for non-Hermitian Toeplitz systems

✍ Martin H. Gutknecht; Marlies Hochbruck 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 432 KB

A transpose-free “Lanczos/Orthodir” algo

A transpose-free “Lanczos/Orthodir” algorithm for linear systems

✍ 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

A new algorithm for linear systems of th

A new algorithm for linear systems of the Pascal type

✍ Xiao-Guang Lv; Ting-Zhu Huang; Zhi-Gang Ren 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 388 KB

In this paper, we give an algorithm for solving linear systems of the Pascal matrices. The method is based on the explicit factorization of the Pascal matrices. The algorithm costs no multiplications and O(n 2 ) additions. The linear systems of the generalized Pascal matrices are also considered. So

Application of the Lanczos algorithm for

Application of the Lanczos algorithm for solving the linear systems that occur in continuation problems

✍ C.-S. Chien; S.-L. Chang 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 166 KB

## Abstract We study the Lanczos method for solving symmetric linear systems with multiple right‐hand sides. First, we propose a numerical method of implementing the Lanczos method, which can provide all approximations to the solution vectors of the remaining linear systems. We also seek possible a

Fast algorithms of Björck-Pereyra type f

Fast algorithms of Björck-Pereyra type for solving Cauchy-Vandermonde linear systems

✍ J.J. Martínez; J.M. Peña 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 579 KB

Cauchy-Vandermonde matrices and their relationship with rational interpolation problems are studied. Fast algorithms for solving the corresponding linear systems are presented. They are explicit algorithms that generalize in a natural way BjOrck-Pereyra algorithms for solving Vandermonde linear syst