Abstract
In this article, we extend to the full-rank linear least square problem a Martínez & Sanabria result [3], which reduces the cost of the standard algorithm to compute the jackknife estimator for the linear least square problem when, beside the initial problem, all the involved subproblems are full rank.
Keywords
References
R. Behar & M. Yepes. Sobre algunas técnicas de remuestreo: El método de jackknife. Heurística 5 (6) (1991), 49-58.
J. E. Dennis & R. B. Schnabel. Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Prentice Hall, Engelwood Cliffs NJ, 1983.
H. J. Martínez & A. M. Sanabria. Cálculo eficiente del estimador jackknife para mínimos cuadrados lineales bajo condiciones de unicidad. Matemáticas: Enseñanza Universitaria, 8 (1-2) (2000), 29–43.
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Copyright (c) 2023 https://creativecommons.org/licenses/by-nc-nd/4.0