Matrices over a Hilbert space and their low-rank approximation

Fuente: arXiv
Saved in:
Bibliographic Details
Main Author: Budzinskiy, Stanislav
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913826552676352
author Budzinskiy, Stanislav
author_facet Budzinskiy, Stanislav
contents Matrices are typically considered over fields or rings. Motivated by applications in parametric differential equations and data-driven modeling, we suggest to study matrices with entries from a Hilbert space and present an elementary theory of them: from basic properties to low-rank approximation. Specifically, we extend the idea of cross approximation to such matrices and propose an analogue of the adaptive cross approximation algorithm. Our numerical experiments show that this approach can achieve quasioptimal approximation and be integrated with the existing computational software for partial differential equations.
format Preprint
id arxiv_https___arxiv_org_abs_2505_05134
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Matrices over a Hilbert space and their low-rank approximation
Budzinskiy, Stanislav
Numerical Analysis
Matrices are typically considered over fields or rings. Motivated by applications in parametric differential equations and data-driven modeling, we suggest to study matrices with entries from a Hilbert space and present an elementary theory of them: from basic properties to low-rank approximation. Specifically, we extend the idea of cross approximation to such matrices and propose an analogue of the adaptive cross approximation algorithm. Our numerical experiments show that this approach can achieve quasioptimal approximation and be integrated with the existing computational software for partial differential equations.
title Matrices over a Hilbert space and their low-rank approximation
topic Numerical Analysis
url https://arxiv.org/abs/2505.05134