Copertina

Superfast direct inversion of the nonuniform discrete Fourier transform via hierarchically semi-separable least squares

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Wilber, Heather, Epperly, Ethan N., Barnett, Alex H.
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Numerical Analysis 65T50, 65F55, 65F20
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Fast and forward stable randomized algorithms for linear least-squares problems
di: Epperly, Ethan N.
Pubblicazione: (2023)

Fast randomized least-squares solvers can be just as accurate and stable as classical direct solvers
di: Epperly, Ethan N., et al.
Pubblicazione: (2024)

Sharp analysis of sketched least squares and randomized low-rank approximation
di: Epperly, Ethan N., et al.
Pubblicazione: (2026)

Make the most of what you have: Resource-efficient randomized algorithms for matrix computations
di: Epperly, Ethan N.
Pubblicazione: (2025)

NR-SSOR right preconditioned RRGMRES for arbitrary singular systems and least squares problems
di: Sugihara, Kouta, et al.
Pubblicazione: (2025)

Numerical Instabilities in the Kaczmarz Method and Stabilization by Iterative Refinement
di: Dereziński, Michał, et al.
Pubblicazione: (2026)

A computational study of low precision incomplete Cholesky factorization preconditioners for sparse linear least-squares problems
di: Scott, Jennifer, et al.
Pubblicazione: (2025)

Recursive sparse LU decomposition based on nested dissection and low rank approximations
di: Xuanru, Zhu, et al.
Pubblicazione: (2024)

Fast and direct inversion methods for the multivariate nonequispaced fast Fourier transform
di: Kircheis, Melanie, et al.
Pubblicazione: (2023)

Lanczos with compression for symmetric matrix Lyapunov equations
di: Casulli, Angelo A., et al.
Pubblicazione: (2025)

Approximating Sparse Matrices and their Functions using Matrix-vector products
di: Park, Taejun, et al.
Pubblicazione: (2023)

Inexact versions of several block-splitting preconditioners for indefinite least squares problems
di: Shaldehi, Mohaddese Kaveh, et al.
Pubblicazione: (2026)

Factorized sparse approximate inverse preconditioning for singular M-matrices
di: Bick, Katherina, et al.
Pubblicazione: (2025)

Algebraic Multigrid with Overlapping Schwarz Smoothers and Local Spectral Coarse Grids for Least Squares Problems
di: Southworth, Ben S., et al.
Pubblicazione: (2026)

Robust, randomized preconditioning for kernel ridge regression
di: Díaz, Mateo, et al.
Pubblicazione: (2023)

H2-MG: A multigrid method for hierarchical rank structured matrices
di: Sushnikova, Daria, et al.
Pubblicazione: (2025)

Mixed precision multigrid with smoothing based on incomplete Cholesky factorization
di: Vacek, Petr, et al.
Pubblicazione: (2025)

Row-Splitting ILU Preconditioners for Sparse Least-Squares Problems
di: Scott, Jennifer, et al.
Pubblicazione: (2026)

Chebyshev smoothing with adaptive block-FSAI preconditioners for the multilevel solution of higher-order problems
di: Recio, Pablo Jiménez, et al.
Pubblicazione: (2025)

The effect of approximate coarsest-level solves on the convergence of multigrid V-cycle methods
di: Vacek, Petr, et al.
Pubblicazione: (2023)

On Optimal Algebraic Multigrid Methods
di: Ramos, Luis García, et al.
Pubblicazione: (2019)

Hybrid hierarchical matrices with adaptive mixed precision storage
di: Khan, Ritesh, et al.
Pubblicazione: (2026)

Oblivious Subspace Injection Is Not Enough for Relative Error
di: Townsend, Alex, et al.
Pubblicazione: (2026)

Double precision is not necessary for LSQR for solving discrete linear ill-posed problems
di: Li, Haibo
Pubblicazione: (2022)

Multigrid Primer: Basic Principles
di: McCormick, Stephen F., et al.
Pubblicazione: (2026)

A dimension-oblivious domain decomposition method based on space-filling curves
di: Griebel, Michael, et al.
Pubblicazione: (2021)

Faster Linear Algebra Algorithms with Structured Random Matrices
di: Camaño, Chris, et al.
Pubblicazione: (2025)

Method for Verifying Solutions of Sparse Linear Systems with General Coefficients
di: Terao, Takeshi, et al.
Pubblicazione: (2024)

Hybrid LSMR algorithms for large-scale general-form regularization
di: Yang, Yanfei
Pubblicazione: (2024)

Hybrid CGME and TCGME algorithms for large-scale general-form regularization
di: Yang, Yanfei
Pubblicazione: (2023)

Optimal density compensation factors for the reconstruction of the Fourier transform of bandlimited functions
di: Kircheis, Melanie, et al.
Pubblicazione: (2023)

Balancing Inexactness in Mixed Precision Matrix Computations
di: Carson, Erin Claire
Pubblicazione: (2026)

Efficient error and variance estimation for randomized matrix computations
di: Epperly, Ethan N., et al.
Pubblicazione: (2022)

Computing electrostatic potentials using regularization based on the range-separated tensor format
di: Benner, Peter, et al.
Pubblicazione: (2019)

The Akhiezer iteration and inverse-free solvers for Sylvester matrix equations
di: Ballew, Cade, et al.
Pubblicazione: (2025)

Mixed precision iterative refinement for least squares with linear equality constraints and generalized least squares problems
di: Gao, Bowen, et al.
Pubblicazione: (2024)

A stable one-synchronization variant of reorthogonalized block classical Gram--Schmidt
di: Carson, Erin, et al.
Pubblicazione: (2024)

Forward and backward error bounds for a mixed precision preconditioned conjugate gradient algorithm
di: Bake, Thomas, et al.
Pubblicazione: (2025)

GMRES with randomized sketching and deflated restarting
di: Burke, Liam, et al.
Pubblicazione: (2023)

Sketched and truncated polynomial Krylov methods: Evaluation of matrix functions
di: Palitta, Davide, et al.
Pubblicazione: (2023)