๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A stable algorithm for 3D-IHCP

โœ Scribed by D.A. Murio; H.C. Zheng

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
631 KB
Volume
29
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

โœฆ Synopsis

The numerical solution of the three-dimensional inverse heat conduction problem (IHCP) on an infinite slab is investigated. By applying a mollification procedure, a fully explicit space-marching finite-difference scheme is developed. The stability analysis of this scheme is presented together with some computational examples of interest.

๐Ÿ“œ SIMILAR VOLUMES

3D-IHCP on a finite cube
3D-IHCP on a finite cube
โœ H. Zheng; D.A. Murio ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 762 KB

The numerical solution of the three-dimensional inverse heat conduction problem (IHCP) on a finite cube is investigated. By applying a mollification procedure, a fully explicit space-marching finite-difference scheme is developed. Numerical examples and computational details are provided.

A Crankโ€“Nicholson-based unconditionally
A Crankโ€“Nicholson-based unconditionally stable time-domain algorithm for 2D and 3D problems
โœ Xin Xie; George Pan; Stephen Hall ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 221 KB

## Abstract It has been shown that both ADIโ€FDTD and CNโ€FDTD are unconditionally stable. While the ADI is a secondโ€order approximation, CN is only in the first order. However, analytical expressions reveal that the CNโ€FDTD has much smaller truncation errors and is more accurate than the ADIโ€FDTD. N

A subdivision algorithm for smooth 3D te
A subdivision algorithm for smooth 3D terrain models
โœ Norbert Pfeifer ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 399 KB

Current terrain modelling algorithms are not capable of reconstructing 3D surfaces, but are restricted to so-called 2.5D surfaces: for one planimetric position only one height may exist. The objective of this paper is to extend terrain relief modelling to 3D. In a 3D terrain model overhangs and cave

A fast and stable algorithm for splittin
A fast and stable algorithm for splitting polynomials
โœ G. Malajovich; J.P. Zubelli ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 928 KB

This paper concerns the fast numerical factorization of degree a + b polynomials in a neighborhood of the polynomial x a. We want to obtain the so-called splitting of one such polynomial, i.e., a degree a factor with roots close to zero and a degree b factor with roots close to infinity. An importan