Techniques which accelerate the convergence of first order iterations automatically (Q1070760): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Andrew J. Hughes Hallett / rank
Normal rank
 
Property / author
 
Property / author: Andrew J. Hughes Hallett / 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.1016/0024-3795(85)90210-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2142343015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated Overrelaxation Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: The optimal solution of the extrapolation problem of a first order scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expected loss and mean square error reductions of risk sensitive decisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternative techniques for solving systems of nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5553606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5723445 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5604166 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:52, 17 June 2024

scientific article
Language Label Description Also known as
English
Techniques which accelerate the convergence of first order iterations automatically
scientific article

    Statements

    Techniques which accelerate the convergence of first order iterations automatically (English)
    0 references
    1985
    0 references
    Die Šislersche Methode zur iterativen Lösung linearer Gleichungssysteme wird zur Lösung nichtlinearer Gleichungssysteme angewandt. Dabei wird ein Parameter vorgegeben und der andere angeblich günstig durch eine Regel von Schritt zu Schritt neu bestimmt. Die Regel basiert auf der im allgemeinen falschen Annahme, daß mit \(y^{(n+1)}=Gy^{(n)}+c\) gilt \(\rho (G)=\lim_{n\to \infty}y_ i^{(n)}/y_ i^{(n-1)}\).
    0 references
    automatic convergence acceleration
    0 references
    optimal extrapolation
    0 references
    Šisler's method
    0 references
    parameter choice
    0 references

    Identifiers