Far-field compression for fast kernel summation methods in high dimensions (Q2397164): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: ScalFMM / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963412731 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1409.2802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of low rank matrix approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of low-rank matrix approximations / 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: Grid-Multipole Calculations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Numerical Analysis in High Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5483032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Matrix Algorithms via the Subsampled Randomized Hadamard Transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact matrix completion via convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2896086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Compression of Low Rank Matrices / 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: The fast multipole method: Numerical implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An elementary proof of a theorem of Johnson and Lindenstrauss / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix approximation and projective clustering via volume sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering large graphs via the singular value decomposition / 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: Q5405231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093333 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster least squares approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Polynomial Interpolation, Integration, and Differentiation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The black-box fast multipole method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast monte-carlo algorithms for finding low-rank approximations / 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: Q3188054 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for particle simulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fast Gauss Transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast approximation of the discrete Gauss transform in higher dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization / 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: Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Fast Multipole Algorithm for Potential Fields / 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: 10.1162/153244302760200687 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Algorithms for Matrices and Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: CUR matrix decompositions for improved data analysis / 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: ASKIT: An Efficient, Parallel Library for High-Dimensional Kernel Summations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Accelerated Kernel-Independent Fast Multipole Method in One Dimension / 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: Sampling from large matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4727203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: IMPROVED ANALYSIS OF THE SUBSAMPLED RANDOMIZED HADAMARD TRANSFORM / rank
 
Normal rank
Property / cites work
 
Property / cites work: User-friendly tail bounds for sums of random matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Introduction to Matrix Concentration Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Advertising: Techniques for Targeting Relevant Ads / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast randomized algorithm for the approximation of matrices / 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: An Improved Fast Multipole Algorithm for Potential Fields on the Line / 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 21:07, 13 July 2024

scientific article
Language Label Description Also known as
English
Far-field compression for fast kernel summation methods in high dimensions
scientific article

    Statements

    Far-field compression for fast kernel summation methods in high dimensions (English)
    0 references
    0 references
    0 references
    29 May 2017
    0 references
    kernel independent fast multipole methods
    0 references
    fast summation
    0 references
    randomized matrix approximation
    0 references
    interpolative decomposition
    0 references
    matrix sampling
    0 references
    numerical examples
    0 references
    algorithm
    0 references
    low-rank approximation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers