×

zbMATH — the first resource for mathematics

Laguerre series direct method for variational problems. (English) Zbl 0481.49005

MSC:
49J05 Existence theories for free problems in one independent variable
33C45 Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.)
42C05 Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Schechter, R. S.,The Variational Method in Engineering, McGraw-Hill, New York, New York, 1967. · Zbl 0176.10001
[2] Chen, C. F., andHsiao, C. H.,A Walsh Series Direct Method for Solving Variational Problems, Journal of the Franklin Institute, Vol. 300, No. 4, 1975. · Zbl 0339.49017
[3] Sansone, G.,Orthogonal Functions, John Wiley and Sons (Interscience), New York, New York, 1959. · Zbl 0084.06106
[4] Kelley, H. J.,Gradient Theory of Optimal Flight Paths, ARS Journal, Vol. 30, No. 10, 1960. · Zbl 0096.42002
[5] Bryson, A. E., Jr., andDenham, W. F.,A Steepest-Ascent Method for Solving Optimum Programming Problems, Journal of Applied Mechanics, Vol. 84, No. 3, 1962. · Zbl 0112.20003
[6] Miele, A., Pritchard, R. E., andDamoulakis, J. N.,Sequential Gradient Restoration Algorithm for Optimal Control Problems, Journal of Optimization Theory and Applications, Vol. 5, No. 4, 1970. · Zbl 0192.51802
[7] Miele, A., Tietze, J. L., andLevy, A. V.,Summary and Comparison of Gradient-Restoration Algorithms for Optimal Control Problems, Journal of Optimization Theory and Application, Vol. 10, No. 6, 1972. · Zbl 0233.49009
[8] Miele, A.,Recent Advances in Gradient Algorithms for Optimal Control Problems, Journal of Optimization Theory and Application, Vol. 17, Nos. 5/6, 1975. · Zbl 0296.49024
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.