A Newton basis GMRES implementation
From MaRDI portal
Recommendations
Cited in
(38)- Krylov-subspace methods for the Sylvester equation
- BiCGstab(l) and other hybrid Bi-CG methods
- A fast implementation for GMRES method
- Vector extrapolation methods. Applications and numerical comparison
- Varying the \(s\) in your \(s\)-step GMRES
- Reducing the effect of global communication in \(\text{GMRES} (m)\) and CG on parallel distributed memory computers
- A parallel implementation of the CMRH method for dense linear systems
- Parallelism and robustness in GMRES with a Newton basis and deflated restarting
- GMRES algorithms over 35 years
- On the similarities between the quasi-Newton inverse least squares method and GMRES
- The stability of block variants of classical Gram-Schmidt
- Polynomial Preconditioned GMRES and GMRES-DR
- Implementation of the GMRES Method Using Householder Transformations
- Analysis and parallel implementation of a forced N-body problem
- SOLVING SPARSE LEAST SQUARES PROBLEMS WITH PRECONDITIONED CGLS METHOD ON PARALLEL DISTRIBUTED MEMORY COMPUTERS
- On the generation of Krylov subspace bases
- Communication lower bounds and optimal algorithms for numerical linear algebra
- On the cost of iterative computations
- Mixed-Precision Cholesky QR Factorization and Its Case Studies on Multicore CPU with Multiple GPUs
- Accuracy of the s-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision
- Tridiagonal Toeplitz matrices: properties and novel applications
- Polynomial preconditioned Arnoldi with stability control
- A parallel nearly implicit time-stepping scheme
- Descent Properties of an Anderson Accelerated Gradient Method with Restarting
- Mixed-Precision Orthogonalization Scheme and Adaptive Step Size for Improving the Stability and Performance of CA-GMRES on GPUs
- Iterative methods for unsymmetric linear systems
- Developing variable s-step CGNE and CGNR algorithms for non-symmetric linear systems
- Finding solution of linear systems via new forms of BiCG, BiCGstab and CGS algorithms
- A numerically stable communication-avoiding s-step GMRES algorithm
- A new modified variable s-step BiCGSTAB method with regularization for solving shifted linear systems
- On the backward stability of s-step GMRES
- Efficient image reconstruction via regularized variable s-step conjugate gradient method for Sylvester matrix equations
- Parallel GMRES with a multiplicative Schwarz preconditioner
- Polynomial Acceleration of Alternating Projections: Chebyshev Acceleration, Convergence Rates, and Retractions
- Gram decay, intrinsic information dimension, and backward stability of s-step GMRES
- An adaptive \(s\)-step conjugate gradient algorithm with dynamic basis updating.
- A restarted induced dimension reduction method to approximate eigenpairs of large unsymmetric matrices
- A new computational GMRES method
This page was built for publication: A Newton basis GMRES implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4316515)
