![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Denis Vanderstraeten
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
- [j3]Kris Demarsin, Denis Vanderstraeten, Tim Volodine, Dirk Roose
:
Detection of closed sharp edges in point clouds using normal estimation and graph theory. Comput. Aided Des. 39(4): 276-283 (2007) - 2006
- [c11]Kris Demarsin, Denis Vanderstraeten, Tim Volodine, Dirk Roose:
Detection of Closed Sharp Feature Lines in Point Clouds for Reverse Engineering Applications. GMP 2006: 571-577 - [c10]Tim Volodine, Denis Vanderstraeten, Dirk Roose:
Smoothing of Meshes and Point Clouds Using Weighted Geometry-Aware Bases. GMP 2006: 687-693 - 2000
- [j2]Gene H. Golub, Denis Vanderstraeten:
On the preconditioning of matrices with skew-symmetric splittings. Numer. Algorithms 25(1-4): 223-239 (2000) - [j1]Denis Vanderstraeten:
An accurate parallel block Gram-Schmidt algorithm without reorthogonalization. Numer. Linear Algebra Appl. 7(4): 219-236 (2000)
1990 – 1999
- 1999
- [c9]Denis Vanderstraeten:
A Stable and Efficient Parallel Block Gram-Schmidt Algorithm. Euro-Par 1999: 1128-1135 - [c8]Denis Vanderstraeten:
A Parallel Block Gram-Schmidt Algorithm With Controlled Loss of Orthogonality. PP 1999 - 1997
- [c7]Denis Vanderstraeten, Matthew G. Knepley
:
Parallel Building Blocks for Finite Element Simulations. Parallel CFD 1997: 281-287 - 1996
- [c6]Denis Vanderstraeten, François-Xavier Roux, R. Keunings:
A Hybrid Parallel Solver for Finite Element Computations. HPCN Europe 1996: 586-592 - [c5]Denis Vanderstraeten, François-Xavier Roux, R. Keunings:
A hybrid parallel solver for finite element computations applied to CFD problems. Parallel CFD 1996: 228-235 - 1995
- [c4]Denis Vanderstraeten, R. Keunings, Charbel Farhat:
Beyond Conventional Mesh Partitioning Algorithms and the Minimum Edge Cut Criterion: Impact on Realistic Realistic Applications. PP 1995: 611-614 - 1994
- [c3]O. Zone, Denis Vanderstraeten, P. Henriksen, R. Keunings:
A Parallel Direct Solver for Implicit Finite Element Problems based on Automatic Domain Decomposition. EUROSIM 1994: 809-816 - [c2]R. Keunings, R. Aggarwal, P. Henriksen, Denis Vanderstraeten, O. Zone:
Parallel Finite Element Algorithms Applied to Polymer Flow. HPCN 1994: 254-260 - 1993
- [c1]Denis Vanderstraeten, O. Zone, R. Keunings, Laurence A. Wolsey:
Non-Deterministic Heuristics for Automatic Domain Decomposition in Direct Parallel Finite Element Calculations. PPSC 1993: 929-932
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-04 21:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint