Some Fast Algorithms for Sequentially Semiseparable Representations
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1955860
- Fast algorithms for hierarchically semiseparable matrices
- A fast randomized algorithm for computing a hierarchically semiseparable representation of a matrix
- Separable type representations of matrices and fast algorithms. Volume 1. Basics. Completion problems. Multiplication and inversion algorithms
- Linear complexity algorithms for semiseparable matrices
Cited in
(34)- An MSSS-preconditioned matrix equation approach for the time-harmonic elastic wave equation at multiple frequencies
- An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths
- Minimal rank completions for overlapping blocks
- Distributed-memory hierarchical interpolative factorization
- Time and space efficient generators for quasiseparable matrices
- An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation
- Fast structured LU factorization for nonsymmetric matrices
- Superfast divide-and-conquer method and perturbation analysis for structured eigenvalue solutions
- LU factorization for matrices in quasiseparable form via orthogonal transformations
- On the stability of some hierarchical rank structured matrix algorithms
- Parallel randomized and matrix-free direct solvers for large structured dense linear systems
- A convergence analysis for a sweeping preconditioner for block tridiagonal systems of linear equations
- New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem.
- Matrices with hierarchical low-rank structures
- Fast algorithms for hierarchically semiseparable matrices
- Semi- and quasi-separable systems
- Recent advances on the use of separated representations
- Applications of statistical condition estimation to the solution of linear systems
- Extension and optimization of the FIND algorithm: Computing Green's and less-than Green's functions
- scientific article; zbMATH DE number 1955860 (Why is no real title available?)
- SuperDC: superfast divide-and-conquer eigenvalue decomposition with improved stability for rank-structured matrices
- Semiautomatic task graph construction for \(\mathcal{H}\)-matrix arithmetic
- Hm-toolbox: MATLAB software for HODLR and HSS matrices
- An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations
- The method of fundamental solutions in solving coupled boundary value problems for M/EEG
- A parallel geometric multifrontal solver using hierarchically semiseparable structure
- Exact computations with quasiseparable matrices
- Preconditioners for Krylov subspace methods: An overview
- HODLR3D: hierarchical matrices for N-body problems in three dimensions
- Hierarchical low-rank arithmetic with floating point compression
- Tree quasi-separable matrices: a simultaneous generalization of sequentially and hierarchically semiseparable representations
- An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures
- Kernel matrix approximations by sums of exponentials and stability of fast structured transforms
- On the Sequentially Semiseparable Structure of SDE-Induced Kernels and Efficient Algorithms for Kernel-Based Estimation Problems
This page was built for publication: Some Fast Algorithms for Sequentially Semiseparable Representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470465)
