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
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65F15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 15A18 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6638060 / rank
 
Normal rank
Property / zbMATH Keywords
 
synchronization-reducing
Property / zbMATH Keywords: synchronization-reducing / rank
 
Normal rank
Property / zbMATH Keywords
 
\(s\)-step Lanczos
Property / zbMATH Keywords: \(s\)-step Lanczos / rank
 
Normal rank
Property / zbMATH Keywords
 
\(s\)-step bicg
Property / zbMATH Keywords: \(s\)-step bicg / rank
 
Normal rank
Property / zbMATH Keywords
 
\(s\)-step QMR
Property / zbMATH Keywords: \(s\)-step QMR / rank
 
Normal rank
Property / zbMATH Keywords
 
efficient recurrences
Property / zbMATH Keywords: efficient recurrences / rank
 
Normal rank

Revision as of 04:11, 28 June 2023

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