RT info:eu-repo/semantics/bachelorThesis
T1 Aproximación polinómica por mínimos cuadrados y uniforme
A1 Hernández Felipe, Maryam
K1 Mejor aproximación -- Mínimos cuadrados --Minimax -- Algoritmo de Remez.
K1 Mejor aproximación
K1 Mínimos cuadrados
K1 Minimax
K1 Algoritmo de Remez
K1 Best approximation
K1 Least squares
K1 Remez Algorithm
AB This report aims to deepen the study of polynomial approximationin normed spaces. To begin with, we will develope the study of polynomial least squares approximation. First step will be to introduceconcepts such as pre-Hilbert space or Gram matrix, after that crucialresults for our project will be presented and applications for discreteand continuous cases will be shown. From the Section 1.4 on, we willdelve into orthogonal polynomials to start with the second chapter inwhich approach to normed spaces will be developed. In this chapter, results and conditions for the existence and uniqueness of thebest approximation in normed spaces will be obtained, with a strongfocus on uniform norm. To conclude this project, the “Remez Algorithm” will be presented as a recursive algorithm for obtaining thebest uniform polynomial approximation and we will finish with itsimplementation in MATLAB by displaying concrete examples.
YR 2021
FD 2021
LK http://riull.ull.es/xmlui/handle/915/24108
UL http://riull.ull.es/xmlui/handle/915/24108
LA es
DS Repositorio institucional de la Universidad de La Laguna
RD 13-jul-2025