Articles de revista
http://hdl.handle.net/2117/6145
Sat, 30 Apr 2016 13:35:52 GMT2016-04-30T13:35:52ZCell-centred model for the simulation of curved cellular monolayers
http://hdl.handle.net/2117/86189
Cell-centred model for the simulation of curved cellular monolayers
Mosafa, Payman; Asadipour, Nina; Millán, Raúl Daniel; Rodríguez Ferran, Antonio; Muñoz Romero, José
This paper presents a cell-centred model for the simulation of planar and curved multicellular soft tissues. We propose a computational model that includes stress relaxation due to cell reorganisation (intercellular connectivity changes) and cytoskeleton remodelling (intracellular changes). Cells are represented by their cell centres, and their mechanical interaction is modelled through active non-linear elastic laws with a dynamically changing resting length. Special attention is paid to the handling of connectivity changes between cells, and the relaxation that the tissues exhibit under these topological changes. Cell--cell connectivity is computed by resorting to a Delaunay triangulation, which is combined with a mapping technique in order to obtain triangulations on curved manifolds. Our numerical results show that even a linear elastic cell--cell interaction model may induce a global non-linear response due to the reorganisation of the cell connectivity. This plastic-like behaviour is combined with a non-linear rheological law where the resting length depends on the elastic strain, mimicking the global visco-elastic response of tissues. The model is applied to simulate the elongation of planar and curved monolayers.
Tue, 26 Apr 2016 10:28:30 GMThttp://hdl.handle.net/2117/861892016-04-26T10:28:30ZMosafa, PaymanAsadipour, NinaMillán, Raúl DanielRodríguez Ferran, AntonioMuñoz Romero, JoséThis paper presents a cell-centred model for the simulation of planar and curved multicellular soft tissues. We propose a computational model that includes stress relaxation due to cell reorganisation (intercellular connectivity changes) and cytoskeleton remodelling (intracellular changes). Cells are represented by their cell centres, and their mechanical interaction is modelled through active non-linear elastic laws with a dynamically changing resting length. Special attention is paid to the handling of connectivity changes between cells, and the relaxation that the tissues exhibit under these topological changes. Cell--cell connectivity is computed by resorting to a Delaunay triangulation, which is combined with a mapping technique in order to obtain triangulations on curved manifolds. Our numerical results show that even a linear elastic cell--cell interaction model may induce a global non-linear response due to the reorganisation of the cell connectivity. This plastic-like behaviour is combined with a non-linear rheological law where the resting length depends on the elastic strain, mimicking the global visco-elastic response of tissues. The model is applied to simulate the elongation of planar and curved monolayers.Size-preserving size functions and smoothing procedures for adaptive quadrilateral mesh generation
http://hdl.handle.net/2117/85220
Size-preserving size functions and smoothing procedures for adaptive quadrilateral mesh generation
Ruiz-Gironés, Eloi; Roca Navarro, Xevi; Sarrate Ramos, Josep
The generation of meshes that correctly reproduce a prescribed size function is crucial for quadrilateral meshing due to two reasons. First, quadrilateral meshes are difficult to adapt to a given size field by refining or coarsening the elements without compromising the element quality. Second, after the meshing algorithm is finished, it may be necessary to apply a smoothing algorithm to improve the global quality. This smoothing step may modify the element size and the final mesh will not reproduce the prescribed element size. To solve these issues, we propose to combine the size-preserving method with a smoothing technique that takes into account both the element shape and size. The size-preserving technique allows directly generating a quadrilateral mesh that reproduces the size function, while the proposed smoother allows obtaining a high-quality mesh while maintaining the element size. In adaptive processes, the proposed approach may reduce the number of iterations to achieve convergence, since at each iteration the background mesh is properly reproduced. In addition, we detail new theoretical results that provide more insight to size-preserving size functions. Specifically, we prove that the maximum gradient of a one-dimensional size-preserving size function is bounded. Finally, several applications that show the benefits of applying the proposed techniques are presented.
Tue, 05 Apr 2016 14:58:27 GMThttp://hdl.handle.net/2117/852202016-04-05T14:58:27ZRuiz-Gironés, EloiRoca Navarro, XeviSarrate Ramos, JosepThe generation of meshes that correctly reproduce a prescribed size function is crucial for quadrilateral meshing due to two reasons. First, quadrilateral meshes are difficult to adapt to a given size field by refining or coarsening the elements without compromising the element quality. Second, after the meshing algorithm is finished, it may be necessary to apply a smoothing algorithm to improve the global quality. This smoothing step may modify the element size and the final mesh will not reproduce the prescribed element size. To solve these issues, we propose to combine the size-preserving method with a smoothing technique that takes into account both the element shape and size. The size-preserving technique allows directly generating a quadrilateral mesh that reproduces the size function, while the proposed smoother allows obtaining a high-quality mesh while maintaining the element size. In adaptive processes, the proposed approach may reduce the number of iterations to achieve convergence, since at each iteration the background mesh is properly reproduced. In addition, we detail new theoretical results that provide more insight to size-preserving size functions. Specifically, we prove that the maximum gradient of a one-dimensional size-preserving size function is bounded. Finally, several applications that show the benefits of applying the proposed techniques are presented.Mapping forces and kinematics during collective cell migration
http://hdl.handle.net/2117/84622
Mapping forces and kinematics during collective cell migration
Serra-Picamal, Xavier; Conte, Vito; Sunyer, Raimon; Muñoz Romero, José; Trepat, Xavier
Fundamental biological processes including morphogenesis and tissue repair require cells to migrate collectively. In these processes, epithelial or endothelial cells move in a cooperative manner coupled by intercellular junctions. Ultimately, the movement of these multicellular systems occurs through the generation of cellular forces, exerted either on the substrate via focal adhesions (cell–substrate forces) or on neighboring cells through cell–cell junctions (cell–cell forces). Quantitative measurements of multicellular forces and kinematics with cellular or subcellular resolution have become possible only in recent years. In this chapter, we describe some of these techniques, which include particle image velocimetry to map cell velocities, traction force microscopy to map forces exerted by cells on the substrate, and monolayer stress microscopy to map forces within and between cells. We also describe experimental protocols to perform these measurements. The combination of these techniques with high-resolution imaging tools and molecular perturbations will lead to a better understanding of the mechanisms underlying collective cell migration in health and disease.
Thu, 17 Mar 2016 13:29:47 GMThttp://hdl.handle.net/2117/846222016-03-17T13:29:47ZSerra-Picamal, XavierConte, VitoSunyer, RaimonMuñoz Romero, JoséTrepat, XavierFundamental biological processes including morphogenesis and tissue repair require cells to migrate collectively. In these processes, epithelial or endothelial cells move in a cooperative manner coupled by intercellular junctions. Ultimately, the movement of these multicellular systems occurs through the generation of cellular forces, exerted either on the substrate via focal adhesions (cell–substrate forces) or on neighboring cells through cell–cell junctions (cell–cell forces). Quantitative measurements of multicellular forces and kinematics with cellular or subcellular resolution have become possible only in recent years. In this chapter, we describe some of these techniques, which include particle image velocimetry to map cell velocities, traction force microscopy to map forces exerted by cells on the substrate, and monolayer stress microscopy to map forces within and between cells. We also describe experimental protocols to perform these measurements. The combination of these techniques with high-resolution imaging tools and molecular perturbations will lead to a better understanding of the mechanisms underlying collective cell migration in health and disease.High-order mesh curving by distortion minimization with boundary nodes free to slide on a 3D CAD representation
http://hdl.handle.net/2117/84601
High-order mesh curving by distortion minimization with boundary nodes free to slide on a 3D CAD representation
Ruiz-Gironés, Eloi; Roca Navarro, Xevi; Sarrate Ramos, Josep
We propose a 3D mesh curving method that converts a straight-sided mesh to an optimal-quality curved high-order mesh that interpolates a CAD boundary representation. The main application of this method is the generation of discrete approximations of curved domains that are valid for simulation analysis with unstructured high-order methods. We devise the method as follows. First, the boundary of a straight-sided high-order mesh is curved to match the curves and surfaces of a CAD model. Second, the method minimizes the volume mesh distortion with respect to the coordinates of the inner nodes and the parametric coordinates of the curve and surface nodes. The proposed minimization features untangling capabilities and therefore, it repairs the invalid elements that may arise from the initial curving step. Compared with other mesh curving methods, the only goal of the proposed residual system is to minimize the volume mesh distortion. Furthermore, it is less constrained since the boundary nodes are free to slide on the CAD curves and surfaces. Hence, the proposed method is well suited to generate curved high-order meshes of optimal quality from CAD models that contain thin parts or high-curvature entities. To illustrate these capabilities, we generate several curved high-order meshes from CAD models with the implementation detailed in this work. Specifically, we detail a node-by-node non-linear iterative solver that minimizes the proposed objective function in a block Gauss-Seidel manner.
Thu, 17 Mar 2016 11:04:42 GMThttp://hdl.handle.net/2117/846012016-03-17T11:04:42ZRuiz-Gironés, EloiRoca Navarro, XeviSarrate Ramos, JosepWe propose a 3D mesh curving method that converts a straight-sided mesh to an optimal-quality curved high-order mesh that interpolates a CAD boundary representation. The main application of this method is the generation of discrete approximations of curved domains that are valid for simulation analysis with unstructured high-order methods. We devise the method as follows. First, the boundary of a straight-sided high-order mesh is curved to match the curves and surfaces of a CAD model. Second, the method minimizes the volume mesh distortion with respect to the coordinates of the inner nodes and the parametric coordinates of the curve and surface nodes. The proposed minimization features untangling capabilities and therefore, it repairs the invalid elements that may arise from the initial curving step. Compared with other mesh curving methods, the only goal of the proposed residual system is to minimize the volume mesh distortion. Furthermore, it is less constrained since the boundary nodes are free to slide on the CAD curves and surfaces. Hence, the proposed method is well suited to generate curved high-order meshes of optimal quality from CAD models that contain thin parts or high-curvature entities. To illustrate these capabilities, we generate several curved high-order meshes from CAD models with the implementation detailed in this work. Specifically, we detail a node-by-node non-linear iterative solver that minimizes the proposed objective function in a block Gauss-Seidel manner.The receding front method applied to hexahedral mesh generation of exterior domains
http://hdl.handle.net/2117/84598
The receding front method applied to hexahedral mesh generation of exterior domains
Ruiz-Gironés, Eloi; Roca Navarro, Francisco Javier; Sarrate Ramos, Josep
Two of the most successful methods to generate unstructured hexahedral meshes are the grid-based methods and the advancing front methods. On the one hand, the grid-based methods generate high-quality hexahedra in the inner part of the domain using an inside–outside approach. On the other hand, advancing front methods generate high-quality hexahedra near the boundary using an outside–inside approach. To combine the advantages of both methodologies, we extend the receding front method: an inside–outside mesh generation approach by means of a reversed advancing front. We apply this approach to generate unstructured hexahedral meshes of exterior domains. To reproduce the shape of the boundaries, we first pre-compute the mesh fronts by combining two solutions of the Eikonal equation on a tetrahedral reference mesh. Then, to generate high-quality elements, we expand the quadrilateral surface mesh of the inner body towards the unmeshed external boundary using the pre-computed fronts as a guide.; Two of the most successful methods to generate unstructured hexahedral meshes are the grid-based methods and the advancing front methods. On the one hand, the grid-based methods generate high-quality hexahedra in the inner part of the domain using an inside–outside approach. On the other hand, advancing front methods generate high-quality hexahedra near the boundary using an outside–inside approach. To combine the advantages of both methodologies, we extend the receding front method: an inside–outside mesh generation approach by means of a reversed advancing front. We apply this approach to generate unstructured hexahedral meshes of exterior domains. To reproduce the shape of the boundaries, we first pre-compute the mesh fronts by combining two solutions of the Eikonal equation on a tetrahedral reference mesh. Then, to generate high-quality elements, we expand the quadrilateral surface mesh of the inner body towards the unmeshed external boundary using the pre-computed fronts as a guide.
Thu, 17 Mar 2016 10:50:31 GMThttp://hdl.handle.net/2117/845982016-03-17T10:50:31ZRuiz-Gironés, EloiRoca Navarro, Francisco JavierSarrate Ramos, JosepTwo of the most successful methods to generate unstructured hexahedral meshes are the grid-based methods and the advancing front methods. On the one hand, the grid-based methods generate high-quality hexahedra in the inner part of the domain using an inside–outside approach. On the other hand, advancing front methods generate high-quality hexahedra near the boundary using an outside–inside approach. To combine the advantages of both methodologies, we extend the receding front method: an inside–outside mesh generation approach by means of a reversed advancing front. We apply this approach to generate unstructured hexahedral meshes of exterior domains. To reproduce the shape of the boundaries, we first pre-compute the mesh fronts by combining two solutions of the Eikonal equation on a tetrahedral reference mesh. Then, to generate high-quality elements, we expand the quadrilateral surface mesh of the inner body towards the unmeshed external boundary using the pre-computed fronts as a guide.
Two of the most successful methods to generate unstructured hexahedral meshes are the grid-based methods and the advancing front methods. On the one hand, the grid-based methods generate high-quality hexahedra in the inner part of the domain using an inside–outside approach. On the other hand, advancing front methods generate high-quality hexahedra near the boundary using an outside–inside approach. To combine the advantages of both methodologies, we extend the receding front method: an inside–outside mesh generation approach by means of a reversed advancing front. We apply this approach to generate unstructured hexahedral meshes of exterior domains. To reproduce the shape of the boundaries, we first pre-compute the mesh fronts by combining two solutions of the Eikonal equation on a tetrahedral reference mesh. Then, to generate high-quality elements, we expand the quadrilateral surface mesh of the inner body towards the unmeshed external boundary using the pre-computed fronts as a guide.Cell-based maximum entropy approximants
http://hdl.handle.net/2117/84277
Cell-based maximum entropy approximants
Millán, Raúl Daniel; Sukumar, N; Arroyo Balaguer, Marino
In this paper, we devise cell-based maximum-entropy (max-ent) basis functions that are used in a Galerkin method for the solution of partial differential equations. The motivation behind this work is the construction of smooth approximants with controllable support on unstructured meshes. In the variational scheme to obtain max-ent basis functions, the nodal prior weight function is constructed from an approximate distance function to a polygonal curve in R2. More precisely, we take powers of the composition of R-functions via Boolean operations. The basis functions so constructed are nonnegative, smooth, linearly complete, and compactly-supported in a neighbor-ring of segments that enclose each node. The smoothness is controlled by two positive integer parameters: the normalization order of the approximation of the distance function and the power to which it is raised. The properties and mathematical foundations of the new compactly-supported approximants are described, and its use to solve two-dimensional elliptic boundary-value problems (Poisson equation and linear elasticity) is demonstrated. The sound accuracy and the optimal rates of convergence of the method in Sobolev norms are established.
Mon, 14 Mar 2016 09:26:39 GMThttp://hdl.handle.net/2117/842772016-03-14T09:26:39ZMillán, Raúl DanielSukumar, NArroyo Balaguer, MarinoIn this paper, we devise cell-based maximum-entropy (max-ent) basis functions that are used in a Galerkin method for the solution of partial differential equations. The motivation behind this work is the construction of smooth approximants with controllable support on unstructured meshes. In the variational scheme to obtain max-ent basis functions, the nodal prior weight function is constructed from an approximate distance function to a polygonal curve in R2. More precisely, we take powers of the composition of R-functions via Boolean operations. The basis functions so constructed are nonnegative, smooth, linearly complete, and compactly-supported in a neighbor-ring of segments that enclose each node. The smoothness is controlled by two positive integer parameters: the normalization order of the approximation of the distance function and the power to which it is raised. The properties and mathematical foundations of the new compactly-supported approximants are described, and its use to solve two-dimensional elliptic boundary-value problems (Poisson equation and linear elasticity) is demonstrated. The sound accuracy and the optimal rates of convergence of the method in Sobolev norms are established.An efficient and general approach for implementing thermodynamic phase equilibria information in geophysical and geodynamic studies
http://hdl.handle.net/2117/84276
An efficient and general approach for implementing thermodynamic phase equilibria information in geophysical and geodynamic studies
Afonso, Juan Carlos; Zlotnik, Sergio; Díez, Pedro
We present a flexible, general, and efficient approach for implementing thermodynamic phase equilibria information (in the form of sets of physical parameters) into geophysical and geodynamic studies. The approach is based on Tensor Rank Decomposition methods, which transform the original multidimensional discrete information into a separated representation that contains significantly fewer terms, thus drastically reducing the amount of information to be stored in memory during a numerical simulation or geophysical inversion. Accordingly, the amount and resolution of the thermodynamic information that can be used in a simulation or inversion increases substantially. In addition, the method is independent of the actual software used to obtain the primary thermodynamic information, and therefore, it can be used in conjunction with any thermodynamic modeling program and/or database. Also, the errors associated with the decomposition procedure are readily controlled by the user, depending on her/his actual needs (e.g., preliminary runs versus full resolution runs). We illustrate the benefits, generality, and applicability of our approach with several examples of practical interest for both geodynamic modeling and geophysical inversion/modeling. Our results demonstrate that the proposed method is a competitive and attractive candidate for implementing thermodynamic constraints into a broad range of geophysical and geodynamic studies. MATLAB implementations of the method and examples are provided as supporting information and can be downloaded from the journal's website.
Mon, 14 Mar 2016 09:21:16 GMThttp://hdl.handle.net/2117/842762016-03-14T09:21:16ZAfonso, Juan CarlosZlotnik, SergioDíez, PedroWe present a flexible, general, and efficient approach for implementing thermodynamic phase equilibria information (in the form of sets of physical parameters) into geophysical and geodynamic studies. The approach is based on Tensor Rank Decomposition methods, which transform the original multidimensional discrete information into a separated representation that contains significantly fewer terms, thus drastically reducing the amount of information to be stored in memory during a numerical simulation or geophysical inversion. Accordingly, the amount and resolution of the thermodynamic information that can be used in a simulation or inversion increases substantially. In addition, the method is independent of the actual software used to obtain the primary thermodynamic information, and therefore, it can be used in conjunction with any thermodynamic modeling program and/or database. Also, the errors associated with the decomposition procedure are readily controlled by the user, depending on her/his actual needs (e.g., preliminary runs versus full resolution runs). We illustrate the benefits, generality, and applicability of our approach with several examples of practical interest for both geodynamic modeling and geophysical inversion/modeling. Our results demonstrate that the proposed method is a competitive and attractive candidate for implementing thermodynamic constraints into a broad range of geophysical and geodynamic studies. MATLAB implementations of the method and examples are provided as supporting information and can be downloaded from the journal's website.eXtended Hybridizable Discontinous Galerkin (X-HDG) for void problems
http://hdl.handle.net/2117/84274
eXtended Hybridizable Discontinous Galerkin (X-HDG) for void problems
Gurkan, Ceren; Sala Lardies, Esther; Kronbichler, Martin; Fernandez Mendez, Sonia
A strategy for the Hybridizable Discontinous Galerkin (HDG) solution of problems with voids, inclusions or free surfaces is proposed. It is based on an eXtended Finite Element (X-FEM) philosophy with a level-set description of interfaces. Thus, the computational mesh is not required to fit the interface (i.e.~the boundary), simplifying and reducing the cost of mesh generation and, in particular, avoiding continuous remeshing for evolving interfaces. Differently to previous proposals for HDG solution with non-fitting meshes, here the computational mesh covers the domain, avoiding extrapolations, and ensuring the robustness of the method. The local problem at elements not cut by the interface, and the global problem, are discretized as usual in HDG. A modified local problem is considered at elements cut by the interface. At every cut element, an auxiliary trace variable on the boundary is introduced, which is eliminated afterwards using the boundary conditions on the interface, keeping the original unknowns and the structure of the local problem solver. An efficient and robust methodology for numerical integration in cut elements, in the context of high-order approximations, is also proposed. Numerical experiments demonstrate how X-HDG keeps the optimal convergence, superconvergence, and accuracy of HDG, with no need of adapting the computational mesh to the interface boundary.; A strategy for the Hybridizable Discontinous Galerkin (HDG) solution of problems with voids, inclusions or free surfaces is proposed. It is based on an eXtended Finite Element (X-FEM) philosophy with a level-set description of interfaces. Thus, the computational mesh is not required to fit the interface (i.e.~the boundary), simplifying and reducing the cost of mesh generation and, in particular, avoiding continuous remeshing for evolving interfaces. Differently to previous proposals for HDG solution with non-fitting meshes, here the computational mesh covers the domain, avoiding extrapolations, and ensuring the robustness of the method. The local problem at elements not cut by the interface, and the global problem, are discretized as usual in HDG. A modified local problem is considered at elements cut by the interface. At every cut element, an auxiliary trace variable on the boundary is introduced, which is eliminated afterwards using the boundary conditions on the interface, keeping the original unknowns and the structure of the local problem solver. An efficient and robust methodology for numerical integration in cut elements, in the context of high-order approximations, is also proposed. Numerical experiments demonstrate how X-HDG keeps the optimal convergence, superconvergence, and accuracy of HDG, with no need of adapting the computational mesh to the interface boundary.
Mon, 14 Mar 2016 09:15:50 GMThttp://hdl.handle.net/2117/842742016-03-14T09:15:50ZGurkan, CerenSala Lardies, EstherKronbichler, MartinFernandez Mendez, SoniaA strategy for the Hybridizable Discontinous Galerkin (HDG) solution of problems with voids, inclusions or free surfaces is proposed. It is based on an eXtended Finite Element (X-FEM) philosophy with a level-set description of interfaces. Thus, the computational mesh is not required to fit the interface (i.e.~the boundary), simplifying and reducing the cost of mesh generation and, in particular, avoiding continuous remeshing for evolving interfaces. Differently to previous proposals for HDG solution with non-fitting meshes, here the computational mesh covers the domain, avoiding extrapolations, and ensuring the robustness of the method. The local problem at elements not cut by the interface, and the global problem, are discretized as usual in HDG. A modified local problem is considered at elements cut by the interface. At every cut element, an auxiliary trace variable on the boundary is introduced, which is eliminated afterwards using the boundary conditions on the interface, keeping the original unknowns and the structure of the local problem solver. An efficient and robust methodology for numerical integration in cut elements, in the context of high-order approximations, is also proposed. Numerical experiments demonstrate how X-HDG keeps the optimal convergence, superconvergence, and accuracy of HDG, with no need of adapting the computational mesh to the interface boundary.
A strategy for the Hybridizable Discontinous Galerkin (HDG) solution of problems with voids, inclusions or free surfaces is proposed. It is based on an eXtended Finite Element (X-FEM) philosophy with a level-set description of interfaces. Thus, the computational mesh is not required to fit the interface (i.e.~the boundary), simplifying and reducing the cost of mesh generation and, in particular, avoiding continuous remeshing for evolving interfaces. Differently to previous proposals for HDG solution with non-fitting meshes, here the computational mesh covers the domain, avoiding extrapolations, and ensuring the robustness of the method. The local problem at elements not cut by the interface, and the global problem, are discretized as usual in HDG. A modified local problem is considered at elements cut by the interface. At every cut element, an auxiliary trace variable on the boundary is introduced, which is eliminated afterwards using the boundary conditions on the interface, keeping the original unknowns and the structure of the local problem solver. An efficient and robust methodology for numerical integration in cut elements, in the context of high-order approximations, is also proposed. Numerical experiments demonstrate how X-HDG keeps the optimal convergence, superconvergence, and accuracy of HDG, with no need of adapting the computational mesh to the interface boundary.Least-squares approximation of affine mappings for sweep mesh generation. Functional analysis and applications
http://hdl.handle.net/2117/84273
Least-squares approximation of affine mappings for sweep mesh generation. Functional analysis and applications
Roca Navarro, Xevi; Sarrate Ramos, Josep
Sweep methods are one of the most robust techniques to generate hexahedral meshes in extrusion volumes. The main issue in sweep algorithms is the projection of cap surface meshes along the sweep path. The most competitive technique to determine this projection is to find a least-squares approximation of an affine mapping. Several functional formulations have been defined to carry out this least-squares approximation. However, these functionals generate unacceptable meshes for several common geometries in CAD models. In this paper we present a new comparative analysis between these classical functional formulations and a new functional presented by the authors. In particular, we prove under which conditions the minimization of the analyzed functionals leads to a full rank linear system. Moreover, we also prove the equivalences between these formulations. These allow us to point out the advantages of the proposed functional. Finally, from this analysis we outline an automatic algorithm to compute the nodes location in the inner layers.
Mon, 14 Mar 2016 09:09:01 GMThttp://hdl.handle.net/2117/842732016-03-14T09:09:01ZRoca Navarro, XeviSarrate Ramos, JosepSweep methods are one of the most robust techniques to generate hexahedral meshes in extrusion volumes. The main issue in sweep algorithms is the projection of cap surface meshes along the sweep path. The most competitive technique to determine this projection is to find a least-squares approximation of an affine mapping. Several functional formulations have been defined to carry out this least-squares approximation. However, these functionals generate unacceptable meshes for several common geometries in CAD models. In this paper we present a new comparative analysis between these classical functional formulations and a new functional presented by the authors. In particular, we prove under which conditions the minimization of the analyzed functionals leads to a full rank linear system. Moreover, we also prove the equivalences between these formulations. These allow us to point out the advantages of the proposed functional. Finally, from this analysis we outline an automatic algorithm to compute the nodes location in the inner layers.Esquema adaptativo para problemas tridimensionales de convección-difusión
http://hdl.handle.net/2117/26367
Esquema adaptativo para problemas tridimensionales de convección-difusión
Monforte, Lluis; Pérez Foguet, Agustí
We present an adaptive scheme for three-dimensional convection-diffusion problems discretized by the Finite Element Method. The adaptive scheme is based on a remeshing strategy that applies a maximum volume constraint to the elements of a reference mesh. The remeshing can increase or decrease drastically the size of the elements in a single step automatically. With this strategy, the mesh quality does not deteriorate; as a consequence, the number of iterations required to solve the system of linear equations using iterative algorithms is kept constant. Two examples of very different characteristics are presented in order to analyze the proposal for a wide range of situations. The first is a three-dimensional extension of the Smolarkiewicz problem and the second is a simplified version of a point source pollutant transport problem. The results show the flexibility of the proposal. An optimal remeshing frequency, from a computational cost and accuracy of the results point of view, can be defined for both kinds of problems.
Mon, 16 Feb 2015 14:14:57 GMThttp://hdl.handle.net/2117/263672015-02-16T14:14:57ZMonforte, LluisPérez Foguet, AgustíWe present an adaptive scheme for three-dimensional convection-diffusion problems discretized by the Finite Element Method. The adaptive scheme is based on a remeshing strategy that applies a maximum volume constraint to the elements of a reference mesh. The remeshing can increase or decrease drastically the size of the elements in a single step automatically. With this strategy, the mesh quality does not deteriorate; as a consequence, the number of iterations required to solve the system of linear equations using iterative algorithms is kept constant. Two examples of very different characteristics are presented in order to analyze the proposal for a wide range of situations. The first is a three-dimensional extension of the Smolarkiewicz problem and the second is a simplified version of a point source pollutant transport problem. The results show the flexibility of the proposal. An optimal remeshing frequency, from a computational cost and accuracy of the results point of view, can be defined for both kinds of problems.