A Time-Dependent Dirichlet-Neumann Method for the Heat Equation

We present a waveform relaxation version of the Dirichlet-Neumann method for parabolic problem. Like the Dirichlet-Neumann method for steady problems, the method is based on a non-overlapping spatial domain decomposition, and the iteration involves subdomain solves with Dirichlet boundary conditions followed by subdomain solves with Neumann boundary conditions. However, each subdomain problem is now in space and time, and the interface conditions are also time-dependent. Using a Laplace transform argument, we show for the heat equation that when we consider finite time intervals, the Dirichlet-Neumann method converges, similar to the case of Schwarz waveform relaxation algorithms. The convergence rate depends on the length of the subdomains as well as the size of the time window. In this discussion, we only stick to the linear bound. We illustrate our results with numerical experiments.Comment: 9 pages, 5 figures, Lecture Notes in Computational Science and Engineering, Vol. 98, Springer-Verlag 201

Optimized Waveform Relaxation Solution of Electromagnetic and Circuit Problems

New algorithms are needed to solve electromagnetic problems using today\u27s widely available parallel processors. In this paper, we show that applying the optimized waveform relaxation approach to a partial element equivalent circuit will yield a powerful technique for solving electromagnetic problems with the potential for a large number of parallel processor nodes

Shared Memory Pipelined Parareal

For the parallel-in-time integration method Parareal, pipelining can be used to hide some of the cost of the serial correction step and improve its efficiency. The paper introduces an OpenMP implementation of pipelined Parareal and compares it to a standard MPI-based variant. Both versions yield almost identical runtimes, but, depending on the compiler, the OpenMP variant consumes about 7% less energy and has a significantly smaller memory footprint. However, its higher implementation complexity might make it difficult to use in legacy codes and in combination with spatial parallelisation

Schwarz Waveform Relaxation Methods for Systems of Semi-Linear Reaction-Diffusion Equations

Domain decomposition methods in science and engineering XIX, LNCSE, Springer Verlag, 2010.Schwarz waveform relaxation methods have been studied for a wide range of scalar linear partial differential equations (PDEs) of parabolic and hyperbolic type. They are based on a space-time decomposition of the computational domain and the subdomain iteration uses an overlapping decomposition in space. There are only few convergence studies for non-linear PDEs. We analyze in this paper the convergence of Schwarz waveform relaxation applied to systems of semi-linear reaction-diffusion equations. We show that the algorithm converges linearly under certain conditions over long time intervals. We illustrate our results, and further possible convergence behavior, with numerical experiments

Asymptotic Analysis for Overlap in Waveform Relaxation Methods for RC Type Circuits

Waveform relaxation (WR) methods are based on partitioning large circuits into sub-circuits which then are solved separately for multiple time steps in so-called time windows, and an iteration is used to converge to the global circuit solution in each time window. Classical WR converges quite slowly, especially when long time windows are used. To overcome this issue, optimized WR (OWR) was introduced which is based on optimized transmission conditions that transfer information between the sub-circuits more efficiently than classical WR. We study here for the first time the influence of overlapping sub-circuits in both WR and OWR applied to RC circuits. We give a circuit interpretation of the new transmission conditions in OWR and derive closed-form asymptotic expressions for the circuit elements representing the optimization parameter in OWR. Our analysis shows that the parameter is quite different in the overlapping case, compared to the nonoverlapping one. We then show numerically that our optimized choice performs well, also for cases not covered by our analysis. This paper provides a general methodology to derive optimized parameters and can be extended to other circuits or system of differential equations or space-time PDEs.Comment: 23 Pages, 15 Figure

Transformação de algodão (Gossypium Hirsutum L.) através do uso de policátion.

bitstream/CNPA/21492/1/CIRTEC81.pd

A cDNA sequence coding for a glutamic acid-rich protein is differentially expressed in cassava storage roots.

Made available in DSpace on 2018-05-31T00:34:48Z (GMT). No. of bitstreams: 1 ID273271.pdf: 265314 bytes, checksum: 0547c39f6a9f6c55e7d56d8b9cc77028 (MD5) Previous issue date: 2006-09-1