Variable s-step technique for planar algorithms in solving indefinite linear systems
From MaRDI portal
Cites work
- s-Step Iterative Methods for (Non)Symmetric (In)Definite Linear Systems
- A generalization of s-step variants of gradient methods
- A numerically stable communication-avoiding s-step GMRES algorithm
- A residual replacement strategy for improving the maximum attainable accuracy of s-step Krylov subspace methods
- An efficient nonsymmetric Lanczos method on parallel vector computers
- An Iterative Method for Nonsymmetric Systems with Multiple Right-Hand Sides
- Block-s-step Krylov iterative methods
- Communication Avoiding ILU0 Preconditioner
- Communication-optimal parallel and sequential QR and LU factorizations
- Conjugate gradient (CG)-type method for the solution of Newton's equation within optimization frameworks
- Conjugate gradient-like algorithms for constrained operator equation related to quadratic inverse eigenvalue problems
- Developing CGNE algorithm for the periodic discrete-time generalized coupled Sylvester matrix equations
- Developing variable s-step CGNE and CGNR algorithms for non-symmetric linear systems
- Efficient image reconstruction via regularized variable s-step conjugate gradient method for Sylvester matrix equations
- Finding solution of linear systems via new forms of BiCG, BiCGstab and CGS algorithms
- scientific article; zbMATH DE number 434537 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 2068036 (Why is no real title available?)
- scientific article; zbMATH DE number 2080875 (Why is no real title available?)
- Hyperbolic Pairs in the Method of Conjugate Gradients
- Iterative algorithms for solution of large sparse systems of linear equations on hypercubes
- Iterative Krylov Methods for Large Linear Systems
- Krylov methods for nonsymmetric linear systems. From theory to computations
- Minimizing communication in numerical linear algebra
- Minimizing synchronizations in sparse iterative solvers for distributed supercomputers
- Mixed precision s‐step Lanczos and conjugate gradient algorithms
- Motivations and realizations of Krylov subspace methods for large sparse linear systems
- Numerical investigation of ensemble methods with block iterative solvers for evolution problems
- On the convergence of conjugate direction algorithm for solving coupled Sylvester matrix equations
- Parallel iterative S-step methods for unsymmetric linear systems
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. I: Theory
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. II: Application
- Planar methods and grossone for the conjugate gradient breakdown in nonlinear programming
- Reducing the effect of global communication in \(\text{GMRES} (m)\) and CG on parallel distributed memory computers
- s-step enlarged Krylov subspace conjugate gradient methods
- s-step iterative methods for symmetric linear systems
- Solving the general coupled and the periodic coupled matrix equations via the extended QMRCGSTAB algorithms
- The adaptive s-step conjugate gradient method
- The non-symmetric \(s\)-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR
- The PMCGAOR and PMCSSOR methods for solving linear complementarity problems
- The stable \(A^TA\)-orthogonal \(s\)-step orthomin\((k)\) algorithm with the CADNA library
This page was built for publication: Variable s-step technique for planar algorithms in solving indefinite linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6940790)
