TU Darmstadt / ULB / TUbiblio

Newton and approximate Newton methods with the orthogonal finite integration technique

De Gersem, Herbert ; Munteanu, Irina ; Weiland, Thomas (2006)
Newton and approximate Newton methods with the orthogonal finite integration technique.
Scientific computing in electrical engineering (SCEE 2006). Sinaia, Romania (17.09.2006-22.09.2006)
doi: 10.1007/978-3-540-71980-9_28
Konferenzveröffentlichung, Bibliographie

Kurzbeschreibung (Abstract)

The paper describes the application of the Newton method in conjunction with the Finite Integration Technique. Even on orthogonal grid pairs, the material matrices become nondiagonal and lead to higher algorithmic complexity. A uni-directional version of these matrices provides a computationally inexpensive alternative. The paper compares and discusses the two algorithms' order of convergence and their computational complexity.

Typ des Eintrags: Konferenzveröffentlichung
Erschienen: 2006
Autor(en): De Gersem, Herbert ; Munteanu, Irina ; Weiland, Thomas
Art des Eintrags: Bibliographie
Titel: Newton and approximate Newton methods with the orthogonal finite integration technique
Sprache: Englisch
Publikationsjahr: 2006
Ort: Berlin
Verlag: Springer
Buchtitel: Scientific computing in electrical engineering SCEE 2006. Selected papers based on the presentations at the 6th international conference, Sinaia, Romania, September 17–22, 2006
Reihe: TECMI
Band einer Reihe: 11
Veranstaltungstitel: Scientific computing in electrical engineering (SCEE 2006)
Veranstaltungsort: Sinaia, Romania
Veranstaltungsdatum: 17.09.2006-22.09.2006
DOI: 10.1007/978-3-540-71980-9_28
Kurzbeschreibung (Abstract):

The paper describes the application of the Newton method in conjunction with the Finite Integration Technique. Even on orthogonal grid pairs, the material matrices become nondiagonal and lead to higher algorithmic complexity. A uni-directional version of these matrices provides a computationally inexpensive alternative. The paper compares and discusses the two algorithms' order of convergence and their computational complexity.

Fachbereich(e)/-gebiet(e): 18 Fachbereich Elektrotechnik und Informationstechnik
Zentrale Einrichtungen
Hinterlegungsdatum: 20 Nov 2008 08:25
Letzte Änderung: 27 Nov 2024 10:11
PPN:
Export:
Suche nach Titel in: TUfind oder in Google
Frage zum Eintrag Frage zum Eintrag

Optionen (nur für Redakteure)
Redaktionelle Details anzeigen Redaktionelle Details anzeigen