Search results

    Filter results

  • Full text

  • Document type

  • Publication year

  • Organisation

Results: 18
Number of items: 18
  • Hemker, P. W., Hoffmann, W., & van Raalte, M. H. (2004). Fourier two-level analysis for discontinuous Galerkin discretization with linear elements. Numerical Linear Algebra with Applications, 11(5-6), 473-491. https://doi.org/10.1002/nla.356
  • Hemker, P. W., Hoffmann, W., & van Raalte, M. H. (2004). Two-level Fourier analysis of a multigrid approach for discontinuous Galerkin discretization. SIAM Journal on Scientific Computing, 25(3), 1018-1041. https://doi.org/10.1137/S1064827502405100
  • Open Access
    van Raalte, M. H. (2004). Multigrid Analysis and Embedded Boundary Conditions for Discontinuous Galerkin Discretization. [Thesis, fully internal, Universiteit van Amsterdam].
  • Hemker, P. W., Hoffmann, W., & van Raalte, M. H. (2003). Discontinuous Galerkin discretization with embedded boundary conditions. Dedicated to Raytcho Lazarov. Computational methods in applied mathematics, 3(1), 135-158.
  • Havik, E. D., Hoffmann, W., & Hemker, P. W. (2000). Application of the over-set grid technique to a model singular perturbation problem. Computing, 65(4), 339-356. https://doi.org/10.1007/s006070070004
  • Hoffmann, W. (1998). The Gauss-Huard algorithm and LU factorization. Linear Algebra and Its Applications, 275-276, 281-286.
  • de Swart, J. J. B. (1997). PSIDE: Parallel software for implicit differential equations. [Thesis, fully internal, Universiteit van Amsterdam]. Universiteit van Amsterdam.
  • Hoekstra, A. G., Hoffmann, W., Kartawidjaja, M. A., Overeinder, B. J., Santoso, J., & Sloot, P. M. A. (1997). A high performance simulation environment, project status report. Departement of Computer Systems, University of Amsterdam.
  • Dekker, T. J., Hoffmann, W., & Potma, K. (1997). Stability of the Gauss-Huard Algorithm with Partial Pivoting. Computing, 58(3), 225-244. https://doi.org/10.1007/BF02684391
  • Open Access
    Hoffmann, W., & de Swart, J. J. B. (1997). Approximating Runge-Kutta matrices by triangular matrices. Bit : numerical mathematics , 37(2), 346-354. https://doi.org/10.1007/BF02510217
Page 1 of 2