On stable calculation of linear functionals
HTML articles powered by AMS MathViewer
 by SvenȦke Gustafson PDF
 Math. Comp. 33 (1979), 694704 Request permission
Abstract:
In this paper we discuss the recurrent task of evaluating a linear functional defined by (generally infinitely many) linear constraints. We develop a theory for the stability of this problem and suggest a regularization procedure, based on orthogonal expansions. Simple and efficient computational schemes for evaluating the functional numerically are given.References

Å. BJÖRCK, "Solving linear least squares problems by GramSchmidtorthogonalization," BIT, v. 7, 1967, pp. 121.
C. W. CLENSHAW, "Chebyshev series for mathematical functions," Mathematical Tables, v. 5, National Physical Laboratory, HMSO, London, 1962.
 Ȧke Björck and Germund Dahlquist, Numerical methods, PrenticeHall Series in Automatic Computation, PrenticeHall, Inc., Englewood Cliffs, N.J., 1974. Translated from the Swedish by Ned Anderson. MR 0368379 K. GLASHOFF & S.Å. GUSTAFSON, Einführung in die lineare Optimierung, Wissenschaftliche Buchgesellschaft, Darmstadt, 1978.
 Gene H. Golub and John H. Welsch, Calculation of Gauss quadrature rules, Math. Comp. 23 (1969), 221230; addendum, ibid. 23 (1969), no. 106, loose microfiche suppl, A1–A10. MR 0245201, DOI 10.1090/S0025571869996471
 SvenȦke Gustafson, Control and estimation of computational errors in the evaluation of interpolation formulae and quadrature rules, Math. Comp. 24 (1970), 847–854. MR 278518, DOI 10.1090/S00255718197002785183
 SvenȦke Gustafson, On computational applications of the theory of moment problems, Rocky Mountain J. Math. 4 (1974), 227–240. MR 347047, DOI 10.1216/RMJ197442227 S.ÅA. GUSTAFSON, "Some optimization problems in numerical analysis," Methods of Operations Research, v. 25, 1977, pp. 367379.
 S.Ȧ. Gustafson, Convergence acceleration on a general class of power series, Computing 21 (1978/79), no. 1, 53–69 (English, with German summary). MR 619912, DOI 10.1007/BF02252194
 S.Ȧ. Gustafson and K. O. Kortanek, Numerical treatment of a class of semiinfinite programming problems, Naval Res. Logist. Quart. 20 (1973), 477–504. MR 329257, DOI 10.1002/nav.3800200310
 SvenȦke Gustafson and Staffan Lindahl, Numerical computation of an integral appearing in the FrömanFröman phaseintegral formula for calculation of quantal matrix elements without the use of wave functions, J. Comput. Phys. 24 (1977), no. 1, 81–95. MR 501784, DOI 10.1016/00219991(77)901115
 Ingrid Melinder, Accurate approximation in weighted maximum norm by interpolation, J. Approximation Theory 22 (1978), no. 1, 33–45. MR 467090, DOI 10.1016/00219045(78)900692
 A. C. R. Newbery, Error analysis for polynomial evaluation, Math. Comp. 28 (1974), 789–793. MR 373227, DOI 10.1090/S00255718197403732278
 M. J. D. Powell, On the maximum errors of polynomial approximations defined by interpolation and by least squares criteria, Comput. J. 9 (1967), 404–407. MR 208807, DOI 10.1093/comjnl/9.4.404
 Theodore J. Rivlin, The Chebyshev polynomials, Pure and Applied Mathematics, WileyInterscience [John Wiley & Sons], New YorkLondonSydney, 1974. MR 0450850
Additional Information
 © Copyright 1979 American Mathematical Society
 Journal: Math. Comp. 33 (1979), 694704
 MSC: Primary 65J05; Secondary 65D30
 DOI: https://doi.org/10.1090/S00255718197905212830
 MathSciNet review: 521283