Acceleration of Transverse Waveform Relaxation using waveform compression

Author(s):  
T. Maestri ◽  
I. M. Elfadel ◽  
A. Ruehli
Keyword(s):  
1989 ◽  
Vol 136 (1) ◽  
pp. 38 ◽  
Author(s):  
Y.-H. Jun ◽  
C.-W. Lee ◽  
K.-J. Lee ◽  
S.-B. Park

Author(s):  
Jonas Dünnebacke ◽  
Stefan Turek ◽  
Christoph Lohmann ◽  
Andriy Sokolov ◽  
Peter Zajac

We discuss how “parallel-in-space & simultaneous-in-time” Newton-multigrid approaches can be designed which improve the scaling behavior of the spatial parallelism by reducing the latency costs. The idea is to solve many time steps at once and therefore solving fewer but larger systems. These large systems are reordered and interpreted as a space-only problem leading to multigrid algorithm with semi-coarsening in space and line smoothing in time direction. The smoother is further improved by embedding it as a preconditioner in a Krylov subspace method. As a prototypical application, we concentrate on scalar partial differential equations (PDEs) with up to many thousands of time steps which are discretized in time, resp., space by finite difference, resp., finite element methods. For linear PDEs, the resulting method is closely related to multigrid waveform relaxation and its theoretical framework. In our parabolic test problems the numerical behavior of this multigrid approach is robust w.r.t. the spatial and temporal grid size and the number of simultaneously treated time steps. Moreover, we illustrate how corresponding time-simultaneous fixed-point and Newton-type solvers can be derived for nonlinear nonstationary problems that require the described solution of linearized problems in each outer nonlinear step. As the main result, we are able to generate much larger problem sizes to be treated by a large number of cores so that the combination of the robustly scaling multigrid solvers together with a larger degree of parallelism allows a faster solution procedure for nonstationary problems.


VLSI Design ◽  
1999 ◽  
Vol 9 (2) ◽  
pp. 213-218 ◽  
Author(s):  
S. E.-D. Habib ◽  
G. J. Al-Karim

This paper reports the development of the Cairo University Waveform Relaxation (CUWORX) simulator. In order to accelerate the convergence of the waveform relaxation (WR) in the presence of logic feedback, CUWORK is initialized via a logic simulator. This logic initialization scheme is shown to be highly effective for digital synchronous circuits. Additionally, this logic initialization scheme preserves fully the multi-rate properties of the WR algorithm.


2018 ◽  
Vol 52 (4) ◽  
pp. 1569-1596 ◽  
Author(s):  
Xavier Antoine ◽  
Fengji Hou ◽  
Emmanuel Lorin

This paper is devoted to the analysis of convergence of Schwarz Waveform Relaxation (SWR) domain decomposition methods (DDM) for solving the stationary linear and nonlinear Schrödinger equations by the imaginary-time method. Although SWR are extensively used for numerically solving high-dimensional quantum and classical wave equations, the analysis of convergence and of the rate of convergence is still largely open for linear equations with variable coefficients and nonlinear equations. The aim of this paper is to tackle this problem for both the linear and nonlinear Schrödinger equations in the two-dimensional setting. By extending ideas and concepts presented earlier [X. Antoine and E. Lorin, Numer. Math. 137 (2017) 923–958] and by using pseudodifferential calculus, we prove the convergence and determine some approximate rates of convergence of the two-dimensional Classical SWR method for two subdomains with smooth boundary. Some numerical experiments are also proposed to validate the analysis.


2018 ◽  
Vol 37 (4) ◽  
pp. 4805-4820 ◽  
Author(s):  
S. R. Franco ◽  
C. Rodrigo ◽  
F. J. Gaspar ◽  
M. A. V. Pinto

Sign in / Sign up

Export Citation Format

Share Document