• Ronny Ramlau, Lothar Reichel (Hg.)

ETNA - Electronic Transactions on Numerical Analysis

Bild


Electronic Transactions on Numerical Analysis (ETNA) is an electronic journal for the publication of significant new developments in numerical analysis and scientific computing. Papers of the highest quality that deal with the analysis of algorithms for the solution of continuous models and numerical linear algebra are appropriate for ETNA, as are papers of similar quality that discuss implementation and performance of such algorithms. New algorithms for current or new computer architectures are appropriate provided that they are numerically sound. However, the focus of the publication should be on the algorithm rather than on the architecture. The journal is published by the Kent State University Library in conjunction with the Institute of Computational Mathematics at Kent State University, and in cooperation with the Johann Radon Institute for Computational and Applied Mathematics of the Austrian Academy of Sciences (RICAM). Reviews of all ETNA papers appear in Mathematical Reviews and Zentralblatt für Mathematik. Reference information for ETNA papers also appears in the expanded Science Citation Index. ETNA is registered with the Library of Congress and has ISSN 1068-9613.

…

Verlag der Österreichischen Akademie der Wissenschaften
Austrian Academy of Sciences Press
A-1011 Wien, Dr. Ignaz Seipel-Platz 2
Tel. +43-1-515 81/DW 3420, Fax +43-1-515 81/DW 3400
https://verlag.oeaw.ac.at, e-mail: verlag@oeaw.ac.at

Bestellung/Order


Bild
ETNA - Electronic Transactions on Numerical Analysis



ISBN 978-3-7001-8258-0
Online Edition



Send or fax to your local bookseller or to:

Verlag der Österreichischen Akademie der Wissenschaften
Austrian Academy of Sciences Press
A-1011 Wien, Dr. Ignaz Seipel-Platz 2,
Tel. +43-1-515 81/DW 3420, Fax +43-1-515 81/DW 3400
https://verlag.oeaw.ac.at, e-mail: bestellung.verlag@oeaw.ac.at
UID-Nr.: ATU 16251605, FN 71839x Handelsgericht Wien, DVR: 0096385

Bitte senden Sie mir
Please send me
 
Exemplar(e) der genannten Publikation
copy(ies) of the publication overleaf


NAME


ADRESSE / ADDRESS


ORT / CITY


LAND / COUNTRY


ZAHLUNGSMETHODE / METHOD OF PAYMENT
    Visa     Euro / Master     American Express


NUMMER

Ablaufdatum / Expiry date:  

    I will send a cheque           Vorausrechnung / Send me a proforma invoice
 
DATUM, UNTERSCHRIFT / DATE, SIGNATURE

BANK AUSTRIA CREDITANSTALT, WIEN (IBAN AT04 1100 0006 2280 0100, BIC BKAUATWW), DEUTSCHE BANK MÜNCHEN (IBAN DE16 7007 0024 0238 8270 00, BIC DEUTDEDBMUC)
Bild

An adaptive two-level nonlinear elimination preconditioned space-time solver for hyperbolic PDEs with shocks

    Chang-Wen Liang, Feng-Nan Hwang

ETNA - Electronic Transactions on Numerical Analysis, pp. 83-107, 2026/09/07

doi: 10.1553/etna_vol66s83

doi: 10.1553/etna_vol66s83


PDF
X
BibTEX-Export:

X
EndNote/Zotero-Export:

X
RIS-Export:

X 
Researchgate-Export (COinS)

Permanent QR-Code

doi:10.1553/etna_vol66s83



doi:10.1553/etna_vol66s83

Abstract

Fully coupled space–time methods for time-dependent partial differential equations (PDEs) have recently gained popularity because of their potential to exploit parallelization in the temporal domain, driven by advances in computing power. These algorithms require solving large, sparse nonlinear systems simultaneously, necessitating a robust and efficient nonlinear solver as a critical component of the entire solution algorithm. This paper studies some nonlinear preconditioned Newton algorithms for the space–time formulation of hyperbolic equations with shocks. In such cases, the classical inexact Newton method with backtracking (INB) suffers from long stagnation due to local strong nonlinearity. Nonlinear preconditioning, such as nonlinear elimination, has been shown to improve the robustness of INB for many types of PDEs; however, it is not effective for hyperbolic PDEs. To address this, we investigate a variant of nonlinear elimination preconditioners for hyperbolic PDEs, considering their characteristics to mitigate the associated difficulties. To further reduce the overhead of the subspace correction step, we consider a two-level version of the nonlinear elimination preconditioned inexact Newton method (NEPIN), where the levels correspond to successive nonlinear elimination steps. The present study focuses on the mathematical properties, convergence behavior, and serial performance of the proposed algorithms. We conducted a comparative performance study of two nonlinear preconditioned iterative algorithms, INB with adaptive nonlinear elimination (INB-ANE) and NEPIN, where nonlinear elimination techniques act as right or left nonlinear preconditioners, respectively, in conjunction with inexact Newton algorithms. We present numerical results using Riemann problems for Burgers' equation and the Buckley–Leverett equation. This indicates that NEPIN outperforms INB-ANE in identifying the correct shock location and introducing less interface pollution after subspace correction, prior to the global update. Additionally, the number of Newton iterations required to converge for NEPIN is almost independent of the time step and mesh size. Finally, a stiffness analysis is conducted to provide further insight into the effectiveness of NEPIN in a hyperbolic space–time formulation.

Keywords: parallel-in-time algorithms, space–time methods, hyperbolic PDEs, shock waves, nonlinear elimination preconditioning, inexact Newton method, coarse-grid correction, multilevel algorithms