Solving sparse symmetric definite quadratic lambda-matrix problems

DOI10.1007/BF01932844MaRDI QIDQ1161244zbMATH OpenFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3631849 (Why is no real title available?)
• Algorithms for the Nonlinear Eigenvalue Problem
• Solving Sparse Symmetric Generalized Eigenvalue Problems without Factorization
• Solving Symmetric-Definite Quadratic \lambda -Matrix Problems without Factorization
• The Advantages of Inverted Operators in Rayleigh–Ritz Approximations
• The Lanczos Algorithm with Selective Orthogonalization
• The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems
• VIBRATIONS OF ROTATING CIRCUMFERENTIALLY PERIODIC STRUCTURES

Cited in

(2)

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

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

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