Michel Bercovier
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Michel Bercovier has a total of 56 co-authors. Here are the top co-authors by number of shared publications:
Tanya Matskewich
Microsoft Corporation
5 shared publicationsO. Volpin
4 shared publicationsM. Alhanaty
Inst. of Comput. Sci., Hebrew Univ., Jerusalem, Israel
3 shared publicationsHanna Parnas
Department of Neurobiology, Hebrew University, of Jerusalem, Jerusalem, Israel
2 shared publicationsMichael Engelman
2 shared publicationsO. Pironneau
University of Jerusalem, Jerusalem, Israel
2 shared publications
Latest Publications
- 4 October 2017
- Published by Springer Nature
- p. 93-136
MDS for a Smooth Boundary
- 4 October 2017
- Published by Springer Nature
- p. 25-42
G1-Smooth Surfaces
- 4 October 2017
- Published by Springer Nature
- p. 145-147
Conclusions and Further Research
- 1 April 2017
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 316, 209-234
Isogeometric analysis with geometrically continuous functions on planar multi-patch geometries
- 1 April 2017
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 316, 209-234
Isogeometric analysis with geometrically continuous functions on planar multi-patch geometries
- 1 January 2017
- Published by Springer Nature
Smooth Bézier Surfaces over Unstructured Quadrilateral Meshes
- 1 January 2017
- Published by Springer Nature
Smooth Bézier Surfaces over Unstructured Quadrilateral Meshes
- Open Access
Overlapping non Matching Meshes Domain Decomposition Method in Isogeometric Analysis
One of the important aspects of IsoGeometric Analysis (IGA) is the strong link between Computer Aided Design and analysis. Two of IGA'a major challenge are the assembly of patches (Constructive Solid Geometry geometries made of Boolean primitives) and local refinement. In the present work we apply the Additive Schwarz Domain Decomposition on overlapping domains. To leverage the power of IGA we consider non matching meshes to solve PDEs on CSG assemblies. As a side effect also we deal with local refinement . As a first step we study a collection of simple two domains problems, using the software package GeoPDEs, all of them converged rapidly, even on very distorted domains. For local refinement we implement a Chimera type of zooming together with ASDDM iterations, and here again we get very attractive results. A last effect is that the additive methods are naturally parallelizable and thus can extend to large 3D problems. We give some examples of computations on multi-patch bodies. This new implementation of the DD methods brings many interesting problems such as: the definition of boundary conditions on trimmed patches, choice of blending operators on the intersections , optimization of the overlap size, choice of preconditioning to guarantee convergence ( as we do not have a maximum principle here.)
Open AccessOverlapping non Matching Meshes Domain Decomposition Method in Isogeometric Analysis
One of the important aspects of IsoGeometric Analysis (IGA) is the strong link between Computer Aided Design and analysis. Two of IGA'a major challenge are the assembly of patches (Constructive Solid Geometry geometries made of Boolean primitives) and local refinement. In the present work we apply the Additive Schwarz Domain Decomposition on overlapping domains. To leverage the power of IGA we consider non matching meshes to solve PDEs on CSG assemblies. As a side effect also we deal with local refinement . As a first step we study a collection of simple two domains problems, using the software package GeoPDEs, all of them converged rapidly, even on very distorted domains. For local refinement we implement a Chimera type of zooming together with ASDDM iterations, and here again we get very attractive results. A last effect is that the additive methods are naturally parallelizable and thus can extend to large 3D problems. We give some examples of computations on multi-patch bodies. This new implementation of the DD methods brings many interesting problems such as: the definition of boundary conditions on trimmed patches, choice of blending operators on the intersections , optimization of the overlap size, choice of preconditioning to guarantee convergence ( as we do not have a maximum principle here.)
- Open Access
Smooth Bezier Surfaces over Arbitrary Quadrilateral Meshes
We solve the following problem: given a polynomial of order $n$ and the corresponding $B\'ezier$ tensor product patches over an unstructured regular quadrilateral mesh of any valence, find a solution to the $G^{1}1$ or $C^{1}1$ approximation (resp. interpolation) problem ! Constraints defining regularity conditions across patches have to be satisfied. The resulting number of free degrees of freedom must be such that for instance the interpolation problem has a solution. This is similar to studying the minimal determining set (MDS) for a $C^{1}$ continuity construction. The givenunstructured quadrilateral mesh can include a cubic boundary curve. The final surface approximation or PDE solution is obtained by energy methods. We completely solve the problem and show that there is always a solution for $n\ge 5$ and under some mesh restrictions for $n=4$. From a practical point of view, the present paper provides a way to build first order smooth interpolation/approximation and solutions to partial differential equations for arbitrary structures of quadrilateral meshes.Open AccessSmooth Bezier Surfaces over Arbitrary Quadrilateral Meshes
We solve the following problem: given a polynomial of order $n$ and the corresponding $B\'ezier$ tensor product patches over an unstructured regular quadrilateral mesh of any valence, find a solution to the $G^{1}1$ or $C^{1}1$ approximation (resp. interpolation) problem ! Constraints defining regularity conditions across patches have to be satisfied. The resulting number of free degrees of freedom must be such that for instance the interpolation problem has a solution. This is similar to studying the minimal determining set (MDS) for a $C^{1}$ continuity construction. The givenunstructured quadrilateral mesh can include a cubic boundary curve. The final surface approximation or PDE solution is obtained by energy methods. We completely solve the problem and show that there is always a solution for $n\ge 5$ and under some mesh restrictions for $n=4$. From a practical point of view, the present paper provides a way to build first order smooth interpolation/approximation and solutions to partial differential equations for arbitrary structures of quadrilateral meshes. - 10 December 2011
- Published by Taylor & Francis in Drug Development and Industrial Pharmacy
- Vol. 38 (8) , 940-951
Selecting the particle size distribution for drugs with low water solubility – mathematical model
Purpose: To introduce guidelines in selecting the particle size distribution (n0, cm−1) that will guarantee optimal oral absorption for drugs with low solubility. Methods: Unlike other multi-compartmental models the gastrointestinal tract is modeled as a continuous tube with spatially varying properties. The transport through the intestinal lumen is described using the dispersion model. The model accounts for the dissolution of poly-dispersed powders. Results: The model was used to examine the sensitivity of the absorption on permeability (P) and water solubility (Cs) following administration in different log-normal powders. The absorption exhibits inverse sigmoidal dependence on the mean particle size (rm, µm) regardless of the administrated dose or drug properties. Thus, there is an optimal rm that maximizes the benefit-cost ratio of the formulation; finer particles do not improve the absorption while coarser particles decrease it. Using the model we find that the optimal rm depends mainly on the drug Cs and on the geometrical standard deviation (gSTD). Conclusions: The results of this work provide the formulator with guidelines to select both rm and gSTD that guarantee optimal absorption.
- 10 December 2011
- Published by Taylor & Francis in Drug Development and Industrial Pharmacy
- Vol. 38 (8) , 940-951
Selecting the particle size distribution for drugs with low water solubility – mathematical model
Purpose: To introduce guidelines in selecting the particle size distribution (n0, cm−1) that will guarantee optimal oral absorption for drugs with low solubility. Methods: Unlike other multi-compartmental models the gastrointestinal tract is modeled as a continuous tube with spatially varying properties. The transport through the intestinal lumen is described using the dispersion model. The model accounts for the dissolution of poly-dispersed powders. Results: The model was used to examine the sensitivity of the absorption on permeability (P) and water solubility (Cs) following administration in different log-normal powders. The absorption exhibits inverse sigmoidal dependence on the mean particle size (rm, µm) regardless of the administrated dose or drug properties. Thus, there is an optimal rm that maximizes the benefit-cost ratio of the formulation; finer particles do not improve the absorption while coarser particles decrease it. Using the model we find that the optimal rm depends mainly on the drug Cs and on the geometrical standard deviation (gSTD). Conclusions: The results of this work provide the formulator with guidelines to select both rm and gSTD that guarantee optimal absorption.
- Open Access
- 29 July 2007
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 26 (99) , 49
Efficient simulation of inextensible cloth
- 29 July 2007
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 26 (99) , 49
Open AccessEfficient simulation of inextensible cloth
- 30 November 2004
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 305-308
Classification and identification of algebraic surfaces from an unorganised cloud of points
Given an unorganised cloud of points in 3D resulting from sampling a collection of algebraic surfaces (with sampling errors), a novel probabilistic method for classification and identification of algebraic surfaces is introduced. The method detects the surfaces in O(k/sup 2*A/ + k*n), where n is the number of points in the cloud, k is an upper bound on the number of surfaces expected to be detected and A is the minimal number of points sufficient to determine an algebraic surface of the highest degree. Algebraic surfaces are embedded in hyperplanes; the algorithm reduces the problem of reconstruction to the problem of defining a measure of "distance" and using clustering of hyperplanes in multidimensional space, and thereby produces effective results. The algorithm is robust and faster than most existing methods in most cases and there is no a priori knowledge on the number of surfaces involved. Non trivial examples of planar and quadric surfaces patches are given.
- 30 November 2004
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 305-308
Classification and identification of algebraic surfaces from an unorganised cloud of points
Given an unorganised cloud of points in 3D resulting from sampling a collection of algebraic surfaces (with sampling errors), a novel probabilistic method for classification and identification of algebraic surfaces is introduced. The method detects the surfaces in O(k/sup 2*A/ + k*n), where n is the number of points in the cloud, k is an upper bound on the number of surfaces expected to be detected and A is the minimal number of points sufficient to determine an algebraic surface of the highest degree. Algebraic surfaces are embedded in hyperplanes; the algorithm reduces the problem of reconstruction to the problem of defining a measure of "distance" and using clustering of hyperplanes in multidimensional space, and thereby produces effective results. The algorithm is robust and faster than most existing methods in most cases and there is no a priori knowledge on the number of surfaces involved. Non trivial examples of planar and quadric surfaces patches are given.