✦ LIBER ✦

New techniques in designing finite-difference domain decomposition algorithm for the heat equation

✍ Scribed by Bao-Lin Zhang; Zheng-Su Wan

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 666 KB
Volume: 45
Category: Article
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(03)80126-8

No coin nor oath required. For personal study only.

✦ Synopsis

This

paper presents some new techniques in designing finite-difference domain decomposition algorithm for the heat equation. The basic procedure is to define the finite-difference schemes at the interface grid points with smaller time step af = At/m (m is a positive integer) by Saul'yev asymmetric schemes. The algorithm can increase the stability bounds of the classical explicit method by 2m times, and the prior error estimates for the numerical solutions are obtained for some algorithms when m = 2 or m = 3. Numerical experiments on stability and accuracy are also presented.

📜 SIMILAR VOLUMES

A new subgridding method for the finite-

A new subgridding method for the finite-difference time-domain (FDTD) algorithm

✍ Wenhua Yu; Raj Mittra 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 133 KB 👁 2 views

modeling of electromagnetic wave scattering and radar cross Ž . section, Proc IEEE 77 1989 , 682᎐699. 3. X. Zhang and K.K. Mei, Time-domain finite difference approach to the calculation of the frequency-dependent characteristics of microstrip discontinuities, IEEE Trans Microwave Theory Tech Ž . 36

A Finite Difference Domain Decomposition

A Finite Difference Domain Decomposition Method Using Local Corrections for the Solution of Poisson's Equation

✍ Gregory T. Balls; Phillip Colella 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 349 KB

We present a domain decomposition method for computing finite difference solutions to the Poisson equation with infinite domain boundary conditions. Our method is a finite difference analogue of Anderson's Method of Local Corrections. The solution is computed in three steps. First, fine-grid solutio

An Efficient Algorithm for Truncating Sp

An Efficient Algorithm for Truncating Spatial Domain in Modeling Light Scattering by Finite-Difference Technique

✍ Ping Yang; K.N. Liou 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 472 KB

The finite-difference time domain technique is one of the most robust and accurate numerical methods for the solution of light scattering by small particles with arbitrary composition and geometry. In practice, this method requires that the spatial domain for the computation of near-field be truncat

Using tap basis to implement the equival

Using tap basis to implement the equivalence principle algorithm for domain decomposition in integral equations

✍ Mao-Kun Li; Weng Cho Chew 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 565 KB

## Abstract A domain decomposition scheme based on the equivalence principle, also known as Huygens' principle, for integral equation solvers and the method of moments is introduced here. The equivalence principle allows the replacement of unknown currents distributed in a volume in space by equiva

A new parallel domain decomposition meth

A new parallel domain decomposition method for the adaptive finite element solution of elliptic partial differential equations

✍ Randolph E. Bank; Peter K. Jimack 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 323 KB 👁 2 views

A new interface condition in the non-ove

A new interface condition in the non-overlapping domain decomposition method for the Maxwell equations

✍ P. Collino; G. Delbue; P. Joly; A. Piacentini 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 824 KB

The performances of the non-overlapping domain decomposition method for the time-harmonic Maxwell equations which was originally proposed by Bruno Despres are dramatically improved by means of a new transmission operator, arising from the nonreflecting boundary condition theory, and of a new iterati