No label defined (Q3750041)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3986540
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3986540 |
Statements
1986
0 references
numerical experiments
0 references
computer arithmetic
0 references
ill-posed problems
0 references
harmonic continuation
0 references
stiff systems
0 references
ill-conditioned systems
0 references
directed roudings
0 references
interval arithmetic
0 references
residual corrections
0 references
QR algorithm
0 references
eigenvalues
0 references
conjugate gradient algorithm
0 references
accurate inner products
0 references
convergence
0 references
0.7932487726211548
0 references
0.7336402535438538
0 references
0.7329800128936768
0 references
[For the entire collection see Zbl 0597.00030.] The paper contains the results of some numerical experiments in which some new kinds of computer arithmetic are compared with conventional arithmetics. The first examples are ill-posed problems, in particular the harmonic continuation of a function, after that some stiff systems of differential equations. Both classes of problems lead to ill-conditioned systems of linear equations. For the solution of these linear systems a so-called E-method - which is an arithmetic containing accurate inner products combined with directed roudings, interval arithmetic, and residual corrections - is shown to be superior to conventional methods. In the further examples the QR algorithm for computing eigenvalues and the conjugate gradient algorithm for the iterative solution of a linear system are treated. It is demonstrated how far the use of accurate inner products can reduce rounding errors and can influence the convergence behaviour of the algorithms.
0 references