Computing reducing subspaces of a large linear matrix pencil

DOI10.1515/156939806777320359zbMath1134.65031OpenAlexW2061800930MaRDI QIDQ3419750

Yuri M. Nechepurenko, Grace Hechme

Publication date: 7 February 2007

Published in: Russian Journal of Numerical Analysis and Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/156939806777320359

zbMATH Keywords

stabilitycomputational complexitysemi-inner producteigenvaluesviscous incompressible fluidmatrix pencilreducing subspaceEuclidean inner productdeflation procedureJacobi-Davidson algorithmJacobi-Davidson reduced basis method

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Navier-Stokes equations for incompressible viscous fluids (76D05) Numerical computation of matrix norms, conditioning, scaling (65F35) Matrix pencils (15A22) Stability and instability of nonparallel flows in hydrodynamic stability (76E09)

Uses Software

• Wesseling

Cites Work

• Unnamed Item
• Unnamed Item
• Finding leading modes of a viscous free surface flow: An asymmetric generalized eigenproblem
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
• Eigenvalues of Block Matrices Arising from Problems in Fluid Mechanics
• A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
• Numerical spectral analysis of hydrodynamic equations

This page was built for publication: Computing reducing subspaces of a large linear matrix pencil