A Fast Semidirect Least Squares Algorithm for Hierarchically Block Separable Matrices

DOI10.1137/120902677zbMath1301.65027arXiv1212.3521OpenAlexW2041636959MaRDI QIDQ2923368

Kenneth L. Ho, Leslie F. Greengard

Publication date: 15 October 2014

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1212.3521

zbMATH Keywords

numerical examplesfast algorithmsradial basis functionsQR factorizationweighted least squaresmatrix compressiondeferred correctionrecursive skeletonizationhierarchically block separable matricessparse QR decompositionupdating/downdating

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (4)

Hierarchical Matrix Approximation for Kernel-Based Scattered Data Interpolation ⋮ Factorization, Symmetrization, and Truncated Transformation of Radial Basis Function-GA Stabilized Gaussian Radial Basis Functions ⋮ Hierarchical Interpolative Factorization for Elliptic Operators: Integral Equations ⋮ Efficient randomized tensor-based algorithms for function approximation and low-rank kernel interactions

Uses Software

• ATLAS

This page was built for publication: A Fast Semidirect Least Squares Algorithm for Hierarchically Block Separable Matrices