Solving for best linear approximates

06/20/2021
by   Avraham Bourla, et al.
0

Our goal is to finally settle a persistent problem in Diophantine Approximation, that of finding best inhomogeneous linear approximates. Classical results from the theory of continued fractions solve the special homogeneous case in the form of a complete sequence of normal approximates. Real expansions that allow the notion of normality to percolate into the inhomogeneous setting will provide us with the general solution.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/09/2018

On Solving Linear Systems in Sublinear Time

We study sublinear algorithms that solve linear systems locally. In the ...
research
02/17/2020

Shifted Lanczos method for quadratic forms with Hermitian matrix resolvents

Quadratic forms of Hermitian matrix resolvents involve the solutions of ...
research
07/14/2022

Computing Optimal Kernels in Two Dimensions

Let P be a set of n points in ℝ^2. A subset C⊆ P is an ε-kernel of P if ...
research
07/11/2023

Solving Minimal Residual Methods in W^-1,p with large Exponents p

We introduce a numerical scheme that approximates solutions to linear PD...
research
08/27/2021

An explicit vector algorithm for high-girth MaxCut

We give an approximation algorithm for MaxCut and provide guarantees on ...
research
05/20/2023

Vocabulary for Universal Approximation: A Linguistic Perspective of Mapping Compositions

In recent years, deep learning-based sequence modelings, such as languag...

Please sign up or login with your details

Forgot password? Click here to reset