Accelerated Algorithm for Splitting a Vector into Two Vectors with Small Uniform Norm

We propose a fast algorithm for splitting an arbitrary vector into a sum of two vectors of small uniform norm (with respect to two different bases, of which one is random). The efficiency of the algorithm is supported by numerical experiments.

Authors

Institutions

Publication Details

Journal
Mathematical Notes
Published
2025-10-01
DOI
https://doi.org/10.1134/s0001434625605210
Primary Topic
Stochastic Gradient Optimization Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Accelerated Algorithm for Splitting a Vector into Two Vectors with Small Uniform Norm

I. V. Oseledets, B. S. Kashin, A. A. Rudikov
Mathematical Notes
Stochastic Gradient Optimization Techniques
article

Accelerated Algorithm for Splitting a Vector into Two Vectors with Small Uniform Norm

I. V. Oseledets, B. S. Kashin, A. A. Rudikov
article en

Abstract

We propose a fast algorithm for splitting an arbitrary vector into a sum of two vectors of small uniform norm (with respect to two different bases, of which one is random). The efficiency of the algorithm is supported by numerical experiments.

Mathematical NotesVol. 118(3-4)
Russian Academy of Sciences (RU), Lomonosov Moscow State University (RU), Steklov Mathematical Institute (RU), Artificial Intelligence in Medicine (Canada) (CA), AIRI - Artificial Intelligence Research Institute (RU)
Openalex Percentile: Top 18%
Stochastic Gradient Optimization Techniques
DOISourceOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.