An \(O(N \log N)\) hierarchical random compression method for kernel matrices by sampling partial matrix entries (Q2222486): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Implementation of the Fast Multipole Method without Multipoles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical matrix techniques for low- and high-frequency Helmholtz problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of boundary element matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive low-rank approximation of collocation matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient numerical methods for non-local operators. \(\mathcal H^2\)-matrix compression, algorithms and analysis. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast adaptive solver for hierarchically semiseparable representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accurate and Efficient Nyström Volume Integral Equation Method for Electromagnetic Scattering of 3-D Metamaterials in Layered Media / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accurate and efficient Nyström volume integral equation method for the Maxwell equations for multiple 3-D scatterers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heterogeneous FMM for layered media Helmholtz equation. I: Two layers in \(\mathbb{R}^2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Inverse Fast Multipole Method: Using a Fast Approximate Direct Solver as a Preconditioner for Dense Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fast Multipole Method I: Error Analysis and Asymptotic Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative-Error $CUR$ Matrix Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast directional algorithm for high frequency acoustic scattering in two dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The black-box fast multipole method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A treecode-accelerated boundary integral Poisson-Boltzmann solver for electrostatics of solvated biomolecules / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalized Fast Multipole Method for Nonoscillatory Kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction and arithmetics of \(\mathcal H\)-matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for particle simulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sparse \({\mathcal H}\)-matrix arithmetic. II: Application to multi-dimensional problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of Lipschitz mappings into a Hilbert space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Evaluation of Multiquadric RBF Sums by a Cartesian Treecode / rank
 
Normal rank
Property / cites work
 
Property / cites work: A distributed kernel summation framework for general‐dimension machine learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Far-field compression for fast kernel summation methods in high dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: ASKIT: Approximate Skeletonization Kernel-Independent Treecode in High Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Randomized Algorithm for Computing a Hierarchically Semiseparable Representation of a Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressing Rank-Structured Matrices via Randomized Sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized algorithm for the decomposition of matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computational Stochastic Methodology for the Design of Random Meta-materials under Geometric Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superfast Multifrontal Method for Large Structured Linear Systems of Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for hierarchically semiseparable matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified framework for oscillatory integral transforms: when to use NUFFT or butterfly factorization? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Gaussian Quadratures and Singular Value Decompositions of Integral Operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: A kernel-independent adaptive fast multipole algorithm in two and three dimensions / rank
 
Normal rank

Latest revision as of 10:10, 24 July 2024

scientific article
Language Label Description Also known as
English
An \(O(N \log N)\) hierarchical random compression method for kernel matrices by sampling partial matrix entries
scientific article

    Statements

    An \(O(N \log N)\) hierarchical random compression method for kernel matrices by sampling partial matrix entries (English)
    0 references
    0 references
    0 references
    27 January 2021
    0 references
    fast kernel summation
    0 references
    randomized algorithm
    0 references
    matrix approximation
    0 references
    singular value decomposition
    0 references
    \(\mathcal{H}\)-matrix
    0 references
    hierarchical algorithms
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers