Periodic chaotic relaxation
Linear Algebra and its ApplicationsPublished 1 April 1971
J. D. P. Donnelly
Citations35
SJR quartileQ1
SJR score0.98
SNIP1.40
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
A recent paper considered the subject of chaotic relaxation. The present paper generalizes two results of that paper concerning periodic chaotic relaxation in which overrelaxation is allowed. One of these generalizations is illustrated with an example in which the optimum rate of convergence is shown to be 0(h2), where h is the mesh length, as against 0(h) for standard relaxation.
Keywords
Physics and Astronomy
Springer series in computational mathematicsMatrix Iterative Analysis
5,787 Citations2000Richard S. Varga
Proceedings of the Royal Society of London A Mathematical and Physical SciencesThe general theory of relaxation methods applied to linear systems
63 Citations1939G. Temple
Proceedings of the Royal Society of London A Mathematical and Physical SciencesRelaxtion methods applied to engineering problems II. Basic theory, with application to surveying and to electrical networks, and an extension to gyrostatic systems.
11 Citations1938A. N. Black
The aim of the present paper is to prove that relaxation methods, applied systematically to problems of elastic equilibrium, give solutions which converge steadily towards exact results, and to show that they are applicable to any “minimal” problem, e.