Software for simplified Lanczos and QMR algorithms
From MaRDI portal
The paper describes Fortran-77 implementations of some simplified versions of the three-term and coupled two-term Lanczos algorithm and the associated quasi-minimal residual (QMR) iteration algorithms for general \(J\)-symmetric and \(J\)-Hermitian matrices. These implementations represent counterparts to the algorithms already contained in the authors software package QMRPACK. Section 2 briefly reviews the Lanczos process and the QMR method. In Section 3, the general concept of simplified Lanczos algorithms is discussed, and a few examples are given. In Section 4, the authors describe implementation issues for the simplified algorithms. Section 5 considers one of the algorithms in more detail. In Section 6, a list of the implemented simplified algorithms is given. Section 7 describes an example driver for two of the algorithms, and in Section 8, results of numerical experiments are reported. In Section 9, the authors make some concluding remarks.
Recommendations
Cites work
- A decomposition of Toeplitz matrices and optimal circulant preconditioning
- A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
- A Schur method for solving algebraic Riccati equations
- A survey of preconditioned iterative methods for linear systems of algebraic equations
- A survey of Toeplitz and related matrices
- A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
- An Implementation of the QMR Method Based on Coupled Two-Term Recurrences
- An interior-point method for multifractional programs with convex constraints
- Conjugate Gradient-Type Methods for Linear Systems with Complex Symmetric Coefficient Matrices
- Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations
- Efficient Implementation of a Class of Preconditioned Conjugate Gradient Methods
- scientific article; zbMATH DE number 3900044 (Why is no real title available?)
- scientific article; zbMATH DE number 3917549 (Why is no real title available?)
- scientific article; zbMATH DE number 3978276 (Why is no real title available?)
- scientific article; zbMATH DE number 3179793 (Why is no real title available?)
- scientific article; zbMATH DE number 88927 (Why is no real title available?)
- scientific article; zbMATH DE number 663834 (Why is no real title available?)
- scientific article; zbMATH DE number 195099 (Why is no real title available?)
- scientific article; zbMATH DE number 4122146 (Why is no real title available?)
- Matrices and indefinite scalar products
- Matrix Analysis
- Preconditioners for Indefinite Systems Arising in Optimization
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- QMRPACK
- Residual Smoothing Techniques for Iterative Methods
- Solution of Sparse Indefinite Systems of Linear Equations
- Stabilised bilinear-constant velocity-pressure finite elements for the conjugate gradient solution of the Stokes problem
- The autonomous linear quadratic control problem. Theory and numerical solution
- The Design and Structure of a Fortran Program Library for Optimization
- The look-ahead Lanczos process for nonsymmetric matrices and its applications
- Toeplitz Equations by Conjugate Gradients with Circulant Preconditioner
- Use of indefinite pencils for computing damped natural modes
Cited in
(35)- Partitioned versus global Krylov subspace iterative methods for FE solution of 3-D Biot's problem
- Iterative solution of multiple radiation and scattering problems in structural acoustics using a block quasi-minimal residual algorithm
- Overlapping Schwarz methods for mixed linear elasticity and Stokes problems
- Block triangular preconditioners for symmetric saddle-point problems
- Block preconditioners for linear systems in interior point methods for convex constrained optimization
- A Lanczos model-order reduction technique to efficiently simulate electromagnetic wave propagation in dispersive media
- On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods
- Domain decomposition methods for advection-dominated linear-quadratic elliptic optimal control problems
- On the update of constraint preconditioners for regularized KKT systems
- On the eigenvalues of a class of saddle point matrices
- On theoretical and numerical aspects of symplectic Gram-Schmidt-like algorithms
- Inexact constraint preconditioners for linear systems arising in interior point methods
- On the convergence of Q-OR and Q-MR Krylov methods for solving nonsymmetric linear systems
- Combination preconditioning of saddle point systems for positive definiteness.
- Updating constraint preconditioners for KKT systems in quadratic programming via low-rank corrections
- Regularization and preconditioning of KKT systems arising in nonnegative least-squares problems
- The CBiCG class of algorithms for complex symmetric linear systems with applications in several electromagnetic model problems
- Preconditioned eigensolvers for large-scale nonlinear Hermitian eigenproblems with variational characterizations. II. Interior eigenvalues
- Solution of generalized shifted linear systems with complex symmetric matrices
- A structure preserving approximation method for Hamiltonian exponential matrices
- QMRPACK
- Global-basis two-level method for indefinite systems. Part 1: convergence studies
- An adaptive mixed formulation for 3D magnetostatics
- Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy
- Efficient preconditioned iterative linear solvers for 3-D magnetostatic problems using edge elements
- A preconditioned MINRES method for nonsymmetric Toeplitz matrices
- Multilevel preconditioned iterative eigensolvers for Maxwell eigenvalue problems
- Block Krylov subspace methods for the computation of structural response to turbulent wind
- A preconditioned MINRES method for block lower triangular Toeplitz systems
- A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides
- Obtaining pseudoinverse solutions with MINRES
- JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices
- Preserving geometric properties of the exponential matrix by block Krylov subspace methods
- A spatial domain decomposition method for parabolic optimal control problems
- Mixed constraint preconditioners for the iterative solution of FE coupled consolidation equations
This page was built for publication: Software for simplified Lanczos and QMR algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1917424)
