scispace - formally typeset
S

Sigal Gottlieb

Researcher at University of Massachusetts Dartmouth

Publications -  88
Citations -  7393

Sigal Gottlieb is an academic researcher from University of Massachusetts Dartmouth. The author has contributed to research in topics: Runge–Kutta methods & Nonlinear system. The author has an hindex of 23, co-authored 84 publications receiving 6335 citations. Previous affiliations of Sigal Gottlieb include University of Massachusetts Amherst & Brown University.

Papers
More filters
Journal ArticleDOI

Strong Stability-Preserving High-Order Time Discretization Methods

TL;DR: This paper reviews and further develops a class of strong stability-preserving high-order time discretizations for semidiscrete method of lines approximations of partial differential equations, and builds on the study of the SSP property of implicit Runge--Kutta and multistep methods.
Journal ArticleDOI

Total variation diminishing Runge-Kutta schemes

TL;DR: A class of high order TVD (total variation diminishing) Runge-Kutta time discretization initialized in Shu& Osher (1988), suitable for solving hyperbolic conservation laws with stable spatial discretizations is explored, verifying the claim that TVD runge-kutta methods are important for such applications.
Book

Spectral methods for time-dependent problems.

TL;DR: In this article, the authors present the EPFL-BOOK-190435, which is a collection of articles from EPFL's journal "EPFL-book" (EPFL Book 190435).
Book

Strong stability preserving runge-kutta and multistep time discretizations

TL;DR: This comprehensive book describes the development of SSP methods, explains the types of problems which require the use of these methods and demonstrates the efficiency ofThese methods using a variety of numerical examples.
Journal ArticleDOI

High Order Strong Stability Preserving Time Discretizations

TL;DR: The development of SSP methods and the connections between the timestep restrictions for strong stability preservation and contractivity are described and optimal explicit and implicit SSP Runge–Kutta and multistep methods are reviewed.