The accurate solution of certain continuous problems using only single precision arithmetic (Q1091751): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q3885131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Stability in Problems of Linear Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3319689 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative refinement implies numerical stability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3936129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi double-precision in floating point addition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative improvement without double precision in a boundary value problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3911980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical stability of the Chebyshev method for the solution of large linear systems / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01936142 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1978916107 / rank
 
Normal rank

Latest revision as of 09:17, 30 July 2024

scientific article
Language Label Description Also known as
English
The accurate solution of certain continuous problems using only single precision arithmetic
scientific article

    Statements

    The accurate solution of certain continuous problems using only single precision arithmetic (English)
    0 references
    0 references
    0 references
    1985
    0 references
    Es ist ein bekanntes Phänomen, daß bei der numerischen Lösung kontinuierlicher Probleme mittels Diskretisierung die theoretisch vorhandene Konvergenz infolge von Rundungsfehlern verloren gehen kann. In der vorliegenden Arbeit entwickeln die Autoren für die numerische Integration und die Lösung elliptischer Differentialgleichungen Verfahren, bei denen die Lösungsgenauigkeit die Rechengenauigkeit erreicht.
    0 references
    continuous problem
    0 references
    truncation error
    0 references
    discretization problem
    0 references
    floating point arithmetic
    0 references
    rounding-errors
    0 references
    convergence
    0 references
    Gill-Møller algorithm
    0 references
    iterative refinement
    0 references
    floating point subtraction
    0 references

    Identifiers

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