Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/11236
Title: | High order smoothing splines versus least squares problems on Riemannian manifolds | Authors: | Machado, L. Leite, F. Silva Krakowski, K. |
Keywords: | Riemannian manifolds; Smoothing splines; Lie groups; Least square problems; Geometric polynomials | Issue Date: | 2008 | Publisher: | Centro de Matemática da Universidade de Coimbra | Citation: | Pré-Publicações DMUC. 08-39 (2008) | Abstract: | In this paper, we present a generalization of the classical least squares problem on Euclidean spaces, introduced by Lagrange, to more general Riemannian manifolds. Using the variational definition of Riemannian polynomials, we formulate a high order variational problem on a manifold equipped with a Riemannian metric, which depends on a smoothing parameter and gives rise to what we call smoothing geometric splines. These are curves with a certain degree of smoothness that best fit a given set of points at given instants of time and reduce to Riemannian polynomials when restricted to each subinterval. We show that the Riemannian mean of the given points is achieved as a limiting process of the above. Also, when the Riemannian manifold is an Euclidean space, our approach generates, in the limit, the unique polynomial curve which is the solution of the classical least squares problem. These results support our belief that the approach presented in this paper is the natural generalization of the classical least squares problem to Riemannian manifolds. | URI: | https://hdl.handle.net/10316/11236 | Rights: | openAccess |
Appears in Collections: | FCTUC Eng.Electrotécnica - Vários FCTUC Matemática - Vários |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
High order smoothing splines versus least squares problems.pdf | 263.1 kB | Adobe PDF | View/Open |
Page view(s)
341
checked on Oct 29, 2024
Download(s)
136
checked on Oct 29, 2024
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.