Optimal expansion of subspaces for eigenvector approximations

Eigenvector approximate dichotomic basis

Eigenvector approximate dichotomic basis method for solving hyper-sensitive optimal control problems

✍ Anil V. Rao; Kenneth D. Mease 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB

The dichotomic basis method is further developed for solving completely hyper-sensitive Hamiltonian boundary value problems arising in optimal control. For this class of problems, the solution can be accurately approximated by concatenating an initial boundary-layer segment, an equilibrium segment,

Eigenvector approximate dichotomic basis

Eigenvector approximate dichotomic basis method for solving hyper- sensitive optimal control problems

✍ Anil V. Rao; Kenneth D. Mease 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 207 KB

The dichotomic basis method is further developed for solving completely hyper-sensitive Hamiltonian boundary value problems arising in optimal control. For this class of problems, the solution can be accurately approximated by concatenating an initial boundary-layer segment, an equilibrium segment,

Remarks about the construction of optima

Remarks about the construction of optimal subspaces of approximants of a Hilbert space

✍ Jean-Pierre Aubin 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 719 KB

Error estimates for Krylov subspace appr

Error estimates for Krylov subspace approximations of matrix exponentials

✍ D.E. Stewart; T.S. Leyk 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 402 KB

An algorithm for the computation of stri

An algorithm for the computation of strict approximations in subspaces of spline functions

✍ Hans Strauss 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 790 KB

Method of successive approximations for

Method of successive approximations for solution of optimal control problems

✍ F. L. Chernousko; A. A. Lyubushin 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 771 KB