AN EFFICIENT ALGORITHM FOR THE CLASSICAL LEAST SQUARES APPROXIMATION

Detalhes bibliográficos
Autor(a) principal: Dimitrov, Dimitar K. [UNESP]
Data de Publicação: 2020
Outros Autores: Peixoto, Lourenco L.
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Institucional da UNESP
Texto Completo: http://dx.doi.org/10.1137/19M1259936
http://hdl.handle.net/11449/209807
Resumo: We explore the computational issues concerning a new algorithm for the classical least-squares approximation of N samples by an algebraic polynomial of degree at most n when the number N of the samples is very large. The algorithm is based on a recent idea about accurate numerical approximations of sums with large numbers of terms. For a fixed n, the complexity of our algorithm in double precision accuracy is O(1). It is faster and more precise than the standard algorithm in MATLAB.
id UNSP_c7c0d8072a468d5eafbabf0a42f3327c
oai_identifier_str oai:repositorio.unesp.br:11449/209807
network_acronym_str UNSP
network_name_str Repositório Institucional da UNESP
repository_id_str 2946
spelling AN EFFICIENT ALGORITHM FOR THE CLASSICAL LEAST SQUARES APPROXIMATIONleast squares approximationGaussian quadratureorthogonal Gram polynomialsWDDK methodNewton-Raphson methodGolub-Welsch algorithmWe explore the computational issues concerning a new algorithm for the classical least-squares approximation of N samples by an algebraic polynomial of degree at most n when the number N of the samples is very large. The algorithm is based on a recent idea about accurate numerical approximations of sums with large numbers of terms. For a fixed n, the complexity of our algorithm in double precision accuracy is O(1). It is faster and more precise than the standard algorithm in MATLAB.Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)Univ Estadual Paulista, Dept Matemat, IBILCE, BR-15054000 Sao Jose Do Rio Preto, SP, BrazilInst Fed Minas Gerais, Dept Matemat, BR-36415000 Congonhas, MG, BrazilUniv Estadual Paulista, Dept Matemat, IBILCE, BR-15054000 Sao Jose Do Rio Preto, SP, BrazilFAPESP: 2016/09906-0CNPq: 306136/2017-1CAPES: 23038010617201/334Siam PublicationsUniversidade Estadual Paulista (Unesp)Inst Fed Minas GeraisDimitrov, Dimitar K. [UNESP]Peixoto, Lourenco L.2021-06-25T12:29:53Z2021-06-25T12:29:53Z2020-01-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleA3233-A3249http://dx.doi.org/10.1137/19M1259936Siam Journal On Scientific Computing. Philadelphia: Siam Publications, v. 42, n. 5, p. A3233-A3249, 2020.1064-8275http://hdl.handle.net/11449/20980710.1137/19M1259936WOS:000600650100011Web of Sciencereponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengSiam Journal On Scientific Computinginfo:eu-repo/semantics/openAccess2021-10-23T19:50:02Zoai:repositorio.unesp.br:11449/209807Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462024-08-05T21:57:05.903281Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false
dc.title.none.fl_str_mv AN EFFICIENT ALGORITHM FOR THE CLASSICAL LEAST SQUARES APPROXIMATION
title AN EFFICIENT ALGORITHM FOR THE CLASSICAL LEAST SQUARES APPROXIMATION
spellingShingle AN EFFICIENT ALGORITHM FOR THE CLASSICAL LEAST SQUARES APPROXIMATION
Dimitrov, Dimitar K. [UNESP]
least squares approximation
Gaussian quadrature
orthogonal Gram polynomials
WDDK method
Newton-Raphson method
Golub-Welsch algorithm
title_short AN EFFICIENT ALGORITHM FOR THE CLASSICAL LEAST SQUARES APPROXIMATION
title_full AN EFFICIENT ALGORITHM FOR THE CLASSICAL LEAST SQUARES APPROXIMATION
title_fullStr AN EFFICIENT ALGORITHM FOR THE CLASSICAL LEAST SQUARES APPROXIMATION
title_full_unstemmed AN EFFICIENT ALGORITHM FOR THE CLASSICAL LEAST SQUARES APPROXIMATION
title_sort AN EFFICIENT ALGORITHM FOR THE CLASSICAL LEAST SQUARES APPROXIMATION
author Dimitrov, Dimitar K. [UNESP]
author_facet Dimitrov, Dimitar K. [UNESP]
Peixoto, Lourenco L.
author_role author
author2 Peixoto, Lourenco L.
author2_role author
dc.contributor.none.fl_str_mv Universidade Estadual Paulista (Unesp)
Inst Fed Minas Gerais
dc.contributor.author.fl_str_mv Dimitrov, Dimitar K. [UNESP]
Peixoto, Lourenco L.
dc.subject.por.fl_str_mv least squares approximation
Gaussian quadrature
orthogonal Gram polynomials
WDDK method
Newton-Raphson method
Golub-Welsch algorithm
topic least squares approximation
Gaussian quadrature
orthogonal Gram polynomials
WDDK method
Newton-Raphson method
Golub-Welsch algorithm
description We explore the computational issues concerning a new algorithm for the classical least-squares approximation of N samples by an algebraic polynomial of degree at most n when the number N of the samples is very large. The algorithm is based on a recent idea about accurate numerical approximations of sums with large numbers of terms. For a fixed n, the complexity of our algorithm in double precision accuracy is O(1). It is faster and more precise than the standard algorithm in MATLAB.
publishDate 2020
dc.date.none.fl_str_mv 2020-01-01
2021-06-25T12:29:53Z
2021-06-25T12:29:53Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://dx.doi.org/10.1137/19M1259936
Siam Journal On Scientific Computing. Philadelphia: Siam Publications, v. 42, n. 5, p. A3233-A3249, 2020.
1064-8275
http://hdl.handle.net/11449/209807
10.1137/19M1259936
WOS:000600650100011
url http://dx.doi.org/10.1137/19M1259936
http://hdl.handle.net/11449/209807
identifier_str_mv Siam Journal On Scientific Computing. Philadelphia: Siam Publications, v. 42, n. 5, p. A3233-A3249, 2020.
1064-8275
10.1137/19M1259936
WOS:000600650100011
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv Siam Journal On Scientific Computing
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv A3233-A3249
dc.publisher.none.fl_str_mv Siam Publications
publisher.none.fl_str_mv Siam Publications
dc.source.none.fl_str_mv Web of Science
reponame:Repositório Institucional da UNESP
instname:Universidade Estadual Paulista (UNESP)
instacron:UNESP
instname_str Universidade Estadual Paulista (UNESP)
instacron_str UNESP
institution UNESP
reponame_str Repositório Institucional da UNESP
collection Repositório Institucional da UNESP
repository.name.fl_str_mv Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)
repository.mail.fl_str_mv
_version_ 1808129377150435328

Registros relacionados