Compression properties for large Toeplitz-like matrices
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3131354 (Why is no real title available?)
- scientific article; zbMATH DE number 46496 (Why is no real title available?)
- scientific article; zbMATH DE number 1330405 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- A Fast ULV Decomposition Solver for Hierarchically Semiseparable Representations
- A Superfast Algorithm for Toeplitz Systems of Linear Equations
- A fast algorithm for the inversion of general Toeplitz matrices
- A fast randomized algorithm for computing a hierarchically semiseparable representation of a matrix
- A recursive skeletonization factorization based on strong admissibility
- A superfast structured solver for Toeplitz linear systems via randomized sampling
- Algebraic methods for Toeplitz-like matrices and operators
- Analysis of the rational Krylov subspace and ADI methods for solving the Lyapunov equation
- Approximation of Large-Scale Dynamical Systems
- Bounding Zolotarev numbers using Faber rational functions
- Bounds on the singular values of matrices with displacement structure
- Computing functions of symmetric hierarchically semiseparable matrices
- Displacement Structure: Theory and Applications
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Efficient numerical methods for non-local operators. \(\mathcal H^2\)-matrix compression, algorithms and analysis.
- Eigenvalue decay bounds for solutions of Lyapunov equations: the symmetric case
- Existence of a low rank or ℋ︁‐matrix approximant to the solution of a Sylvester equation
- Fast Fourier transforms for nonequispaced data. II
- Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
- Fast Poisson solvers for spectral methods
- Fast algorithms for hierarchically semiseparable matrices
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Hierarchical matrices based on a weak admissibility criterion
- Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
- Hierarchical matrices: algorithms and analysis
- Hm-toolbox: MATLAB software for HODLR and HSS matrices
- Low Rank Solution of Lyapunov Equations
- Low-Rank Updates and a Divide-And-Conquer Method for Linear Matrix Equations
- Lower bounds for separable approximations of the Hilbert kernel
- Matrices with hierarchical low-rank structures
- Mosaic-skeleton approximations
- NIST handbook of mathematical functions
- On a Zolotarev problem in the method of alternating directions
- On the ADI method for Sylvester equations
- On the Compression of Low Rank Matrices
- On the efficient computation of high-dimensional integrals and the approximation by exponential sums
- On the singular values of matrices with high displacement rank
- Optimum Alternating-Direction-Implicit Iteration Parameters for a Model Problem
- Rank‐structured approximation of some Cauchy matrices with sublinear complexity
- Solution of Lyapunov equations by alternating direction implicit iteration
- SuperDC: superfast divide-and-conquer eigenvalue decomposition with improved stability for rank-structured matrices
- The Numerical Solution of Parabolic and Elliptic Differential Equations
- Toeplitz and Circulant Matrices: A Review
This page was built for publication: Compression properties for large Toeplitz-like matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891554)
