Spectrum

Kai Borre
Additional contact information
Kai Borre: Aalborg University, Danish GPS Center

Chapter 5 in Plane Networks and their Applications, 2001, pp 127-138 from Springer

Abstract: Abstract The spectral density function describes the distribution of eigenvalues of a given problem. Networks may be characterized by the condition number of the normal equation matrix. The spectral condition number is defined as the largest eigenvalue divided by the smallest eigenvalue. Most often this number is several powers of ten. When designing networks the condition number is used as a measure of a good or a bad design. The good design has a low condition number. Therefore it becomes relevant to investigate whether the eigenvalues are dense at the lower and upper part of the spectrum. If they lie dense at both ends, there is little chance to improve the design, while a concentration of eigenvalues at the middle of the spectrum leaves some optimism for achieving a reasonably good design.

Keywords: Condition Number; Small Eigenvalue; Spectral Density Function; Interior Node; Geodetic Network (search for similar items in EconPapers)
Date: 2001
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-0165-6_5

Ordering information: This item can be ordered from
http://www.springer.com/9781461201656

DOI: 10.1007/978-1-4612-0165-6_5

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().