Note on the Line Over-relaxation Factor for Small Mesh Size
نویسندگان
چکیده
منابع مشابه
Estimation of the Relaxation Factor for Small Mesh Size
Recently Frankel [1] and Young [3, 4] have developed a method of successive overrelaxation for the solution of the difference equation analogue of the Dirichlet problem for a linear elliptic partial differential equation. The purpose of this note is to present a simple asymptotic theory of the overrelaxation process which depends on the assumption that the mesh size h approaches zero, but which...
متن کاملEffect of Phantom Size and Tube Voltage on the Size-Conversion Factor for Patient Dose Estimation in Computed Tomography Examinations
Introduction: This study aimed to establish the conversion factors to normalize the output dose of volumetric computed tomography dose index (CTDIvol) to the patient dose (i.e. size-specific dose estimate (SSDE)) for various phantom diameters and tube voltages. Material and Methods: In-house cylindrical acrylic phantoms with physical diameter...
متن کاملA Note on Off-Line Permutation Routing on a Mesh-Connected Processor Array
We show how to off-line route any permutation of a n X n meshconnected processor array in 2.5n 3 steps with at most 6 packets per processor per time step and in 2.25n +3 steps with at most 8 packets per processor per time step.
متن کاملA Note on Windowing for the Waveform Relaxation
The technique of windowing has been often used in the implementation of the waveform relaxations for solving ODEs or time dependent PDEs. Its efciency depends upon problem sti ness and operator splitting. Using model problems, the estimates for window length and convergence rate are derived. The e ectiveness of windowing is then investigated for non-sti and sti cases respectively. It concludes ...
متن کاملA note on small on-line Ramsey numbers for paths and their generalization
In this note, we consider the on-line Ramsey numbers R(Pn) for paths and their generalization. The standard on-line Ramsey game is played on an unbounded set of vertices, whereas the new variant of the game we consider is the game where the number of vertices is bounded. Using a computer cluster of 80 processors, we ‘calculated’ some new values for short paths, both for the generalized on-line ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1962
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/5.1.48