Ch. Lubich
University of Tübingen
15 Papers
106 Citations
Ch. Lubich is an academic researcher from University of Tübingen. The author has contributed to research in topics: Integral equation & Volterra integral equation. The author has an hindex of 13, co-authored 15 publications.
Chat about Author
Papers
Nonsmooth data error estimates for approximations of an evolution equation with a positive-type memory term
TL;DR: The proposed discretization uses convolution quadrature based on the first- and second-order backward difference methods in time, and piecewise linear finite elements in space to study the numerical approximation of an integro-differential equation.
Fractional linear multistep methods for Abel-Volterra integral equations of the second kind
TL;DR: In this article, fractional powers of linear multistep methods are suggested for numerical solution of weakly singular Volterra integral equations, and the proposed methods are convergent of the order of the underlying multisteps method, also in the generic case of solutions which are not smooth at the origin.
Runge-Kutta methods for parabolic equations and convolution quadrature
Ch. Lubich,Alexander Ostermann +1 more
TL;DR: The approximation properties of Runge-Kutta time discretizations of linear and semilinear parabolic equations, including incompressible Navier-Stokes equations, are studied and asymptotically sharp error bounds are derived.
Fractional Linear Multistep Methods for Abel-Volterra Integral Equations of the First Kind
TL;DR: Application des puissances fractionnaires des methodes multipas lineaires a la solution numerique des equations integrales de Volterra de premiere espece a faible singularite as discussed by the authors.
47
Numerical Integration of Constrained Mechanical Systems Using MEXX
TL;DR: The present article describes MEXX, a FORTRAN code for time integration of constrained mechanical systems based on extrapolation of a timestepping method that is explicit in regard to differential equations and linearly implicit regarding nonlinear constraints.
35