Cover Image

The complexity of accurate floating point computation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Demmel, James
Format:	Preprint
Published:	2003
Subjects:	Numerical Analysis 65F, 65G50, 65Y20, 68Q25
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Superfast 1-Norm Estimation
by: Go, Soo, et al.
Published: (2025)

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

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

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

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

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

Mixed precision HODLR matrices
by: Carson, Erin, et al.
Published: (2024)

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

Low-Memory Numerical Certification
by: Breiding, Paul, et al.
Published: (2026)

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

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

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

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

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

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

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

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

Near instance optimality of the Lanczos method for Stieltjes and related matrix functions
by: Schweitzer, Marcel
Published: (2025)

Fast Evaluation of Truncated Neumann Series by Low-Product Radix Kernels
by: Sao, Piyush
Published: (2026)

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

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

Mixed Precision FGMRES-Based Iterative Refinement for Weighted Least Squares
by: Carson, Erin, et al.
Published: (2024)

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

Analysis of Randomized Householder-Cholesky QR Factorization with Multisketching
by: Higgins, Andrew J., et al.
Published: (2023)

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

When can forward stable algorithms be composed stably?
by: Beltrán, Carlos, et al.
Published: (2021)

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

All Equalities Are Equal, but Some Are More Equal Than Others: The Effect of Implementation Aliasing on the Numerical Solution to Conservation Equations
by: Trojak, Will, et al.
Published: (2019)

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

Neural Preconditioning via Krylov Subspace Geometry
by: Dimola, Nunzio, et al.
Published: (2025)

Multigrid with Linear Storage Complexity
by: Bauer, Daniel, et al.
Published: (2025)

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

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

Sparse Pseudospectral Shattering
by: Shah, Rikhav, et al.
Published: (2024)

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

Unconditional full linear convergence and quasi-optimal complexity of smoothed adaptive finite element methods
by: Bringmann, Philipp, et al.
Published: (2026)

Shifted CholeskyQR for sparse matrices
by: Guan, Haoran, et al.
Published: (2024)

Accelerating a restarted Krylov method for matrix functions with randomization
by: Guidotti, Nicolas L., et al.
Published: (2025)

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