Solving sparse symmetric definite quadratic lambda-matrix problems

DOI10.1007/BF01932844zbMath0478.65024MaRDI QIDQ1161244

David S. Scott

Publication date: 1981

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

sparse symmetric matriceslambda matrices21, 475-480 (1981)quadratic matrix eigenvalue problem

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items (2)

Methods and algorithms of solving spectral problems for polynomial and rational matrices ⋮ Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian

Cites Work

• Unnamed Item
• The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems
• VIBRATIONS OF ROTATING CIRCUMFERENTIALLY PERIODIC STRUCTURES
• Solving Symmetric-Definite Quadratic $\lambda $-Matrix Problems without Factorization
• The Advantages of Inverted Operators in Rayleigh–Ritz Approximations
• Solving Sparse Symmetric Generalized Eigenvalue Problems without Factorization
• The Lanczos Algorithm with Selective Orthogonalization
• Algorithms for the Nonlinear Eigenvalue Problem

This page was built for publication: Solving sparse symmetric definite quadratic lambda-matrix problems