Type of Publication:  Journal article 
Author:  Garloff, Jürgen 
Year of publication:  2011 
Published in:  Computing ; 94 (2011), 24.  pp. 97107.  ISSN 0010485X.  eISSN 14365057 
DOI (citable link):  https://dx.doi.org/10.1007/s0060701101597 
Summary: 
The paper considers systems of linear interval equations, i. e., linear systems where the coefficients of the matrix and the right hand side vary between given bounds. We focus on symmetric matrices and consider direct methods for the enclosure of the solution set of such a system. One of these methods is the interval Cholesky method which is obtained from the ordinary Cholesky decomposition by replacing the real numbers by the related intervals and the real operations by the respective interval operations. We present a method by which the diagonal entries of the interval Cholesky factor can be tightened for positive definite interval matrices, such that a breakdown of the algorithm can be prevented. In the case of positive definite symmetric Toeplitz matrices, a further tightening of the diagonal entries and also of other entries of the Cholesky factor is possible. Finally, we numerically compare the interval Cholesky method with interval variants of two methods which exploit the Toeplitz structure with respect to the computing time and quality of the enclosure of the solution set.

Subject (DDC):  510 Mathematics 
Keywords:  Positive definite interval matrix, interval Cholesky method, Toeplitz system 
Bibliography of Konstanz:  Yes 
Files  Size  Format  View 

There are no files associated with this item. 
GARLOFF, Jürgen, 2011. Pivot tightening for direct methods for solving symmetric positive definite systems of linear interval equations. In: Computing. 94(24), pp. 97107. ISSN 0010485X. eISSN 14365057. Available under: doi: 10.1007/s0060701101597
@article{Garloff2011Pivot21484, title={Pivot tightening for direct methods for solving symmetric positive definite systems of linear interval equations}, year={2011}, doi={10.1007/s0060701101597}, number={24}, volume={94}, issn={0010485X}, journal={Computing}, pages={97107}, author={Garloff, Jürgen} }
<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22rdfsyntaxns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digitalrepositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.unikonstanz.de/rdf/resource/123456789/21484"> <dcterms:abstract xml:lang="eng">The paper considers systems of linear interval equations, i. e., linear systems where the coefficients of the matrix and the right hand side vary between given bounds. We focus on symmetric matrices and consider direct methods for the enclosure of the solution set of such a system. One of these methods is the interval Cholesky method which is obtained from the ordinary Cholesky decomposition by replacing the real numbers by the related intervals and the real operations by the respective interval operations. We present a method by which the diagonal entries of the interval Cholesky factor can be tightened for positive definite interval matrices, such that a breakdown of the algorithm can be prevented. In the case of positive definite symmetric Toeplitz matrices, a further tightening of the diagonal entries and also of other entries of the Cholesky factor is possible. Finally, we numerically compare the interval Cholesky method with interval variants of two methods which exploit the Toeplitz structure with respect to the computing time and quality of the enclosure of the solution set.</dcterms:abstract> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">20130221T19:51:56Z</dc:date> <dc:contributor>Garloff, Jürgen</dc:contributor> <bibo:uri rdf:resource="http://kops.unikonstanz.de/handle/123456789/21484"/> <dcterms:issued>2011</dcterms:issued> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">20130221T19:51:56Z</dcterms:available> <dcterms:title>Pivot tightening for direct methods for solving symmetric positive definite systems of linear interval equations</dcterms:title> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:language>eng</dc:language> <dcterms:rights rdf:resource="https://kops.unikonstanz.de/page/termsofuse"/> <dcterms:isPartOf rdf:resource="https://kops.unikonstanz.de/rdf/resource/123456789/39"/> <dspace:isPartOfCollection rdf:resource="https://kops.unikonstanz.de/rdf/resource/123456789/39"/> <dc:creator>Garloff, Jürgen</dc:creator> <dcterms:bibliographicCitation>Computing ; 94 (2012), 24.  S. 97107</dcterms:bibliographicCitation> <dc:rights>termsofuse</dc:rights> </rdf:Description> </rdf:RDF>