Academic Journal
Προβολή σε EDS

Randomized block-Krylov subspace methods for low-rank approximation of matrix functions.

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος: Randomized block-Krylov subspace methods for low-rank approximation of matrix functions.
Συγγραφείς: Persson, David1 (AUTHOR) dpersson@flatironinstitute.org, Chen, Tyler2 (AUTHOR) tyler.chen@nyu.edu, Musco, Christopher2 (AUTHOR) cmusco@nyu.edu
Πηγή: Linear Algebra & its Applications. Jul2026, Vol. 741, p32-65. 34p.
Θεματικοί όροι: *Matrix functions, *Krylov subspace, *Singular value decomposition, *Approximation theory, *Matrix multiplications, *Low-rank matrices, *Numerical solutions for linear algebra
Περίληψη: The randomized SVD is a method to compute an inexpensive, yet accurate, low-rank approximation of a matrix. The algorithm assumes access to the matrix through matrix-vector products (matvecs). Therefore, when we would like to apply the randomized SVD to a matrix function, f (A) , one needs to approximate matvecs with f (A) using some other algorithm, which is typically treated as a black-box. Chen and Hallman (SIMAX 2023) argued that, in the common setting where matvecs with f (A) are approximated using Krylov subspace methods (KSMs), a more efficient low-rank approximation is possible if we open this black-box. They present an alternative approach that significantly outperforms the naive combination of KSMs with the randomized SVD, although the method lacked theoretical justification. In this work, we take a closer look at the method, and provide strong and intuitive error bounds that justify its excellent performance for low-rank approximation of matrix functions. [ABSTRACT FROM AUTHOR]
Βάση Δεδομένων: Academic Search Index
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://www.doi.org/10.1016/j.laa.2026.03.029?
    Name: ScienceDirect (all content) (s7799221)
    Category: fullText
    Text: View record from ScienceDirect
    MouseOverText: View record from ScienceDirect
  – Url: https://resolver.ebsco.com/c/fiv2js/result?sid=EBSCO:asx&genre=article&issn=00243795&ISBN=&volume=741&issue=&date=20260715&spage=32&pages=32-65&title=Linear Algebra & its Applications&atitle=Randomized%20block-Krylov%20subspace%20methods%20for%20low-rank%20approximation%20of%20matrix%20functions.&aulast=Persson%2C%20David&id=DOI:10.1016/j.laa.2026.03.029
    Name: Full Text Finder (for New FTF UI) (ns324271)
    Category: fullText
    Text: Full Text Finder
    MouseOverText: Full Text Finder
Header DbId: asx
DbLabel: Academic Search Index
An: 193119970
RelevancyScore: 1431
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 1430.7685546875
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Randomized block-Krylov subspace methods for low-rank approximation of matrix functions.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Persson%2C+David%22">Persson, David</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> dpersson@flatironinstitute.org</i><br /><searchLink fieldCode="AR" term="%22Chen%2C+Tyler%22">Chen, Tyler</searchLink><relatesTo>2</relatesTo> (AUTHOR)<i> tyler.chen@nyu.edu</i><br /><searchLink fieldCode="AR" term="%22Musco%2C+Christopher%22">Musco, Christopher</searchLink><relatesTo>2</relatesTo> (AUTHOR)<i> cmusco@nyu.edu</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Linear+Algebra+%26+its+Applications%22">Linear Algebra & its Applications</searchLink>. Jul2026, Vol. 741, p32-65. 34p.
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: *<searchLink fieldCode="DE" term="%22Matrix+functions%22">Matrix functions</searchLink><br />*<searchLink fieldCode="DE" term="%22Krylov+subspace%22">Krylov subspace</searchLink><br />*<searchLink fieldCode="DE" term="%22Singular+value+decomposition%22">Singular value decomposition</searchLink><br />*<searchLink fieldCode="DE" term="%22Approximation+theory%22">Approximation theory</searchLink><br />*<searchLink fieldCode="DE" term="%22Matrix+multiplications%22">Matrix multiplications</searchLink><br />*<searchLink fieldCode="DE" term="%22Low-rank+matrices%22">Low-rank matrices</searchLink><br />*<searchLink fieldCode="DE" term="%22Numerical+solutions+for+linear+algebra%22">Numerical solutions for linear algebra</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: The randomized SVD is a method to compute an inexpensive, yet accurate, low-rank approximation of a matrix. The algorithm assumes access to the matrix through matrix-vector products (matvecs). Therefore, when we would like to apply the randomized SVD to a matrix function, f (A) , one needs to approximate matvecs with f (A) using some other algorithm, which is typically treated as a black-box. Chen and Hallman (SIMAX 2023) argued that, in the common setting where matvecs with f (A) are approximated using Krylov subspace methods (KSMs), a more efficient low-rank approximation is possible if we open this black-box. They present an alternative approach that significantly outperforms the naive combination of KSMs with the randomized SVD, although the method lacked theoretical justification. In this work, we take a closer look at the method, and provide strong and intuitive error bounds that justify its excellent performance for low-rank approximation of matrix functions. [ABSTRACT FROM AUTHOR]
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=asx&AN=193119970
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.laa.2026.03.029
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 34
        StartPage: 32
    Subjects:
      – SubjectFull: Matrix functions
        Type: general
      – SubjectFull: Krylov subspace
        Type: general
      – SubjectFull: Singular value decomposition
        Type: general
      – SubjectFull: Approximation theory
        Type: general
      – SubjectFull: Matrix multiplications
        Type: general
      – SubjectFull: Low-rank matrices
        Type: general
      – SubjectFull: Numerical solutions for linear algebra
        Type: general
    Titles:
      – TitleFull: Randomized block-Krylov subspace methods for low-rank approximation of matrix functions.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Persson, David
      – PersonEntity:
          Name:
            NameFull: Chen, Tyler
      – PersonEntity:
          Name:
            NameFull: Musco, Christopher
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 15
              M: 07
              Text: Jul2026
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-print
              Value: 00243795
          Numbering:
            – Type: volume
              Value: 741
          Titles:
            – TitleFull: Linear Algebra & its Applications
              Type: main
ResultId 1