An interval algorithm for solving systems of linear equations to prespecified accuracy (Q760758): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3883515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4058015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055065 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3878653 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for solving linear algebraic equations using residue arithmetic I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3207999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4067292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank

Latest revision as of 15:36, 14 June 2024

scientific article
Language Label Description Also known as
English
An interval algorithm for solving systems of linear equations to prespecified accuracy
scientific article

    Statements

    An interval algorithm for solving systems of linear equations to prespecified accuracy (English)
    0 references
    0 references
    0 references
    0 references
    1985
    0 references
    We describe an interval arithmetic algorithm for solving a special class of simultaneous linear equations. This class includes but is not limited to systems \(Ax=b\) where A and b have integer entries. The algorithm uses fixed point arithmetic, and has two properties which distinguish it from earlier algorithms: given the absolute accuracy \(\epsilon\) desired, the algorithm uses only as much precision as needed to achieve it, and the algorithm can adjust its own parameters to minimize computation time.
    0 references
    fixed point arithmetic
    0 references
    interval arithmetic
    0 references

    Identifiers