A superfast structured solver for Toeplitz linear systems via randomized sampling
From MaRDI portal
Recommendations
- Superfast and stable structured solvers for Toeplitz least squares via randomized sampling
- A Superfast Algorithm for Toeplitz Systems of Linear Equations
- Parallel randomized and matrix-free direct solvers for large structured dense linear systems
- A Fast Stable Solver for Nonsymmetric Toeplitz and Quasi-Toeplitz Systems of Linear Equations
- A superfast solver for real symmetric Toeplitz systems using real trigonometric transformations
Cited in
(49)- Fast iterative adaptive multi-quadric radial basis function method for edges detection of piecewise functions. I: Uniform mesh
- Uncertainty quantification and stochastic polynomial chaos expansion for recovering random data in Darcy and diffusion equations
- A stable matrix version of the fast multipole method: stabilization strategies and examples
- Interconnected hierarchical structures for fast direct elliptic solution
- On the rational approximation of Markov functions, with applications to the computation of Markov functions of Toeplitz matrices
- Real polynomial root-finding by means of matrix and polynomial iterations
- Effective matrix-free preconditioning for the augmented immersed interface method
- Estimating the norms of random circulant and Toeplitz matrices and their inverses
- A fast memory efficient construction algorithm for hierarchically semi-separable representations
- Superfast divide-and-conquer method and perturbation analysis for structured eigenvalue solutions
- Hierarchical interpolative factorization for elliptic operators: integral equations
- How bad are Vandermonde matrices?
- On the stability of some hierarchical rank structured matrix algorithms
- An efficient multicore implementation of a novel HSS-structured multifrontal solver using randomized sampling
- Parallel randomized and matrix-free direct solvers for large structured dense linear systems
- Superfast and stable structured solvers for Toeplitz least squares via randomized sampling
- Fast computation of the matrix exponential for a Toeplitz matrix
- Hierarchical interpolative factorization for elliptic operators: differential equations
- Fast structured direct spectral methods for differential equations with variable coefficients. I. The one-dimensional case
- A Superfast Algorithm for Toeplitz Systems of Linear Equations
- A fast contour-integral eigensolver for non-Hermitian matrices
- Effective and robust preconditioning of general SPD matrices via structured incomplete factorization
- Fast matrix multiplication and its algebraic neighbourhood
- Fast structured Jacobi-Jacobi transforms
- Low-Rank Updates and a Divide-And-Conquer Method for Linear Matrix Equations
- Preserving Positive Definiteness in Hierarchically Semiseparable Matrix Approximations
- Transformations of matrix structures work again
- SuperDC: superfast divide-and-conquer eigenvalue decomposition with improved stability for rank-structured matrices
- Hm-toolbox: MATLAB software for HODLR and HSS matrices
- Analytical low-rank compression via proxy point selection
- Fast solution methods for convex quadratic optimization of fractional differential equations
- An ADMM-LAP method for total variation myopic deconvolution of adaptive optics retinal images
- Robust and accurate stopping criteria for adaptive randomized sampling in matrix-free hierarchically semiseparable construction
- A distributed-memory package for dense hierarchically semi-separable matrix computations using randomization
- Fast approximate computations with Cauchy matrices and polynomials
- A distributed-memory randomized structured multifrontal method for sparse direct solutions
- Low-rank approximation of a matrix: novel insights, new progress, and extensions
- Second‐order accurate hierarchical approximate factorizations for solving sparse linear systems
- Randomized compression of rank-structured matrices accelerated with graph coloring
- Solving sparse linear systems faster than matrix multiplication
- Compression properties for large Toeplitz-like matrices
- Multi-layer hierarchical structures
- Tree quasi-separable matrices: a simultaneous generalization of sequentially and hierarchically semiseparable representations
- Superfast direct inversion of the nonuniform discrete Fourier transform via hierarchically semiseparable least squares
- Construction of hierarchically semiseparable matrix representation using adaptive Johnson-Lindenstrauss sketching
- Equispaced Fourier representations for efficient Gaussian process regression from a billion data points
- An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures
- Structured FISTA for l₁-regularized optimization model in image restoration
- Efficient genome-wide association studies via low-rank approximations
This page was built for publication: A superfast structured solver for Toeplitz linear systems via randomized sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4902924)
