#### Filter Results:

- Full text PDF available (9)

#### Publication Year

1998

2017

- This year (1)
- Last 5 years (1)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

The standard local defect correction (LDC) method has been extended to include multilevel adaptive gridding, domain decomposition, and regridding. The domain decomposition algorithm provides a natural route for parallelization by employing many small tensor-product grids, rather than a single large unstructured grid; this algorithm can greatly reduce memory… (More)

- J. H. M. ten Thije Boonkkamp, Martijn Anthonissen
- J. Sci. Comput.
- 2011

We present a new finite volume scheme for the advection-diffusion-reaction equation. The scheme is second order accurate in the grid size, both for dominant diffusion and dominant advection, and has only a three-point coupling in each spatial direction. Our scheme is based on a new integral representation for the flux of the one-dimensional… (More)

- Martijn Anthonissen, R. M. M. Mattheij, J. H. M. ten Thije Boonkkamp
- Numerische Mathematik
- 2003

- Martijn Anthonissen, B. van't Hof, Arnold Reusken
- Computing
- 1998

We present a finite volume scheme for solving elliptic boundary value problems with solutions that have one or a few small regions with high activity. The scheme results from combining the local defect correction method (LDC), introduced in [11], with standard finite volume discretizations on a global coarse and on local fine uniform grids. The iterative… (More)

We apply the finite volume method to a spherically symmetric conservation law of advection-diffusion-reaction type. For the numerical flux we use the so-called complete flux scheme. In this scheme the flux is computed from a local boundary value problem for the complete equation, including the source term. As a result, the numerical flux is the… (More)

The standard local defect correction (LDC) method has been extended to include multilevel adaptive gridding, domain decomposition, and regridding. The domain decomposition algorithm provides a natural route for parallelization by employing many small tensor-product grids, rather than a single large unstructured grid. The algorithm is applied to a laminar… (More)

- Marialuce Graziadei, Marialuce Valentina Graziadei, Bratislav Tasic, Irina Lioulina, Martijn Anthonissen
- 2004

Dit proefschrift is goedgekeurd door de promotoren: Acknowledgements Many people contributed, in different ways, to the realisation of the research work that resulted in this thesis. First, I would like to thank prof.dr. Robert Mattheij for the support , guidance and encouragement he offered me and for promoting the very nice and enjoyable atmosphere in the… (More)

We study a one-dimensional model describing the motion of a shape-memory alloy spring at a small characteristic time scale, called here fast-temperature-activation limit. At this level, the standard Falk’s model reduces to a nonlinear elliptic partial differential equation (PDE) with Newton boundary condition. We show existence and uniqueness of a bounded… (More)

- Martijn Anthonissen
- Int. J. Comput. Math.
- 2007

We study the efficient numerical simulation of laser surface remelting, a process to improve the surface quality of steel components. To this end we use adaptive grids, which are well-suited for problems with moving heat sources. To account for the local high activity due to the heat source, we introduce local uniform grids and couple the solutions on the… (More)

- Felix Ischinger, Martijn Anthonissen, Barry Koren
- 2017

A monolithic FSI method is presented. A standard piston problem is considered as test case. The piston problem’s fluid domain is represented by a closed tube filled with air. One end of the fluid tube is formed by a piston connected to a spring. We use the Euler equations of gas dynamics as well as a linear simplification of these, the acoustic equations,… (More)

- ‹
- 1
- ›