Efficient Approximation of Structured Linear Operators using Randomized One-Sided Queries (Q7367834)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
No description defined
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient Approximation of Structured Linear Operators using Randomized One-Sided Queries |
No description defined |
Statements
Efficient Approximation of Structured Linear Operators using Randomized One-Sided Queries (English)
0 references
5 October 2026
0 references
math.NA
0 references
Esther Gallmeier
0 references
Samuel E. Otto
0 references
We extend a fixed-sparsity matrix approximation algorithm to use randomized one-sided queries for approximating structured linear operators with local row-space information, achieving query complexity of O(log^d(ε^-1 δ^-1/2) log(ε^-1)) for Hilbert-Schmidt integral operators on d-dimensional spaces.
0 references
Structured Linear Operators
0 references
Randomized One-Sided Queries
0 references
Approximation Algorithms
0 references
Adjoints-Free
0 references
