Software for simplified Lanczos and QMR algorithms

DOI10.1016/0168-9274(95)00089-5zbMath0853.65041OpenAlexW2037144335MaRDI QIDQ1917424

Noël M. Nachtigal, Roland W. Freund

Publication date: 5 January 1997

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-9274(95)00089-5

zbMATH Keywords

numerical experimentsLanczos algorithmeigenvalue computationQMR methodquasi-minimal residual iteration\(J\)-symmetric matrices\(J\)-Hermitian matricessoftware package QMRPACK

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10) Software, source code, etc. for problems pertaining to linear algebra (15-04)

Related Items (32)

On the convergence of Q-OR and Q-MR Krylov methods for solving nonsymmetric linear systems ⋮ A Lanczos model-order reduction technique to efficiently simulate electromagnetic wave propagation in dispersive media ⋮ The CBiCG class of algorithms for complex symmetric linear systems with applications in several electromagnetic model problems ⋮ Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy ⋮ On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods ⋮ Preconditioned Eigensolvers for Large-Scale Nonlinear Hermitian Eigenproblems with Variational Characterizations. II. Interior Eigenvalues ⋮ Domain decomposition methods for advection-dominated linear-quadratic elliptic optimal control problems ⋮ Preserving geometric properties of the exponential matrix by block Krylov subspace methods ⋮ Inexact constraint preconditioners for linear systems arising in interior point methods ⋮ On the update of constraint preconditioners for regularized KKT systems ⋮ A spatial domain decomposition method for parabolic optimal control problems ⋮ Combination preconditioning of saddle point systems for positive definiteness ⋮ Iterative solution of multiple radiation and scattering problems in structural acoustics using a block quasi-minimal residual algorithm ⋮ Solution of generalized shifted linear systems with complex symmetric matrices ⋮ Updating Constraint Preconditioners for KKT Systems in Quadratic Programming Via Low-Rank Corrections ⋮ A structure preserving approximation method for Hamiltonian exponential matrices ⋮ Block Krylov subspace methods for the computation of structural response to turbulent wind ⋮ A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides ⋮ Regularization and preconditioning of KKT systems arising in nonnegative least-squares problems ⋮ Efficient Preconditioned Iterative Linear Solvers for 3-D Magnetostatic Problems Using Edge Elements ⋮ Mixed constraint preconditioners for the iterative solution of FE coupled consolidation equations ⋮ Global-basis two-level method for indefinite systems. Part 1: convergence studies ⋮ On the eigenvalues of a class of saddle point matrices ⋮ Multilevel preconditioned iterative eigensolvers for Maxwell eigenvalue problems ⋮ JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices ⋮ On theoretical and numerical aspects of symplectic Gram-Schmidt-like algorithms ⋮ Overlapping Schwarz methods for mixed linear elasticity and Stokes problems ⋮ Partitioned versus global Krylov subspace iterative methods for FE solution of 3-D Biot's problem ⋮ Block triangular preconditioners for symmetric saddle-point problems ⋮ Block preconditioners for linear systems in interior point methods for convex constrained optimization ⋮ A Preconditioned MINRES Method for Nonsymmetric Toeplitz Matrices ⋮ An adaptive mixed formulation for 3D magnetostatics

Uses Software

• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A decomposition of Toeplitz matrices and optimal circulant preconditioning
• Stabilised bilinear-constant velocity-pressure finite elements for the conjugate gradient solution of the Stokes problem
• Matrices and indefinite scalar products
• A survey of preconditioned iterative methods for linear systems of algebraic equations
• QMR: A quasi-minimal residual method for non-Hermitian linear systems
• The autonomous linear quadratic control problem. Theory and numerical solution
• An interior-point method for multifractional programs with convex constraints
• Use of indefinite pencils for computing damped natural modes
• A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
• Matrix Analysis
• Toeplitz Equations by Conjugate Gradients with Circulant Preconditioner
• A Schur method for solving algebraic Riccati equations
• Efficient Implementation of a Class of Preconditioned Conjugate Gradient Methods
• Preconditioners for Indefinite Systems Arising in Optimization
• Conjugate Gradient-Type Methods for Linear Systems with Complex Symmetric Coefficient Matrices
• Solution of Sparse Indefinite Systems of Linear Equations
• A survey of Toeplitz and related matrices
• The Design and Structure of a Fortran Program Library for Optimization
• Residual Smoothing Techniques for Iterative Methods
• An Implementation of the QMR Method Based on Coupled Two-Term Recurrences
• QMRPACK
• An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
• A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
• Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations

This page was built for publication: Software for simplified Lanczos and QMR algorithms