Developing variable \(s\)-step CGNE and CGNR algorithms for non-symmetric linear systems
From MaRDI portal
Publication:6601163
DOI10.1016/j.jfranklin.2024.107071zbMath1544.65052MaRDI QIDQ6601163
Masoud Hajarian, Anthony Theodore Chronopoulos, Hojjatollah Shokri Kaveh
Publication date: 10 September 2024
Published in: Journal of the Franklin Institute (Search for Journal in Brave)
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extending the CGLS algorithm for least squares solutions of the generalized Sylvester-transpose matrix equations
- Parallel iterative S-step methods for unsymmetric linear systems
- An adaptive \(s\)-step conjugate gradient algorithm with dynamic basis updating.
- s-step iterative methods for symmetric linear systems
- Varying the \(s\) in your \(s\)-step GMRES
- Robust least mean logarithmic square adaptive filtering algorithms
- Motivations and realizations of Krylov subspace methods for large sparse linear systems
- Conjugate gradient-based FLANN algorithms in nonlinear active noise control
- Behavior of the LMS algorithm with hyperbolic secant cost
- Developing CGNE algorithm for the periodic discrete-time generalized coupled Sylvester matrix equations
- CGNR Is an Error Reducing Algorithm
- Communication-optimal Parallel and Sequential QR and LU Factorizations
- Minimizing Communication in Numerical Linear Algebra
- Implementation of the GMRES Method Using Householder Transformations
- s-Step Iterative Methods for (Non)Symmetric (In)Definite Linear Systems
- Parallelizable restarted iterative methods for nonsymmetric linear systems. part I: Theory
- A Newton basis GMRES implementation
- The Adaptive $s$-Step Conjugate Gradient Method
- Iterative Krylov Methods for Large Linear Systems
- Krylov Methods for Nonsymmetric Linear Systems
- Mixed precision s‐step Lanczos and conjugate gradient algorithms
- s-Step Enlarged Krylov Subspace Conjugate Gradient Methods
- Reflexive periodic solutions of general periodic matrix equations
- Communication Avoiding ILU0 Preconditioner
- Developing the CGLS algorithm for the least squares solutions of the general coupled matrix equations
- Extending the CGLS method for finding the least squares solutions of general discrete-time periodic matrix equations
- Methods of conjugate gradients for solving linear systems
- The N‐Step Iteration Procedures
- The data-filtering based bias compensation recursive least squares identification for multi-input single-output systems with colored noises
This page was built for publication: Developing variable \(s\)-step CGNE and CGNR algorithms for non-symmetric linear systems