TUHH Open Research
Help
  • Log In
    New user? Click here to register.Have you forgotten your password?
  • English
  • Deutsch
  • Communities & Collections
  • Publications
  • Research Data
  • People
  • Institutions
  • Projects
  • Statistics
  1. Home
  2. TUHH
  3. Publication References
  4. Optimal scaling for p-norms and componentwise distance to singularity
 
Options

Optimal scaling for p-norms and componentwise distance to singularity

Publikationstyp
Journal Article
Date Issued
2003-01-01
Sprache
English
Author(s)
Rump, Siegfried M.  orcid-logo
Institut
Zuverlässiges Rechnen E-19  
TORE-URI
http://hdl.handle.net/11420/8727
Journal
IMA journal of numerical analysis  
Volume
23
Issue
1
Start Page
1
End Page
9
Citation
IMA Journal of Numerical Analysis 1 (23): 1-9 (2003-01-01)
Publisher DOI
10.1093/imanum/23.1.1
Scopus ID
2-s2.0-0345447624
Publisher
Oxford Univ. Press
We give lower and upper bounds for the optimal p-norm condition number achievable by two-sided diagonal scalings. There are no assumptions on the irreducibility of certain matrices. The bounds are shown to be optimal for the 2-norm. For the 1-norm and inf-norm the (known) exact value of the optimal condition number is confirmed. We give means how to calculate the minimizing diagonal matrices. Furthermore, a class of new lower bounds for the componentwise distance to the nearest singular matrix is given. They are shown to be superior to existing ones.
Subjects
Componentwise distance to singularity
Condition number, p-norm
Interval matrix
Optimal scaling
Strongly regular
DDC Class
004: Informatik
510: Mathematik
600: Technik
TUHH
Weiterführende Links
  • Contact
  • Send Feedback
  • Cookie settings
  • Privacy policy
  • Impress
DSpace Software

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science
Design by effective webwork GmbH

  • Deutsche NationalbibliothekDeutsche Nationalbibliothek
  • ORCiD Member OrganizationORCiD Member Organization
  • DataCiteDataCite
  • Re3DataRe3Data
  • OpenDOAROpenDOAR
  • OpenAireOpenAire
  • BASE Bielefeld Academic Search EngineBASE Bielefeld Academic Search Engine
Feedback