Search results

  1. 1.
    0405535 - UIVT-O 330913 SIGLE CZ eng V - Research Report
    Duintjer Tebbens, Jurjen - Tůma, Miroslav
    Preconditioner Updates for Solving Sequences of Large and Sparse Nonsymmetric Linear Systems.
    Prague: ICS AS CR, 2005. 19 s. Technical Report, V-940.
    R&D Projects: GA AV ČR 1ET400300415
    Institutional research plan: CEZ:AV0Z10300504
    Keywords : preconditioned iterative methods * sparse matrices * sequences of linear algebraic systems * incomplete factorizations * factorization updates * Gauss-Jordan transformations * minimum spanning tree
    Subject RIV: BA - General Mathematics
    Permanent Link: http://hdl.handle.net/11104/0125693
    FileDownloadSizeCommentaryVersionAccess
    v940-05.pdf15289.1 KBOtheropen-access
     
     
  2. 2.
    0329229 - ÚI 2010 CZ eng A - Abstract
    Duintjer Tebbens, Jurjen - Tůma, Miroslav
    On an Approximate Preconditioner Update for Sequences of Large Nonsymmetric linear Systems.
    Modelling 2009. Ostrava: Institute of Geonics AS CR, 2009 - (Blaheta, R.; Starý, J.). s. 79-80. ISBN 978-80-86407-66-1.
    [Modelling 2009. IMACS Conference on Mathematical Modelling and Computational Methods in Applied Sciences and Engineering /4./. 22.06.2009-26.06.2009, Rožnov pod Radhoštěm]
    R&D Projects: GA AV ČR KJB100300703
    Institutional research plan: CEZ:AV0Z10300504
    Keywords : preconditioned iterative methods * sequences of linear algebraic systems * incomplete factorization * factorization updates
    Permanent Link: http://hdl.handle.net/11104/0175322
     
     
  3. 3.
    0321397 - ÚI 2009 CZ eng A - Abstract
    Duintjer Tebbens, Jurjen - Tůma, Miroslav
    Using triangular preconditioner updates in matrix-free implementations.
    SNA '09 - Seminar on Numerical Analysis & Winter School. Ostrava: Institute of Geonics AS CR, 2009 - (Blaheta, R.; Starý, J.). s. 90-94. ISBN 978-80-86407-60-9.
    [SNA '09 - Seminar on numerical analysis: modelling and simulation of challenging engineering problems. 02.02.2009-06.02.2009, Ostrava]
    R&D Projects: GA AV ČR KJB100300703; GA AV ČR IAA100300802
    Institutional research plan: CEZ:AV0Z10300504
    Keywords : preconditioned iterative methods * sequences of linear algebraic systems * incomplete factorization * factorization updates * matrix-free implementation
    http://www.ugn.cas.cz/events/2009/sna/sbornik.pdf
    Permanent Link: http://hdl.handle.net/11104/0169959
     
     
  4. 4.
    0092794 - ÚI 2008 FR eng A - Abstract
    Duintjer Tebbens, Jurjen - Tůma, Miroslav
    Preconditioning of Iterative Methods for Solving Sequences of Linear Systems.
    Combinatorial Scientific Computing. Toulouse: CERFACS, 2005. s. 1-2.
    [CSC 05. International Workshop on Combinatorial Scientific Computing /2./. 21.06.2005-23.06.2005, Toulouse]
    Institutional research plan: CEZ:AV0Z10300504
    Keywords : preconditioned iterative methods * sequences of linear algebraic systems * incomplete factorization * factorization updates
    http://www.cerfacs.fr/algor/CSC05/schedule.html
    Permanent Link: http://hdl.handle.net/11104/0153021
     
     
  5. 5.
    0086650 - ÚI 2008 RIV US eng J - Journal Article
    Duintjer Tebbens, Jurjen - Tůma, Miroslav
    Efficient Preconditioning of Sequences of Nonsymmetric Linear Systems.
    [Efektivní předpodmínění posloupností nesymetrických lineárních systémů.]
    SIAM Journal on Scientific Computing. Roč. 29, č. 5 (2007), s. 1918-1941. ISSN 1064-8275. E-ISSN 1095-7197
    R&D Projects: GA AV ČR 1ET400300415; GA AV ČR KJB100300703
    Institutional research plan: CEZ:AV0Z10300504
    Keywords : preconditioned iterative methods * sparse matrices * sequences of linear algebraic systems * incomplete factorizations * factorization updates * Gauss–Jordan transformations * minimum spanning tree
    Subject RIV: BA - General Mathematics
    Impact factor: 1.784, year: 2007
    Permanent Link: http://hdl.handle.net/11104/0148856
    FileDownloadSizeCommentaryVersionAccess
    0086650.pdf0760.3 KBAuthor´s preprintopen-access
     
     


  This site uses cookies to make them easier to browse. Learn more about how we use cookies.