Chebyshev and $l^1 $-Solutions of Linear Equations Using Least Squares Solutions

Abstract

Previous article Next article Chebyshev and $l^1 $-Solutions of Linear Equations Using Least Squares SolutionsC. S. Duris and V. P. SreedharanC. S. Duris and V. P. Sreedharanhttps://doi.org/10.1137/0705040PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] E. Ya. Remez, General computation methods for Čebyšev approximation. Problems with real parameters entering linearly, Izdat. Akad. Nauk Ukrainsk. SSR. Kiev, 1957, 454–, A translation is available through the Office of Technical Services, Department of Commerce, Washington, D. C. MR0088788 Google Scholar[2] Alston S. Householder, The theory of matrices in numerical analysis, Blaisdell Publishing Co. Ginn and Co. New York-Toronto-London, 1964xi+257 MR0175290 0161.12101 Google Scholar[3] H. S. Wilf, A. Ralston and , Herbert S. Wilf, Matrix inversion by the method of rank annihilationMathematical methods for digital computers, Wiley, New York, 1960, 73–77 MR0117911 Google Scholar[4] Eduard L. Stiefel, An introduction to numerical mathematics, Translated by Werner C. Rheinboldt and Cornelie J. Rheinboldt, Academic Press, New York, 1963x+286 MR0181077 0154.16702 Google Scholar[5] D. Jackson, The Theory of Approximation, American Mathematical Society, Providence, 1930 56.0936.01 Google Scholar[6] M. S. Bartlett, An inverse matrix adjustment arising in discriminant analysis, Ann. Math. Statistics, 22 (1951), 107–111 MR0040068 0042.38203 CrossrefISIGoogle Scholar[7] C. De La Vallée Poussin, Sur la méthode de l'approximation minimum, Ann. Soc. Sci. Bruxelles, 35 (1911), 1–16, Seconde Partie, Mémoires 42.0255.02 Google Scholar[8] David Moursund, Chebyshev solution of $n+1$ linear equations in n unknowns, J. Assoc. Comput. Mach., 12 (1965), 383–387 MR0182139 0142.11505 CrossrefISIGoogle Scholar[9] E. W. Cheney, Introduction to approximation theory, McGraw-Hill Book Co., New York, 1966xii+259 MR0222517 0161.25202 Google Scholar[10] John R. Rice, The approximation of functions. Vol. I: Linear theory, Addison-Wesley Publishing Co., Reading, Mass.-London, 1964xi+203 MR0166520 0114.27001 Google Scholar[11] Allen A. Goldstein and , Ward Cheney, A finite algorithm for the solution of consistent linear equations and inequalities and for the Tchebycheff approximation of inconsistent linear equations, Pacific J. Math., 8 (1958), 415–427 MR0101505 0084.01902 CrossrefGoogle Scholar Previous article Next article FiguresRelatedReferencesCited byDetails Theoretical Upperbound of the Spurious-Free Dynamic Range in Direct Digital Frequency Synthesizers Realized by Polynomial Interpolation MethodsIEEE Transactions on Circuits and Systems I: Regular Papers, Vol. 54, No. 10 Cross Ref Minimum ℓ1, ℓ2, and ℓ∞ Norm Approximate Solutions to an Overdetermined System of Linear EquationsDigital Signal Processing, Vol. 12, No. 4 Cross Ref An algorithm for estimating the parameters in multiple linear regression model with linear constraintsComputers & Industrial Engineering, Vol. 28, No. 4 Cross Ref Minimization technique for a convex function with application to multiple regression model27 June 2007 | Optimization, Vol. 19, No. 2 Cross Ref THE CHEBYSHEV ADJUSTMENT OF A GEODETIC LEVELLING NETWORK19 July 2013 | Survey Review, Vol. 28, No. 220 Cross Ref The Chebyshev solution of the linear matrix equationAX+YB=CNumerische Mathematik, Vol. 46, No. 3 Cross Ref On a particular case of the inconsistent linear matrix equation AX+YB=CLinear Algebra and its Applications, Vol. 66 Cross Ref Discrete Chebyshev Approximation with Linear ConstraintsMichael Brannigan14 July 2006 | SIAM Journal on Numerical Analysis, Vol. 22, No. 1AbstractPDF (1337 KB)The strict Chebyshev solution of overdetermined systems of linear equations with rank deficient matrixNumerische Mathematik, Vol. 40, No. 3 Cross Ref Computational methods of linear algebraJournal of Soviet Mathematics, Vol. 15, No. 5 Cross Ref Least absolute values estimation: an introduction27 June 2007 | Communications in Statistics - Simulation and Computation, Vol. 6, No. 4 Cross Ref An overdetermined linear systemJournal of Approximation Theory, Vol. 18, No. 3 Cross Ref Annotated Bibliography on Generalized Inverses and Applications Cross Ref Chebyshev solution of overdetermined systems of linear equationsBIT, Vol. 15, No. 2 Cross Ref A new algorithm for the Chebyshev solution of overdetermined linear systems1 January 1974 | Mathematics of Computation, Vol. 28, No. 125 Cross Ref A Finite Step Algorithm for Determining the “Strict” Chebyshev Solution to $Ax=b$C. S. Duris and M. G. Temple14 July 2006 | SIAM Journal on Numerical Analysis, Vol. 10, No. 4AbstractPDF (787 KB)Least squares algorithms for finding solutions of overdetermined linear equations which minimize error in an abstract normNumerische Mathematik, Vol. 17, No. 5 Cross Ref Note on the fitting of non-equispaced two-dimensional dataGeoexploration, Vol. 8, No. 1 Cross Ref Solutions of overdetermined linear equations which minimize error in an abstract normNumerische Mathematik, Vol. 13, No. 2 Cross Ref Volume 5, Issue 3| 1968SIAM Journal on Numerical Analysis History Submitted:14 November 1966Accepted:06 February 1968Published online:14 July 2006 InformationCopyright © 1968 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/0705040Article page range:pp. 491-505ISSN (print):0036-1429ISSN (online):1095-7170Publisher:Society for Industrial and Applied Mathematics