The numerical rank of Krylov matrices

DOI10.1016/J.LAA.2016.07.022MaRDI QIDQ1789397zbMATHOpenAlexFDO

Authors Achiya Dax

Publication date 10 October 2018

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2016.07.022

zbMATH Keywords

Krylov subspacesVandermonde matricessymmetric matricesKrylov matricesnumerical rankpartition theoremsclustering theoremsVandermonde-Pascal-Toeplitz equality

Mathematics Subject Classification ID

Hermitian, skew-Hermitian, and related matrices (15B57) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Vector spaces, linear dependence, rank, lineability (15A03) Matrix equations and identities (15A24) Orthogonalization in numerical linear algebra (65F25)

Recommendations

• Reliable Krylov-based algorithms for matrix null space and rank
• How bad are Hankel matrices?
• scientific article; zbMATH DE number 663835
• scientific article; zbMATH DE number 697754
• A structured rank-revealing method for Sylvester matrix

Cites work

• scientific article; zbMATH DE number 4160951 (Why is no real title available?)
• scientific article; zbMATH DE number 3671573 (Why is no real title available?)
• scientific article; zbMATH DE number 1226426 (Why is no real title available?)
• scientific article; zbMATH DE number 852536 (Why is no real title available?)
• scientific article; zbMATH DE number 6159604 (Why is no real title available?)
• scientific article; zbMATH DE number 3408799 (Why is no real title available?)
• Accuracy and Stability of Numerical Algorithms
• Adaptive projection subspace dimension for the thick-restart Lanczos method
• An implicit restarted Lanczos method for large symmetric eigenvalue problems
• Approximation of monomials by lower degree polynomials
• Approximations to \(x^ n\) and \(| x|\)- a survey
• Associated Polynomials and Uniform Methods for the Solution of Linear Problems
• How bad are Hankel matrices?
• Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
• Lower bounds for the condition number of Vandermonde matrices
• Matrix algorithms. Vol. 2: Eigensystems
• Norm estimates for inverses of Vandermonde matrices
• Numerical methods for large eigenvalue problems
• On a connection between the Pascal, Stirling and Vandermonde matrices
• On a connection between the Pascal, Vandermonde and Stirling matrices. II.
• On extremum properties of orthogonal quotients matrices
• On inverses of Vandermonde and confluent Vandermonde matrices
• Optimally conditioned Vandermonde matrices
• Pascal Matrices
• Pascal's Matrices
• Solution of Vandermonde systems of equations
• The Matrices of Pascal and Other Greats
• The Matrix Eigenvalue Problem
• The condition number of real Vandermonde, Krylov and positive definite Hankel matrices
• The linear algebra of the Pascal matrix
• Thick-restart Lanczos method for large symmetric eigenvalue problems
• Walter Gautschi, Volume 2. Selected works with commentaries. Edited by Claude Brezinski and Ahmed Sameh

Cited in

(4)

• scientific article; zbMATH DE number 3894367 (Why is no real title available?)
• Numerical Ranges of KMS Matrices
• Numerical Rank Deficiency in Matrix Products
• Reliable Krylov-based algorithms for matrix null space and rank

Describes a project that uses

Uses Software

• JDQR
• TRLan
• mctoolbox
• JDQZ
• IRAM
• a-TRLan

This page was built for publication: The numerical rank of Krylov matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1789397)