Number of the records: 1  

Asymptotic quadratic convergence of the two-sided serial and parallel block-jacobi svd algorithm

  1. TitleAsymptotic quadratic convergence of the two-sided serial and parallel block-jacobi svd algorithm
    Author Okša Gabriel 1958 SAVMATEM - Matematický ústav SAV
    Co-authors Yamamoto Yusaku

    Bečka Martin 1967 SAVMATEM - Matematický ústav SAV

    Vajteršic Marián 1951- SAVMATEM - Matematický ústav SAV    SCOPUS    RID

    Source document Siam Journal on Matrix Analysis and Applications. Vol. 40 , no. 2 (2019), p. 639-671
    Languageeng - English
    Document kindrozpis článkov z periodík (rbx)
    CitationsNOVAKOVIC, Vedran. Batched Computation of the Singular Value Decompositions of Order Two by the AVX-512 Vectorization. In PARALLEL PROCESSING LETTERS. ISSN 0129-6264, 2020, vol. 30, no. 4.
    NOVAKOVIC, V. - SINGER, S. A Kogbetliantz-type algorithm for the hyperbolic SVD. In NUMERICAL ALGORITHMS. ISSN 1017-1398, JUN 2022, vol. 90, no. 2, p. 523-561. Dostupné na: https://doi.org/10.1007/s11075-021-01197-4.
    HARI, V. On the quadratic convergence of the complex HZ method for the positive definite generalized eigenvalue problem. In LINEAR ALGEBRA AND ITS APPLICATIONS. ISSN 0024-3795, JAN 1 2022, vol. 632, p. 153-192. Dostupné na: https://doi.org/10.1016/j.laa.2021.08.022.
    CategoryADCA - Scientific papers in foreign journals registered in Current Contents Connect with IF (impacted)
    Category of document (from 2022)V3 - Vedecký výstup publikačnej činnosti z časopisu
    Type of documentčlánok
    Year2019
    Registered inWOS
    Registered inSCOPUS
    Registered inCCC
    DOI 10.1137/18M1222727
    article

    article

    File nameAccessSizeDownloadedTypeLicense
    ASYMPTOTIC QUADRATIC CONVERGENCE OF THE TWO-SIDED SERIAL....pdfNeprístupný/archív580.4 KB0Publisher's version
    rokCCIFIF Q (best)JCR Av Jour IF PercSJRSJR Q (best)CiteScore
    A
    rok vydaniarok metrikyIFIF Q (best)SJRSJR Q (best)
    201920181.912Q11.248Q1
Number of the records: 1  

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