Copertina

Hybrid hierarchical matrices with adaptive mixed precision storage

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Khan, Ritesh, Carson, Erin
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Numerical Analysis 65G50, 65F55, 65Y20, 68Q25, 68W25
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Mixed precision HODLR matrices
di: Carson, Erin, et al.
Pubblicazione: (2024)

The complexity of accurate floating point computation
di: Demmel, James
Pubblicazione: (2003)

Stochastic trace estimation for parameter-dependent matrices applied to spectral density approximation
di: Matti, Fabio, et al.
Pubblicazione: (2025)

Mixed precision thin SVD algorithms based on the Gram matrix
di: Carson, Erin, et al.
Pubblicazione: (2026)

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

Sketched and Truncated Polynomial Krylov Subspace Methods: Matrix Sylvester Equations
di: Palitta, Davide, et al.
Pubblicazione: (2023)

Quasi-optimal hierarchically semi-separable matrix approximation
di: Amsel, Noah, et al.
Pubblicazione: (2025)

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

Superfast 1-Norm Estimation
di: Go, Soo, et al.
Pubblicazione: (2025)

Reorthogonalized Pythagorean variants of block classical Gram-Schmidt
di: Carson, Erin, et al.
Pubblicazione: (2024)

On the loss of orthogonality in low-synchronization variants of reorthogonalized block classical Gram-Schmidt
di: Carson, Erin, et al.
Pubblicazione: (2024)

On the convergence of adaptive Galerkin FEM for parametric PDEs with lognormal coefficients
di: Eigel, Martin, et al.
Pubblicazione: (2023)

Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruption
di: Cai, HanQin, et al.
Pubblicazione: (2023)

Beyond Low Rank: Fast Low-Rank + Diagonal Decomposition with a Spectral Approach
di: Yeon, Kingsley, et al.
Pubblicazione: (2025)

Accelerating Newton-Schulz Iteration for Orthogonalization via Chebyshev-type Polynomials
di: Grishina, Ekaterina, et al.
Pubblicazione: (2025)

Nearly Optimal Approximation of Matrix Functions by the Lanczos Method
di: Amsel, Noah, et al.
Pubblicazione: (2023)

The Performance of Low-Synchronization Variants of Reorthogonalized Block Classical Gram--Schmidt
di: Carson, Erin, et al.
Pubblicazione: (2025)

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

A general framework for Krylov ODE residuals with applications to randomized Krylov methods
di: Krieger, Emil, et al.
Pubblicazione: (2025)

Low-Memory Numerical Certification
di: Breiding, Paul, et al.
Pubblicazione: (2026)

The Detection and Correction of Silent Errors in Pipelined Krylov Subspace Methods
di: Carson, Erin Claire, et al.
Pubblicazione: (2024)

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

Scalable Multilevel Monte Carlo Methods Exploiting Parallel Redistribution on Coarse Levels
di: Fairbanks, Hillary R., et al.
Pubblicazione: (2024)

Towards an Efficient Shifted Cholesky QR for Applications in Model Order Reduction using pyMOR
di: Bindhak, Maximilian, et al.
Pubblicazione: (2025)

Discretization of non-uniform rational B-spline (NURBS) models for meshless isogeometric analysis
di: Duh, Urban, et al.
Pubblicazione: (2023)

Fast variable density node generation on parametric surfaces with application to mesh-free methods
di: Duh, Urban, et al.
Pubblicazione: (2020)

Preconditioning via Randomized Range Deflation (RandRAND)
di: Balabanov, Oleg, et al.
Pubblicazione: (2025)

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)

Computing k-means in mixed precision
di: Carson, Erin, et al.
Pubblicazione: (2024)

Algorithm-agnostic low-rank approximation of operator monotone matrix functions
di: Persson, David, et al.
Pubblicazione: (2023)

Mixed Precision Orthogonalization-Free Projection Methods for Eigenvalue and Singular Value Problems
di: Xu, Tianshi, et al.
Pubblicazione: (2025)

Randomized block-Krylov subspace methods for low-rank approximation of matrix functions
di: Persson, David, et al.
Pubblicazione: (2025)

Adaptive finite element methods with optimally preconditioned GMRES guarantee optimal complexity
di: Führer, Thomas, et al.
Pubblicazione: (2026)

Explicit Construction of Approximate Kolmogorov Superpositions with C2 Smoothness
di: Song, Lunji, et al.
Pubblicazione: (2025)

Compression of Currents and Varifolds
di: Paul, Allen, et al.
Pubblicazione: (2024)

On a randomized small-block Lanczos method for large-scale null space computations
di: Kressner, Daniel, et al.
Pubblicazione: (2024)

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

Mixed-Precision Performance Portability of FFT-Based GPU-Accelerated Algorithms for Block-Triangular Toeplitz Matrices
di: Venkat, Sreeram, et al.
Pubblicazione: (2025)

Anderson acceleration with approximate calculations: applications to scientific computing
di: Pasini, Massimiliano Lupo, et al.
Pubblicazione: (2022)