Bibliothek

feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
  • 1
    Digitale Medien
    Digitale Medien
    Chichester [u.a.] : Wiley-Blackwell
    International Journal of Numerical Modelling: Electronic Networks, Devices and Fields 7 (1994), S. 357-370 
    ISSN: 0894-3370
    Schlagwort(e): Engineering ; Electrical and Electronics Engineering
    Quelle: Wiley InterScience Backfile Collection 1832-2000
    Thema: Elektrotechnik, Elektronik, Nachrichtentechnik
    Notizen: The calculation of potentials in homogeneous and isotropic media by the boundary element method has the advantage that a harmonic solution of Laplace's equation is obtained for given approximated boundary conditions. The technique leads to the solution of linear systems with full matrices of dimension 1000-10,000 for medium- and large-sized three-dimensional problems, An efficient solution procedure of the linear systems is required.While the iterative solution of the large and sparse linear systems arising from the finite difference or the finite element method is well documented, the systems resulting from the boundary element method are typically solved by direct methods. However, in many cases an iterative solver needs far fewer operations to achieve a sufficient accuracy. Importantly, there are many alternative methods, each of them well suited for different types of problem.Here, we provide an overview of state-of-the-art iterative solvers. We will discuss the particular methods that have been successfully applied to systems arising from field calculations in the high-voltage engineering by the boundary element method. The selection of appropriate methods is discussed. We demonstrate that iterative solutions can be much faster than direct solvers with regards to the number of operations. Furthermore, these solvers are optimally suited for today's supercomputers because they can be efficiently vectorized and parallelized.
    Zusätzliches Material: 11 Ill.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    Digitale Medien
    Digitale Medien
    New York, NY [u.a.] : Wiley-Blackwell
    Numerical Linear Algebra with Applications 1 (1994), S. 45-63 
    ISSN: 1070-5325
    Schlagwort(e): Conjugate gradients ; Convergence ; Linear systems ; Acceleration of conjugate gradients ; Engineering ; Engineering General
    Quelle: Wiley InterScience Backfile Collection 1832-2000
    Thema: Mathematik
    Notizen: The solution of linear systems has considerable importance for the computation of problems resulting from engineering, physics, chemistry, computer science, mathematics, medicine and economics. The calculation of costly and time-consuming problems, e.g. crash tests, simulation of the human lung and skin, calculation of electrical and magnetical fields, thermal analysis and fluid dynamics, to name only a few, has become possible with the recent developments of advanced computer architectures and iterative solvers. Generalized conjugate gradient (CG) methods are the most important iterative solvers because they converge very quickly under certain conditions. Therefore they are widely used and in a rapid further development.The purpose of this paper is to present new results for the convergence of generalized CG methods. A convergence result for non-symmetric and non-positive definite matrices is given that includes the classical theory for symmetric, positive definite matrices as a special case.The norm of the residuals resulting from CG methods may oscillate heavily. Different remedies for smoothing this sequence have been proposed, for example by van der Vorst. Schönauer introduced in the 1980s a smoothing algorithm to get a norm nonincreasing function of the iteration index. For this algorithm a complete theoretical analysis is given. A surprising result is obtained showing that the smoothing algorithm is in a sense optimal. Convergence estimates are derived therefrom. A geometric interpretation of the smoothing algorithm is given showing the propagation of the errors.It should be stressed that a smooth convergence of the residuals is not equivalent to a smooth convergence of the errors which is the proper aim. A class of error minimizing methods can be easily derived from the theory.
    Zusätzliches Material: 6 Ill.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...