Pages that link to "Item:Q4021069"

The following pages link to Parallelizable restarted iterative methods for nonsymmetric linear systems. part I: Theory (Q4021069):

Displaying 18 items.

• On the generation of Krylov subspace bases (Q436007) (← links)
• An adaptive \(s\)-step conjugate gradient algorithm with dynamic basis updating. (Q778541) (← links)
• A restarted induced dimension reduction method to approximate eigenpairs of large unsymmetric matrices (Q898927) (← links)
• Varying the \(s\) in your \(s\)-step GMRES (Q1744315) (← links)
• A parallel implementation of the restarted GMRES iterative algorithm for nonsymmetric systems of linear equations (Q1895913) (← links)
• GMRES algorithms over 35 years (Q2698151) (← links)
• The Stability of Block Variants of Classical Gram--Schmidt (Q3382789) (← links)
• Polynomial Preconditioned GMRES and GMRES-DR (Q3447459) (← links)
• On IOM(q): The Incomplete Orthogonalization Method for Large Unsymmetric Linear Systems (Q4220444) (← links)
• Communication lower bounds and optimal algorithms for numerical linear algebra (Q4683913) (← links)
• On the cost of iterative computations (Q4993500) (← links)
• Accuracy of the $s$-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision (Q5264995) (← links)
• Tridiagonal Toeplitz matrices: properties and novel applications (Q5397321) (← links)
• Randomized Sketching for Krylov Approximations of Large-Scale Matrix Functions (Q6116663) (← links)
• Developing variable \(s\)-step CGNE and CGNR algorithms for non-symmetric linear systems (Q6601163) (← links)
• Finding solution of linear systems via new forms of BiCG, BiCGstab and CGS algorithms (Q6602282) (← links)
• A numerically stable communication-avoiding \(s\)-step GMRES algorithm (Q6641763) (← links)
• Krylov subspace recycling with randomized sketching for matrix functions (Q6659693) (← links)