✦ LIBER ✦

Parallel algorithms for a singularly perturbed parabolic problem

✍ Scribed by Igor Boglaev

Publisher: John Wiley and Sons
Year: 1999
Tongue: English
Weight: 372 KB
Volume: 15
Category: Article
ISSN: 0749-159X
DOI: 10.1002/(sici)1098-2426(199905)15:3<389::aid-num8>3.0.co;2-5

No coin nor oath required. For personal study only.

✦ Synopsis

This article deals with iterative algorithms for domain decomposition applied to the solution of a singularly perturbed parabolic problem. These algorithms are based on finite difference domain decomposition methods and are suitable for parallel computing. Convergence properties of the algorithms are established. Numerical results for test problems are presented.

📜 SIMILAR VOLUMES

On a Class of Singularly Perturbed Parab

On a Class of Singularly Perturbed Parabolic Equations

✍ S.-D. Shih 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 106 KB

Finite-time disturbance attenuation cont

Finite-time disturbance attenuation control problem for singularly perturbed discrete-time systems

✍ Mohamed A. Abdelrahman; D. Subbaram Naidu; Charalambos Charalambous; Kevin L. Mo 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 98 KB 👁 2 views

In this paper, we consider the problem of finite-time H -optimal control of linear, singularly perturbed, discrete-time systems. The problem is addressed from the game theoretic approach. This leads to a singularly perturbed, matrix Riccati difference equation, the solution of which is given in term

Difference schemes for the class of sing

Difference schemes for the class of singularly perturbed boundary value problems

✍ Ismail R. Rafatov; Sergey N. Sklyar 📂 Article 📅 2004 🏛 John Wiley and Sons ⚖ 124 KB 👁 1 views

## Abstract This work deals with the construction of difference schemes for the numerical solution of singularly perturbed boundary value problems, which appear while solving heat transfer equations with spherical symmetry. The projective version of integral interpolation (PVIIM) method is used. De

Algorithms for solving a spatial optimis

Algorithms for solving a spatial optimisation problem on a parallel computer

✍ George, Felicity; Radcliffe, Nicholas; Smith, Mark; Birkin, Mark; Clarke, Martin 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 337 KB 👁 2 views

In a collaborative project between GMAP Ltd and EPCC, an existing heuristic optimisation scheme for strategic resource planning was parallelised to run on the data parallel Connection Machine CM-200. The parallel software was found to run over 2700 times faster than the original workstation software

Solution algorithms for the parallel rep

Solution algorithms for the parallel replacement problem under economy of scale

✍ Zhi-Long Chen 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 116 KB

Parallel algorithms for semi-lagrangian

Parallel algorithms for semi-lagrangian advection

✍ A. V. Malevsky; S. J. Thomas 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 220 KB 👁 1 views

Numerical time step limitations associated with the explicit treatment of advection-dominated problems in computational ¯uid dynamics are often relaxed by employing Eulerian±Lagrangian methods. These are also known as semi-Lagrangian methods in the atmospheric sciences. Such methods involve backward