Scaling the “memory wall” for multi-dimensional seismic processing with algebraic compression on cerebras cs-2 systems
We exploit the high memory bandwidth of AI-customized Cerebras CS-2 systems for seismic
processing. By leveraging low-rank matrix approximation, we fit memory-hungry seismic …
processing. By leveraging low-rank matrix approximation, we fit memory-hungry seismic …
Meeting the real-time challenges of ground-based telescopes using low-rank matrix computations
Adaptive Optics (AO) is a technology that permits to measure and mitigate the distortion
effects of atmospheric turbulence on optical beams. AO must operate in real-time by …
effects of atmospheric turbulence on optical beams. AO must operate in real-time by …
Solving linear systems on a GPU with hierarchically off-diagonal low-rank approximations
C Chen, PG Martinsson - SC22: International Conference for …, 2022 - ieeexplore.ieee.org
We are interested in solving linear systems arising from three applications:(1) kernel
methods in machine learning,(2) discretization of boundary integral equations from …
methods in machine learning,(2) discretization of boundary integral equations from …
A framework to exploit data sparsity in tile low-rank cholesky factorization
We present a general framework that couples the PaRSEC runtime system and the HiCMA
numerical library to solve challenging 3D data-sparse problems. Though formally dense …
numerical library to solve challenging 3D data-sparse problems. Though formally dense …
Accelerating seismic redatuming using tile low-rank approximations on NEC SX-Aurora TSUBASA
With the aim of imaging subsurface discontinuities, seismic data recorded at the surface of
the Earth must be numerically re-positioned at locations in the subsurface where reflections …
the Earth must be numerically re-positioned at locations in the subsurface where reflections …
Towards faster and robust solution for dynamic LR and QR factorization
F Zhuang, H He, A Ye, L Zou - Scientific Reports, 2024 - nature.com
Dynamic LR and QR factorization are fundamental problems that exist widely in the control
field. However, the existing solutions under noises are lack of convergence speed and anti …
field. However, the existing solutions under noises are lack of convergence speed and anti …
Block Low-Rank Matrices with Shared Bases: Potential and Limitations of the BLR Format
We investigate a special class of data sparse rank-structured matrices that combine a flat
block low-rank (BLR) partitioning with the use of shared (called nested in the hierarchical …
block low-rank (BLR) partitioning with the use of shared (called nested in the hierarchical …
High performance computing seismic redatuming by inversion with algebraic compression and multiple precisions
We present a high-performance implementation of Seismic Redatuming by Inversion (SRI),
which combines algebraic compression with mixed-precision (MP) computations. Seismic …
which combines algebraic compression with mixed-precision (MP) computations. Seismic …
Factor Fitting, Rank Allocation, and Partitioning in Multilevel Low Rank Matrices
We consider multilevel low rank (MLR) matrices, defined as a row and column permutation
of a sum of matrices, each one a block diagonal refinement of the previous one, with all …
of a sum of matrices, each one a block diagonal refinement of the previous one, with all …
High-performance 3D unstructured mesh deformation using rank structured matrix computations
The Radial Basis Function (RBF) technique is an interpolation method that produces high-
quality unstructured adaptive meshes. However, the RBF-based boundary problem …
quality unstructured adaptive meshes. However, the RBF-based boundary problem …