An extended QR-solver for large profiled matrices

DOI10.1002/NME.2618zbMATH Open1176.74080OpenAlexW2099035905MaRDI QIDQ3649858FDOQ3649858

Martin Ruess, Peter Jan Pahl

Publication date: 7 December 2009

Published in: International Journal for Numerical Methods in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nme.2618

zbMATH Keywords

preconditioningstructured matrixplate vibrationJacobiQR-algorithm

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Vibrations in dynamical problems in solid mechanics (74H45) Numerical approximation of solutions of dynamical problems in solid mechanics (74H15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• LAPACK Users' Guide
• Matrix algorithms. Vol. 2: Eigensystems
• An implicit restarted Lanczos method for large symmetric eigenvalue problems
• \(QR\)-like algorithms for eigenvalue problems
• Structures preserved by the QR-algorithm
• The QR Algorithm Revisited
• Eigenvalue computation in the 20th century
• A New Proof of Global Convergence for the Tridiagonal $QL$ Algorithm
• Convergence of the QR algorithm
• Matrix shapes invariant under the symmetric QR algorithm
• The restarted QR-algorithm for eigenvalue computation of structured matrices
• On the Convergence of the QR Algorithm with Origin Shifts for Normal Matrices

Cited In (1)

• Weakly enforced essential boundary conditions for NURBS-embedded and trimmed NURBS geometries on the basis of the finite cell method

Uses Software

• LAPACK
• ARPACK

This page was built for publication: An extended QR-solver for large profiled matrices

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