"NFFT Meets Krylov Methods: Fast Matrix-Vector Products for the Graph ..."

Dominik Alfke et al. (2018)

> Home

Details and statistics

DOI: 10.3389/FAMS.2018.00061

access: open

type: Journal Article

metadata version: 2021-12-07

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/fams/AlfkePSV18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/fams/AlfkePSV18
Dominik Alfke, Daniel Potts, Martin Stoll, Toni Volkmer:
NFFT Meets Krylov Methods: Fast Matrix-Vector Products for the Graph Laplacian of Fully Connected Networks. Frontiers Appl. Math. Stat. 4: 61 (2018)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.