Obserwuj
Lorenzo Micalizzi
Tytuł
Cytowane przez
Cytowane przez
Rok
An arbitrary high order and positivity preserving method for the shallow water equations
M Ciallella, L Micalizzi, P Öffner, D Torlo
Computers & Fluids 247, 105630, 2022
202022
Efficient iterative arbitrary high-order methods: an adaptive bridge between low and high order
L Micalizzi, D Torlo, W Boscheri
Communications on Applied Mathematics and Computation, 1-38, 2023
152023
A new efficient explicit deferred correction framework: analysis and applications to hyperbolic pdes and adaptivity
L Micalizzi, D Torlo
Communications on Applied Mathematics and Computation 6 (3), 1629-1664, 2024
102024
On improving the efficiency of ADER methods
MH Veiga, L Micalizzi, D Torlo
Applied Mathematics and Computation 466, 128426, 2024
92024
Novel well-balanced continuous interior penalty stabilizations
L Micalizzi, M Ricchiuto, R Abgrall
Journal of Scientific Computing 100 (1), 1-45, 2024
52024
A high-order, fully well-balanced, unconditionally positivity-preserving finite volume framework for flood simulations
M Ciallella, L Micalizzi, V Michel-Dansac, P Öffner, D Torlo
GEM-International Journal on Geomathematics 16 (1), 1-33, 2025
42025
Efficient Iterative Arbitrary High Order Methods: Adaptivity and Structure Preservation
L Micalizzi
University of Zurich, 2024
22024
Algorithms of very high space-time orders of accuracy for hyperbolic equations in the semidiscrete WENO-DeC framework
L Micalizzi, EF Toro
arXiv preprint arXiv:2501.12994, 2025
2025
Impact of Numerical Fluxes on High Order Semidiscrete WENO-DeC Finite Volume Schemes
L Micalizzi, EF Toro
arXiv preprint arXiv:2411.07422, 2024
2024
A new efficient explicit Deferred Correction framework: analysis and applications to hyperbolic PDEs and adaptivity Supplementary Material
L Micalizzi, D Torlo
2022
Saving computational costs with efficient iterative ADER meth-ods: p-adaptivity, accuracy results and structure preserving limiters
D Torlo, L Micalizzi, W Boscheri, MH Veiga
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–11