Verification of positive definiteness (Q2502318): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(5 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: INTLAB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: mctoolbox / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Harwell-Boeing sparse matrix collection / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10543-006-0056-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2002757059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error bounds on complex floating-point multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accuracy and Stability of Numerical Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342712 / rank
 
Normal rank

Revision as of 19:11, 24 June 2024

scientific article
Language Label Description Also known as
English
Verification of positive definiteness
scientific article

    Statements

    Verification of positive definiteness (English)
    0 references
    0 references
    12 September 2006
    0 references
    An efficient numerical criterion to verify positive definiteness of a symmetric or Hermitian matrix is presented. The criterion is based on standard IEEE 754 floating-point arithmetic with rounding to nearest. It implements a single floating-point Cholesky decomposition and improves a known result. A major advantage of the method described is that any library routine can be used. Underflows are allowed so that the verification is rigorous, including all possible effects of rounding errors. Using the criterion an efficient algorithm to compute rigorous error bounds for the solution of linear systems with symmetric positive definite matrix is proposed. A computational criterion to verify that a given symmetric or Hermitian matrix is not positive definite is given as well. Several computational examples demonstrate the effectiveness of the criteria presented.
    0 references
    positive definiteness
    0 references
    self-validating methods
    0 references
    numerical examples
    0 references
    Hermitian matrix
    0 references
    floating-point arithmetic
    0 references
    Cholesky decomposition
    0 references
    rounding errors
    0 references
    algorithm
    0 references
    error bounds
    0 references
    symmetric positive definite matrix
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references