Formulations and solutions of overdetermined systems of linear equations using the Chebyshev norm
Date
10-1992
Degree
Bachelor of Science in Applied Mathematics
College
College of Arts and Sciences (CAS)
Adviser/Committee Chair
Norberto R. Navarrete Jr.
Abstract
The Chebyshev approximation principle consists of minimizing the maximal absolute value of the residuals through appropriate selection of the unknowns. In this study, the problem of finding the Chebyshev solution of overdetermined systems of linear equations was recast as a linear programming (LP) problem. A comparison of the primal and dual formulations was made with respect to problem size and efficiency in solving the resulting LP problem. Results show that the dual LP algorithm yielded an approximation of the chebyshev solution in lesser number of iterations than the primal LP. Likewise, the chebyshev feature of equal error size was observed.
Language
English
Location
UPLB Main Library Special Collections Section (USCS)
Call Number
Thesis
Recommended Citation
Sison, Marie Antoniette S., "Formulations and solutions of overdetermined systems of linear equations using the Chebyshev norm" (1992). Undergraduate Theses. 10163.
https://www.ukdr.uplb.edu.ph/etd-undergrad/10163
Document Type
Thesis