✦ LIBER ✦

On the convergence behavior of the restarted GMRES algorithm for solving nonsymmetric linear systems

✍ Scribed by Wayne Joubert

Publisher: John Wiley and Sons
Year: 1994
Tongue: English
Weight: 1006 KB
Volume: 1
Category: Article
ISSN: 1070-5325
DOI: 10.1002/nla.1680010502

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

ON THE CONVERGENCE OF ZERO-FINDING EIGEN

ON THE CONVERGENCE OF ZERO-FINDING EIGENSOLUTION ALGORITHMS FOR SOLVING NON-LINEAR EIGENVALUE PROBLEMS

✍ MOHAMMEDI R. ABDEL-AZIZ 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB 👁 2 views

This paper presents a convergence theory for non-linear eigenvalue methods. The basic idea of these methods, which have been described by the author in an earlier paper, 1 is to apply an eigen-solver in conjunction with a zero-ÿnding technique for solving the non-linear eigenvalue problems. The main

Fast Parallel Algorithms for Solving Tri

Fast Parallel Algorithms for Solving Triangular Systems of Linear Equations on the Hypercube

✍ O.H. Ibarra; M.H. Kim 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 864 KB

This paper presents efficient hypercube algorithms for solving triangular systems of linear equations by using various matrix partitioning and mapping schemes. Recently, several parallel algorithms have been developed for this problem. In these algorithms, the triangular solver is treated as the sec

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

Algorithms for solving overdetermined sy

Algorithms for solving overdetermined systems of linear equations in the lp-metric, 0 < p < 1

✍ R.W Owens; V.P Sreedharan 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 774 KB

Evaluating the LCD algorithm for solving

Evaluating the LCD algorithm for solving linear systems of equations arising from implicit SUPG formulation of compressible flows

✍ Lucia Catabriga; Alvaro L. G. A. Coutinho; Leopoldo P. Franca 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 454 KB 👁 1 views

On the convergence of general stationary

On the convergence of general stationary iterative methods for range-Hermitian singular linear systems

✍ Naimin Zhang; Yi-Min Wei 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB 👁 1 views

## Abstract General stationary iterative methods with a singular matrix __M__ for solving range‐Hermitian singular linear systems are presented, some convergence conditions and the representation of the solution are also given. It can be verified that the general Ortega–Plemmons theorem and Keller