The non-symmetric \(s\)-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR (Q327002): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1515/amcs-2015-0055 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2401104724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4356470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945815 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Residual Replacement Strategy for Improving the Maximum Attainable Accuracy of $s$-Step Krylov Subspace Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoiding Communication in Nonsymmetric Lanczos-Based Krylov Subspace Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: s-step iterative methods for symmetric linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel iterative S-step methods for unsymmetric linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139556 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: QMR: A quasi-minimal residual method for non-Hermitian linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035550 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Implementation of the QMR Method Based on Coupled Two-Term Recurrences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hiding Global Communication Latency in the GMRES Algorithm on Massively Parallel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4356575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SLEPc / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of Lanczos-like algorithms implemented on parallel computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient nonsymmetric Lanczos method on parallel vector computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational and Information Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Krylov Subspace Methods on Supercomputers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Deriving the Quasi-Minimal Residual Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Residual Replacement Strategies for Krylov Subspace Iterative Methods for the Convergence of True Residuals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing synchronizations in sparse iterative solvers for distributed supercomputers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved GBPi-CG algorithm suitable for distributed parallel computing / rank
 
Normal rank

Latest revision as of 18:03, 12 July 2024

scientific article
Language Label Description Also known as
English
The non-symmetric \(s\)-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR
scientific article

    Statements

    The non-symmetric \(s\)-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR (English)
    0 references
    0 references
    0 references
    13 October 2016
    0 references
    0 references
    synchronization-reducing
    0 references
    \(s\)-step Lanczos
    0 references
    \(s\)-step bicg
    0 references
    \(s\)-step QMR
    0 references
    efficient recurrences
    0 references
    0 references
    0 references
    0 references