BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Sabre//Sabre VObject 4.5.7//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:Europe/Zurich
X-LIC-LOCATION:Europe/Zurich
TZURL:http://tzurl.org/zoneinfo/Europe/Zurich
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19810329T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19961027T030000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:news1099@dmi.unibas.ch
DTSTAMP;TZID=Europe/Zurich:20210623T193201
DTSTART;TZID=Europe/Zurich:20201016T110000
SUMMARY:Seminar in Numerical Analysis: Jürgen Dölz (Universität Bonn)
DESCRIPTION:We propose an efficient algorithm for the treatment of Volterra
  integral operators based on H2-matrix compression techniques. The algorit
 hm is built in an evolutionary manner\, and therefore\, is well suited for
  the problems\, where the right hand side depends on the solution itself a
 nd is not known for all time steps a priori. The resulting algorithm is of
  linear complexity O(N) w.r.t. to the number of time steps\, and requires 
 O(N) active memory. The memory consumption can be reduced to O(log N) for 
 the kernels of convolution type using the Laplace inversion techniques int
 roduced by Lubich et al\; the connection to the FOCQ algorithm is drawn. W
 e demonstrate the effectiveness of our algorithm on a series of numerical 
 examples.\\r\\n For further information about the seminar\, please visit t
 his webpage [t3://page?uid=1115].
X-ALT-DESC:<p>We propose an efficient algorithm for the treatment of Volter
 ra integral operators based on H2-matrix compression techniques. The algor
 ithm is built in an evolutionary manner\, and therefore\, is well suited f
 or the problems\, where the right hand side depends on the solution itself
  and is not known for all time steps a priori. The resulting algorithm is 
 of linear complexity O(N) w.r.t. to the number of time steps\, and require
 s O(N) active memory. The memory consumption can be reduced to O(log N) fo
 r the kernels of convolution type using the Laplace inversion techniques i
 ntroduced by Lubich et al\; the connection to the FOCQ algorithm is drawn.
  We demonstrate the effectiveness of our algorithm on a series of numerica
 l examples.</p>\n<p><br /> For further information about the seminar\, ple
 ase visit this&nbsp\;<a href="t3://page?uid=1115" title="Opens internal li
 nk in current window">webpage</a>.</p>
DTEND;TZID=Europe/Zurich:20201016T120000
END:VEVENT
END:VCALENDAR