It is well known that image compositing is the bottleneck in Sort-Last rendering. Many methods have been developed to reduce the compositing time. In this paper, we present a series of pipeline methods for image compo...
详细信息
ISBN:
(纸本)9783642156717
It is well known that image compositing is the bottleneck in Sort-Last rendering. Many methods have been developed to reduce the compositing time. In this paper, we present a series of pipeline methods for image compositing. Our new pipeline methods based on Direct Send and Binary Swap. However, unlike these methods, our methods overlap the rendering time of different frames to achieve high fps(frames per second) in final display. We analyze the theoretical performance of our methods and take intensive experiments using real data. The results show that our new methods are able to achieve interactive frame rates and scale well with both the size of nodes and screen resolution.
The paper presents experimental results on parallel variants of some classical methods for solving systems of equations. The following four methods are studied: Newton method, Chebyshev method, Gradient method with Fr...
详细信息
ISBN:
(纸本)9780769549347;9781467350266
The paper presents experimental results on parallel variants of some classical methods for solving systems of equations. The following four methods are studied: Newton method, Chebyshev method, Gradient method with Fridman control sequence, a method of conjugate gradient type. The main conclusion is that the precondition of the sparse systems (both linear and nonlinear) improves in a great extent the performance of the parallel algorithms.
Non-stationary discrete time waveform relaxation methods for Abel systems of Volterra integral equations using fractional linear multistep formulae are introduced. Fully parallel discrete waveform relaxation methods h...
详细信息
Non-stationary discrete time waveform relaxation methods for Abel systems of Volterra integral equations using fractional linear multistep formulae are introduced. Fully parallel discrete waveform relaxation methods having an optimal convergence rate are constructed. A significant expression of the error is proved, which allows us to estimate the number of iterations needed to satisfy a prescribed tolerance and allows us to identify the problems where the optimal methods offer the best performance. The numerical experiments confirm the theoretical expectations. (C) 2008 Elsevier B.V. All rights reserved.
This paper concerns parallel frontal predictor-corrector methods. Order and stability of these methods are investigated, when the corrector is solved both by the fixed point iteration method and by the Newton method.
This paper concerns parallel frontal predictor-corrector methods. Order and stability of these methods are investigated, when the corrector is solved both by the fixed point iteration method and by the Newton method.
A procedure for the construction of high-order explicit parallel Runge-Kutta-Nystrom (RKN) methods for solving second-order nonstiff initial value problems (IVPs) is analyzed. The analysis reveals that starting the pr...
详细信息
A procedure for the construction of high-order explicit parallel Runge-Kutta-Nystrom (RKN) methods for solving second-order nonstiff initial value problems (IVPs) is analyzed. The analysis reveals that starting the procedure with a reference symmetric RKN method it is possible to construct high-order RKN schemes which can be implemented in parallel on a small number of processors. These schemes are defined by means of a convex combination of k disjoint si-stage explicit RKN methods which are constructed by connecting si steps of a reference explicit symmetric method. Based on the reference second-order Stormer-Verlet methods we derive a family of high-order explicit parallel schemes which can be implemented in variable-step codes without additional cost. The numerical experiments carried out show that the new parallel schemes are more efficient than some sequential and parallel codes proposed in the scientific literature for solving second-order nonstiff IVPs. (C) 2011 Elsevier Inc. All rights reserved.
In this paper, a class of implicit advanced step-point methods that possesses a parallel feature is presented. Their accuracy and stability characteristics are examined in some detail and an experimental nonparallel c...
详细信息
In this paper, a class of implicit advanced step-point methods that possesses a parallel feature is presented. Their accuracy and stability characteristics are examined in some detail and an experimental nonparallel code has been developed in order to give us a fair indication of their capabilities. Our aim is not to discuss a "parallel implementation" but, to demonstrate the worthiness of the new methods. The experimental code is compared with the powerful MEBDF code on the stiff DETEST problem set and the statistics displayed are obtained from the DETEST evaluation package. Some initial conclusions concerning the efficiency of the new methods are drawn from the analysis of the numerical results. (C) 2005 Elsevier Ltd. All rights reserved.
The discrete problem associated with a two-step boundary value method (BVM) for the solution of initial value problems is a non-symmetric block tridiagonal system. This system may be efficiently solved on a parallel c...
详细信息
The discrete problem associated with a two-step boundary value method (BVM) for the solution of initial value problems is a non-symmetric block tridiagonal system. This system may be efficiently solved on a parallel computer by using a conjugate gradient type method with a suitable preconditioning. In this paper we consider a BVM based on an Adams method of order three and the trapezoidal method. The structure of the coefficient matrix allows us to derive good stability properties and an efficient preconditioning. Both the theoretical properties and the parallel implementation are discussed in more detail. In the numerical tests section, the preconditioning has been associated with the Bi-CGSTAB algorithm. The parallel algorithm has been tested on a network of transputers.
We introduce parallel interval Newton-Schwarz-like methods for nonlinear systems of equations arising from discretizations of almost linear parabolic problems. By applying interval techniques, we get global convergenc...
详细信息
We introduce parallel interval Newton-Schwarz-like methods for nonlinear systems of equations arising from discretizations of almost linear parabolic problems. By applying interval techniques, we get global convergence properties and verified enclosures. parallelism is introduced by domain decomposition. Numerical results from a SGI Altix 3700 are included. (c) 2006 Elsevier B.V. All rights reserved.
In this manuscript, we propose a new family of stabilized explicit parallelizable peer methods for the solution of stiff Initial Value Problems (IVPs). These methods are derived through the employment of a class of pr...
详细信息
In this manuscript, we propose a new family of stabilized explicit parallelizable peer methods for the solution of stiff Initial Value Problems (IVPs). These methods are derived through the employment of a class of preconditioners proposed by Bassenne et al. (2021) [5] for the construction of a family of linearly implicit Runge-Kutta (RK) schemes. In this paper, we combine the mentioned preconditioners with explicit two-step peer methods, obtaining a new class of linearly implicit numerical schemes that admit parallelism on the stages. Through an in-depth theoretical investigation, we set free parameters of both the preconditioners and the underlying explicit methods that allow deriving new peer schemes of order two, three and four, with good stability properties and small Local Truncation Error (LTE). Numerical experiments conducted on Partial Differential Equations (PDEs) arising from application contexts show the efficiency of the new peer methods proposed here, and highlight their competitiveness with other linearly implicit numerical schemes.
暂无评论