scispace - formally typeset

Topic

Lanczos approximation

About: Lanczos approximation is a(n) research topic. Over the lifetime, 506 publication(s) have been published within this topic receiving 14976 citation(s).


Papers
More filters
Book
01 Jan 1985
TL;DR: This chapter discusses Lanczos Procedures with no Reorthogonalization for Real Symmetric Problems, and an Identification Test, 'Good' versus' spurious' Eigenvalues.
Abstract: 0 Preliminaries: Notation and Definitions.- 0.1 Notation.- 0.2 Special Types of Matrices.- 0.3 Spectral Quantities.- 0.4 Types of Matrix Transformations.- 0.5 Subspaces, Projections, and Ritz Vectors.- 0.6 Miscellaneous Definitions.- 1 Real' symmetric' Problems.- 1.1 Real Symmetric Matrices.- 1.2 Perturbation Theory.- 1.3 Residual Estimates of Errors.- 1.4 Eigenvalue Interlacing and Sturm Sequencing.- 1.5 Hermitian Matrices.- 1.6 Real Symmetric Generalized Eigenvalue Problems.- 1.7 Singular Value Problems.- 1.8 Sparse Matrices.- 1.9 Reorderings and Factorization of Matrices.- 2 Lanczos Procedures, Real Symmetric Problems.- 2.1 Definition, Basic Lanczos Procedure.- 2.2 Basic Lanczos Recursion, Exact Arithmetic.- 2.3 Basic Lanczos Recursion, Finite Precision Arithmetic.- 2.4 Types of Practical Lanczos Procedures.- 2.5 Recent Research on Lanczos Procedures.- 3 Tridiagonal Matrices.- 3.1 Introduction.- 3.2 Adjoint and Eigenvector Formulas.- 3.3 Complex Symmetric or Hermitian Tridiagonal.- 3.4 Eigenvectors, Using Inverse Iteration.- 3.5 Eigenvalues, Using Sturm Sequencing.- 4 Lanczos Procedures with no Reorthogonalization for Real Symmetric Problems.- 4.1 Introduction.- 4.2 An Equivalence, Exact Arithmetic.- 4.3 An Equivalence, Finite Precision Arithmetic.- 4.4 The Lanczos Phenomenon.- 4.5 An Identification Test, 'Good' versus' spurious' Eigenvalues.- 4.6. Example, Tracking Spurious Eigenvalues.- 4.7 Lanczos Procedures, Eigenvalues.- 4.8 Lanczos Procedures, Eigenvectors.- 4.9 Lanczos Procedure, Hermitian, Generalized Symmetric.- 5 Real Rectangular Matrices.- 5.1 Introduction.- 5.2 Relationships With Eigenvalues.- 5.3 Applications.- 5.4 Lanczos Procedure, Singular Values and Vectors.- 6 Nondefective Complex Symmetric Matrices.- 6.1 Introduction.- 6.2 Properties of Complex Symmetric Matrices.- 6.3 Lanczos Procedure, Nondefective Matrices.- 6.4 QL Algorithm, Complex Symmetric Tridiagonal Matrices.- 7 Block Lanczos Procedures, Real Symmetric Matrices.- 7.1 Introduction.- 7.2 Iterative Single-vector, Optimization Interpretation.- 7.3 Iterative Block, Optimization Interpretation.- 7.4 Iterative Block, A Practical Implementation.- 7.5 A Hybrid Lanczos Procedure.- References.- Author and Subject Indices.

1,289 citations

Book
01 Jan 1964

527 citations

Journal ArticleDOI
TL;DR: It is shown how a modification called selective orthogonalization stifles the formation of duplicate eigenvectors without increasing the cost of a Lanczos step signifi'cantly.
Abstract: The simple Lanczos process is very effective for finding a few extreme eigenvalues of a large symmetric matrix along with the associated eigenvectors. Unfortunately, the process computes redundant copies of the outermost eigen- vectors and has to be used with some skill. In this paper it is shown how a modification called selective orthogonalization stifles the formation of duplicate eigenvectors without increasing the cost of a Lanczos step signifi'cantly. The degree of linear independence among the Lanczos vectors is controlled without

395 citations

Journal ArticleDOI
Abstract: The nonsymmetric Lanczos method can be used to compute eigenvalues of large sparse non-Hermitian matrices or to solve large sparse non-Hermitian linear systems. However, the original Lanczos algorithm is susceptible to possible breakdowns and potential instabilities. An implementation is presented of a look-ahead version of the Lanczos algorithm that, except for the very special situation of an incurable breakdown, overcomes these problems by skipping over those steps in which a breakdown or near-breakdown would occur in the standard process. The proposed algorithm can handle look-ahead steps of any length and requires the same number of matrix-vector products and inner products as the standard Lanczos process without look-ahead.

318 citations

Network Information
Related Topics (5)
Numerical analysis

52.2K papers, 1.2M citations

77% related
Matrix (mathematics)

105.5K papers, 1.9M citations

76% related
Eigenvalues and eigenvectors

51.7K papers, 1.1M citations

76% related
Differential equation

88K papers, 2M citations

75% related
Partial differential equation

70.8K papers, 1.6M citations

74% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20211
20201
20191
20181
201710
201614