Computing the Minimum Eigenvalue of a Symmetric Positive Definite Toeplitz Matrix
Loading...
No Access Until
Permanent Link(s)
Collections
Other Titles
Author(s)
Abstract
A method for computing the smallest eigenvalue of a symmetric positive definite Toeplitz matrix is given. It relies solely upon the Levinson-Durbin algorithm. The procedure involves a combination of bisection and Newton's method. Good starting values are also shown to be obtainable from the Levinson-Durbin algorithm.
Journal / Series
Volume & Issue
Description
Sponsorship
Date Issued
1982-04
Publisher
Cornell University
Keywords
computer science; technical report
Location
Effective Date
Expiration Date
Sector
Employer
Union
Union Local
NAICS
Number of Workers
Committee Chair
Committee Co-Chair
Committee Member
Degree Discipline
Degree Name
Degree Level
Related Version
Related DOI
Related To
Related Part
Based on Related Item
Has Other Format(s)
Part of Related Item
Related To
Related Publication(s)
Link(s) to Related Publication(s)
References
Link(s) to Reference(s)
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR82-527
Government Document
ISBN
ISMN
ISSN
Other Identifiers
Rights
Rights URI
Types
technical report