Solving sparse linear systems faster than matrix multiplication
From MaRDI portal
Cites work
- A superfast structured solver for Toeplitz linear systems via randomized sampling
- A survey of direct methods for sparse linear systems
- A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
- Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs
- An elementary proof of the restricted invertibility theorem
- An introduction to matrix concentration inequalities
- Approximate Gaussian elimination for Laplacians -- fast, sparse, and simple
- Asymptotically fast solution of Toeplitz and related systems of linear equations
- Computational topology. An introduction
- Displacement ranks of matrices and linear equations
- Exact solution of linear equations using p-adic expansions
- Fast algorithms for hierarchically semiseparable matrices
- Fast construction of hierarchical matrix representation from matrix-vector multiplication
- Fast linear algebra is stable
- Fast matrix multiplication is stable
- Faster algorithms via approximation theory
- Faster inversion and other black box matrix computations using efficient block projections
- Foundations of Data Science
- Gaussian elimination is not optimal
- Hardness results for structured linear systems
- High performance algorithms for Toeplitz and block Toeplitz matrices
- How to multiply matrices faster
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 177858 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 3451989 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 2115098 (Why is no real title available?)
- scientific article; zbMATH DE number 7829265 (Why is no real title available?)
- Introduction to algorithms.
- Inversion of Toeplitz matrices with only two standard equations
- Invertibility of ``large submatrices with applications to the geometry of Banach spaces and harmonic analysis
- Local fluctuation of the spectrum of a multidimensional Anderson tight binding model
- Matrix anti-concentration inequalities with applications
- Matrix Padé approximation: Definitions and properties
- Matrix regularizing effects of Gaussian perturbations
- Methods of conjugate gradients for solving linear systems
- Multiplying matrices faster than coppersmith-winograd
- Nearly linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems
- Non-asymptotic theory of random matrices: extreme singular values
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- On matrices with displacement structure: generalized operators and faster algorithms
- Packing LPs are Hard to Solve Accurately, Assuming Linear Equations are Hard
- Polynomial multiplication over finite fields in time O(n n)
- Powers of tensors and fast matrix multiplication
- Pseudospectral shattering, the sign function, and diagonalization in nearly matrix multiplication time
- Random matrices: tail bounds for gaps between eigenvalues
- Randomized algorithms in numerical linear algebra
- Relative-Error CUR Matrix Decompositions
- ROUNDING-OFF ERRORS IN MATRIX PROCESSES
- Sampling from large matrices
- Sketching as a tool for numerical linear algebra
- Smooth analysis of the condition number and the least singular value
- Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices
- Solving directed Laplacian systems in nearly-linear time through sparse LU factorizations
- Solving elliptic finite element systems in near-linear time with support preconditioners
- Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
- Solving sparse linear equations over finite fields
- Solving sparse rational linear systems
- Some History of the Conjugate Gradient and Lanczos Algorithms: 1948–1976
- Sparse random matrices have simple spectrum
- Sparsified Cholesky and multigrid solvers for connection Laplacians
- Spectral sparsification of graphs
- Stability of the Lanczos method for matrix function approximation
- Superfast and stable structured solvers for Toeplitz least squares via randomized sampling
- Tail bounds for gaps between eigenvalues of sparse random matrices
- The bit complexity of efficient continuous optimization
- The shifted number system for fast linear algebra on integer matrices
- Toeplitz and circulant matrices: a review.
This page was built for publication: Solving sparse linear systems faster than matrix multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6869436)
