Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 40 (1997), S. 2891-2909 
    ISSN: 0029-5981
    Keywords: C++ ; object-oriented ; solidification ; parallel ; Engineering ; Numerical Methods and Modeling
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: This paper describes an implementation in C++ and in parallel of an explicit finite element formulation for the solution of transient heat conduction problems with phase change. The scheme requires a very small timestep because of its conditional stability, but, as no matrix inversion is required, the cost per timestep is an order of magnitude lower than for a conventional scheme.The principles of using object-oriented techniques for general finite element programming are briefly explained, while the advantages for parallel processing are described in detail, including the classes used to perform message passing.An example is given showing the performance of the scheme on two completely different parallel machines: a shared memory Silicon Graphics Power Challenge, and a distributed memory Cray T3D. The results indicate that the program scales efficiently for large meshes. © 1997 John Wiley & Sons, Ltd.
    Additional Material: 12 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Chichester : Wiley-Blackwell
    Communications in Numerical Methods in Engineering 13 (1997), S. 249-260 
    ISSN: 1069-8299
    Keywords: Engineering ; Numerical Methods and Modeling
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: The super-time-stepping algorithm is an improved timestepping scheme. It can significantly increase the performance of explicit methods, by reducing the restrictive timestep limits that exist. One of the drawbacks of the method is that the improvements are dependent on a set of parameters which are generally unknown. An investigation is performed to find the effect of these parameters and a method is described that estimates them. The technique is applied to a real problem and the results show a considerable improvement over a standard explicit timestepping scheme. The technique is implemented in an object-oriented manner, and details are given in an Appendix. © 1997 by John Wiley & Sons, Ltd.
    Additional Material: 9 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...