Pages that link to "Item:Q671295"

The following pages link to Parallel iterative S-step methods for unsymmetric linear systems (Q671295):

Displaying 13 items.

• Minimizing synchronizations in sparse iterative solvers for distributed supercomputers (Q316448) (← links)
• The non-symmetric \(s\)-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR (Q327002) (← links)
• A generalization of \(s\)-step variants of gradient methods (Q415206) (← links)
• Conjugate gradient-like algorithms for constrained operator equation related to quadratic inverse eigenvalue problems (Q2244950) (← links)
• Least squares solutions of quadratic inverse eigenvalue problem with partially bisymmetric matrices under prescribed submatrix constraints (Q2293566) (← links)
• Block s-step Krylov iterative methods (Q3090777) (← links)
• A block varaint of the GMRES method for unsymmetric linear systems (Q4229576) (← links)
• ANALYSIS OF DIFFERENT PARTITIONING SCHEMES FOR PARALLEL GRAM-SCHMIDT ALGORITHMS (Q4485122) (← links)
• Communication lower bounds and optimal algorithms for numerical linear algebra (Q4683913) (← links)
• Biconjugate residual algorithm for solving general Sylvester-transpose matrix equations (Q5088135) (← links)
• Accuracy of the $s$-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision (Q5264995) (← links)
• Analyzing the Effect of Local Rounding Error Propagation on the Maximal Attainable Accuracy of the Pipelined Conjugate Gradient Method (Q5373919) (← links)
• A robust meta-heuristic adaptive Bi-CGSTAB algorithm to online estimation of a three DoF state–space model in the presence of disturbance and uncertainty (Q5867067) (← links)