Jump to Content
View Cart
Logged Out Log In
J. Soc. Indust. and Appl. Math. 10, pp. 196-210 (15 pages)
A Dynamic Programming Approach to Sequencing Problems
Alerts
Alert Me When Cited
Alert Me When Corrected
Tools
Download Citation
Add to MyScitation
Blog This Article
Print-Friendly
Research Toolkit
Share
Email Abstract
Connotea
CiteULike
del.icio.us
BibSonomy
Tweet this Article
Add to Facebook
Logged Out Log In
In this paper we give rigorous a priori error bounds for the eigenvalues computed by a number of techniques based upon orthogonal transformations. In order to give as concise a treatment as possible all the techniques are analyzed in exactly the same way although in some cases marginally better results could be obtained by a different treatment. A bound for the Givens’ process has been obtained previously by Givens [5], though the analysis given here is simpler and the bound somewhat sharper. Bo...
J. Soc. Indust. and Appl. Math. 10, pp. 196-210 (15 pages)
Banner art adapted from a figure by Hinke M. Osinga and Bernd Krauskopf (University of Bristol, UK).
ALL SIAM Content
Scitation
Google Scholar