2020Unpublished venueRequires access

Theory of Krylov Subspace Methods

Iman Farahbakhsh

Open publisher page 0 citations

Abstract

This chapter discusses the theoretical foundations of the most important available methods known for solving large and spars linear systems. These methods are based on orthogonal or oblique projection processes. The chapter focuses solely on the mathematical foundations, theory, and derivation of Krylov subspace methods. It describes the general principles of the projection method as the cornerstone of the Krylov subspace methods and defines the Krylov subspace. The chapter studies the principles, derivation approaches and convergence theory of the conjugate gradient method. It also describes the minimal residual method, generalized minimal residual method, conjugate residual method, and bi-conjugate residual method. The chapter also explains the principles of extracting conjugate gradient squared and bi-conjugate gradient stabilized methods, as a subset of the transpose-free methods.

About this research paper

What this paper is about

This chapter discusses the theoretical foundations of the most important available methods known for solving large and spars linear systems. These methods are based on orthogonal or oblique projection processes. The chapter focuses solely on the mathematical foundations, theory, and derivation of Krylov subspace methods. It describes the general principles of the projection method as the cornerstone of the Krylov subspace methods and defines the Krylov subspace. The chapter studies the principles, derivation approaches and convergence theory of the conjugate gradient method. It also describes the minimal residual method, generalized minimal residual method, conjugate residual method, and bi-conjugate residual method. The chapter also explains the principles of extracting conjugate gradient squared and bi-conjugate gradient stabilized methods, as a subset of the transpose-free methods.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This chapter discusses the theoretical foundations of the most important available methods known for solving large and spars linear systems. These methods are based on orthogonal or oblique projection processes. The chapter focuses solely on the mathematical foundations, theory, and derivation of Krylov subspace methods. It describes the general principles of the projection method as the cornerstone of the Krylov subspace methods and defines the Krylov subspace. The chapter studies the principles, derivation approaches and convergence theory of the conjugate gradient method. It also describes the minimal residual method, generalized minimal residual method, conjugate residual method, and bi-conjugate residual method. The chapter also explains the principles of extracting conjugate gradient squared and bi-conjugate gradient stabilized methods, as a subset of the transpose-free methods.

Key concepts: Krylov subspace, Conjugate residual method, Conjugate gradient method, Generalized minimal residual method, Residual, Derivation of the conjugate gradient method, Subspace topology, Applied mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
Theory of Krylov Subspace Methods — Research Paper | ScholarLens