Chebyshev approximation of exponential data

In this paper we present an algorithm to fit data via exponentials when the error is measured using the max-norm. We prove the necesssary results to show that the algorithm will converge to the best approximation no matter the dataset.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/29/2023

Optimal Polynomial Approximation to Rational Matrix Functions Using the Arnoldi Algorithm

Given an n by n matrix A and an n-vector b, along with a rational functi...
research
10/22/2020

Optimal Approximation – Smoothness Tradeoffs for Soft-Max Functions

A soft-max function has two main efficiency measures: (1) approximation ...
research
01/25/2019

The conjugate gradient algorithm on well-conditioned Wishart matrices is almost deteriministic

We prove that the number of iterations required to solve a random positi...
research
04/06/2018

Optimisation of Least Squares Algorithm: A Study of Frame Based Programming Techniques in Horizontal Networks

Least squares estimation, a regression technique based on minimisation o...
research
07/25/2023

Differential approximation of the Gaussian by short cosine sums with exponential error decay

In this paper we propose a method to approximate the Gaussian function o...
research
09/15/2022

The power of random information for numerical approximation and integration

This thesis investigates the quality of randomly collected data by emplo...
research
12/28/2017

Spectral Methods in the Presence of Discontinuities

Spectral methods provide an elegant and efficient way of numerically sol...

Please sign up or login with your details

Forgot password? Click here to reset