On stable calculation of linear functionals
Author:
SvenAke Gustafson
Journal:
Math. Comp. 33 (1979), 694704
MSC:
Primary 65J05; Secondary 65D30
MathSciNet review:
521283
Fulltext PDF Free Access
Abstract 
References 
Similar Articles 
Additional Information
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.
 [1]
Å. BJÖRCK, "Solving linear least squares problems by GramSchmidtorthogonalization," BIT, v. 7, 1967, pp. 121.
 [2]
C. W. CLENSHAW, "Chebyshev series for mathematical functions," Mathematical Tables, v. 5, National Physical Laboratory, HMSO, London, 1962.
 [3]
Ȧke
Björck and Germund
Dahlquist, Numerical methods, PrenticeHall, Inc., Englewood
Cliffs, N.J., 1974. Translated from the Swedish by Ned Anderson;
PrenticeHall Series in Automatic Computation. MR 0368379
(51 #4620)
 [4]
K. GLASHOFF & S.Å. GUSTAFSON, Einführung in die lineare Optimierung, Wissenschaftliche Buchgesellschaft, Darmstadt, 1978.
 [5]
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 (39 #6513), http://dx.doi.org/10.1090/S0025571869996471
 [6]
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 0278518
(43 #4248), http://dx.doi.org/10.1090/S00255718197002785183
 [7]
SvenȦke
Gustafson, On computational applications of the theory of moment
problems, Proceedings of the International Conference on Padé
Approximants, Continued Fractions and Related Topics (Univ. Colorado,
Boulder, Colo., 1972; dedicated to the memory of H. S. Wall), 1974,
pp. 227–240. MR 0347047
(49 #11767)
 [8]
S.ÅA. GUSTAFSON, "Some optimization problems in numerical analysis," Methods of Operations Research, v. 25, 1977, pp. 367379.
 [9]
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
(83m:65005), http://dx.doi.org/10.1007/BF02252194
 [10]
S.Ȧ.
Gustafson and K.
O. Kortanek, Numerical treatment of a class of semiinfinite
programming problems, Naval Res. Logist. Quart. 20
(1973), 477–504. MR 0329257
(48 #7599)
 [11]
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. Computational
Phys. 24 (1977), no. 1, 81–95. MR 0501784
(58 #19046)
 [12]
Ingrid
Melinder, Accurate approximation in weighted maximum norm by
interpolation, J. Approximation Theory 22 (1978),
no. 1, 33–45. MR 0467090
(57 #6957)
 [13]
A.
C. R. Newbery, Error analysis for polynomial
evaluation, Math. Comp. 28 (1974), 789–793. MR 0373227
(51 #9428), http://dx.doi.org/10.1090/S00255718197403732278
 [14]
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 0208807
(34 #8616)
 [15]
Theodore
J. Rivlin, The Chebyshev polynomials, WileyInterscience [John
Wiley & Sons], New YorkLondonSydney, 1974. Pure and Applied
Mathematics. MR
0450850 (56 #9142)
 [1]
 Å. BJÖRCK, "Solving linear least squares problems by GramSchmidtorthogonalization," BIT, v. 7, 1967, pp. 121.
 [2]
 C. W. CLENSHAW, "Chebyshev series for mathematical functions," Mathematical Tables, v. 5, National Physical Laboratory, HMSO, London, 1962.
 [3]
 G. DAHLQUIST, Å. BJÖRCK & N. ANDERSON, Numerical Methods, PrenticeHall, Englewood Cliffs, N. J., 1974. MR 0368379 (51:4620)
 [4]
 K. GLASHOFF & S.Å. GUSTAFSON, Einführung in die lineare Optimierung, Wissenschaftliche Buchgesellschaft, Darmstadt, 1978.
 [5]
 G. H. GOLUB & J. H. WELSCH, "Calculation of Gauss quadrature rules," Math. Comp., v. 23, 1969, pp. 221230. MR 0245201 (39:6513)
 [6]
 S.Å. GUSTAFSON, "Control and estimation of computational errors in the evaluation of interpolation formulas and quadrature rules," Math. Comp., v. 24, 1970, pp. 847854. MR 0278518 (43:4248)
 [7]
 S.Å. GUSTAFSON, "On computational applications of the theory of moment problems," Rocky Mountain J. Math., v. 4, 1974, pp. 227240. MR 0347047 (49:11767)
 [8]
 S.ÅA. GUSTAFSON, "Some optimization problems in numerical analysis," Methods of Operations Research, v. 25, 1977, pp. 367379.
 [9]
 S.Å. GUSTAFSON, "Convergence acceleration on a general class of power series," Computing, v. 21, 1978, pp. 367379. MR 619912 (83m:65005)
 [10]
 S.Å. GUSTAFSON & K. O. KORTANEK, "Numerical treatment of a class of semiinfinite programming problems," Naval Res. Logist. Quart., v. 20, 1973, pp. 477504. MR 0329257 (48:7599)
 [11]
 S.Å. GUSTAFSON & S. 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. Computational Phys., v. 24, 1977, pp. 8195. MR 0501784 (58:19046)
 [12]
 I. MELINDER, "Accurate approximation in weighted maximum norm by interpolation," J. Approximation Theory, v. 22, 1978, pp. 3345. MR 0467090 (57:6957)
 [13]
 A. C. R. NEWBERY, "Error analysis for polynomial evaluation," Math. Comp., v. 28, 1974, pp. 789793. MR 0373227 (51:9428)
 [14]
 M. J. D. POWELL, "On the maximum norm of polynomial approximation defined by interpolation and by least squares criteria," Comput. J., v. 9, 1967, pp. 404407. MR 0208807 (34:8616)
 [15]
 T. RIVLIN, The Chebyshev polynomials, Wiley, New York, 1974. MR 0450850 (56:9142)
Similar Articles
Retrieve articles in Mathematics of Computation
with MSC:
65J05,
65D30
Retrieve articles in all journals
with MSC:
65J05,
65D30
Additional Information
DOI:
http://dx.doi.org/10.1090/S00255718197905212830
PII:
S 00255718(1979)05212830
Keywords:
Linear functionals,
moment condition,
linear space,
error bound,
duality lemma
Article copyright:
© Copyright 1979
American Mathematical Society
