Search results

When simulating fluid-structure interaction (FSI), it is often essential that the no-slip condition is accurately enforced at the wetted boundary of the structure. This paper aims to evaluate the relative strengths and limitations of the penalty and Lagrange multiplier methods, within the context of modelling FSI, through a comparative analysis.

In the immersed boundary method, the no-slip condition is typically imposed by augmenting the governing equations of the fluid with an artificial body force. The relative accuracy and computational time of the penalty and Lagrange multiplier formulations of this body force are evaluated by using each to solve three test problems, namely, flow through a channel, the harmonic motion of a cylinder through a stationary fluid and the vortex-induced vibration (VIV) of a cylinder.

The Lagrange multiplier formulation provided an accurate solution, especially when enforcing the no-slip condition, and was robust as it did not require “tuning” of problem specific parameters. However, these benefits came at a higher computational cost relative to the penalty formulation. The penalty formulation achieved similar levels of accuracy to the Lagrange multiplier formulation, but only if the appropriate penalty factor was selected, which was difficult to determine a priori.

Both the Lagrange multiplier and penalty formulations of the immersed boundary method are prominent in the literature. A systematic quantitative comparison of these two methods is presented within the same computational environment. A novel application of the Lagrange multiplier method to the modelling of VIV is also provided.

The purpose of this paper is to propose a combined reordering scheme with a wide range of application, called Reversed Cuthill-McKee-approximate minimum degree (RCM-AMD), to improve a preconditioned general minimal residual method for solving equations using Lagrange multiplier method, and facilitates the choice of the reordering for the iterative method.

To reordering the coefficient matrix before a preconditioned iterative method will greatly impact its convergence behavior, but the effect is very problem-dependent, even performs very differently when different preconditionings applied for an identical problem or the scale of the problem varies. The proposed reordering scheme is designed based on the features of two popular ordering schemes, RCM and AMD, and benefits from each of them.

Via numerical experiments for the cases of various scales and difficulties, the effects of RCM-AMD on the preconditioner and the convergence are investigated and the comparisons of RCM, AMD and RCM-AMD are presented. The results show that the proposed reordering scheme RCM-AMD is appropriate for large-scale and difficult problems and can be used more generally and conveniently. The reason of the reordering effects is further analyzed as well.

The proposed RCM-AMD reordering scheme preferable for solving equations using Lagrange multiplier method, especially considering that the large-scale and difficult problems are very common in practical application. This combined reordering scheme is more wide-ranging and facilitates the choice of the reordering for the iterative method, and the proposed iterative method has good performance for practical cases in in-house and commercial codes on PC.

The purpose of this paper is to propose an efficient iterative method for large-scale finite element equations of bad numerical stability arising from deformation analysis with multi-point constraint using Lagrange multiplier method.

In this paper, taking warpage analysis of polymer injection molding based on surface model as an example, the performance of several popular Krylov subspace methods, including conjugate gradient, BiCGSTAB and generalized minimal residual (GMRES), with diffident Incomplete LU (ILU)-type preconditions is investigated and compared. For controlling memory usage, GMRES(m) is also considered. And the ordering technique, commonly used in the direct method, is introduced into the presented iterative method to improve the preconditioner.

It is found that the proposed preconditioned GMRES method is robust and effective for solving problems considered in this paper, and approximate minimum degree (AMD) ordering is most beneficial for the reduction of fill-ins in the ILU preconditioner and acceleration of the convergence, especially for relatively accurate ILU-type preconditioning. And because of concerns about memory usage, GMRES(m) is a good choice if necessary.

In this paper, for overcoming difficulties of bad numerical stability resulting from Lagrange multiplier method, together with increasing scale of problems in engineering applications and limited hardware conditions of computer, a stable and efficient preconditioned iterative method is proposed for practical purpose. Before the preconditioning, AMD reordering, commonly used in the direct method, is introduced to improve the preconditioner. The numerical experiments show the good performance of the proposed iterative method for practical cases, which is implemented in in-house and commercial codes on PC.

A three-dimensional (3D) unsteady potential flow might admit a variational principle. The purpose of this paper is to adopt a semi-inverse method to search for the variational formulation from the governing equations.

A suitable trial functional with a possible unknown function is constructed, and the identification of the unknown function is given in detail. The Lagrange multiplier method is used to establish a generalized variational principle, but in vain.

Some new variational principles are obtained, and the semi-inverse method can easily overcome the Lagrange crisis.

The semi-inverse method sheds a promising light on variational theory, and it can replace the Lagrange multiplier method for the establishment of a generalized variational principle. It can be used for the establishment of a variational principle for fractal and fractional calculus.

This paper establishes some new variational principles for the 3D unsteady flow and suggests an effective method to eliminate the Lagrange crisis.

In this work, a mortar method is implemented for tying arbitrary dissimilar 3D meshes, i.e. 3D meshes with curved, non‐matching interfaces. The 3D method requires approximations to the surface integrals specified by the projection of the displacement jump across the interface onto the Lagrange multiplier space. The numerical integration scheme is presented and several Lagrange multiplier interpolation schemes are considered. Furthermore, some implementational issues such as how to handle boundary conditions will be described such that stability is retained. Finally, the implementation will be demonstrated in numerical simulations and comparison of different formulations will be made.

The purpose of this paper is to compare torque calculation methods when a non‐conforming movement interface is implemented by means of Lagrange multipliers.

The following methods are here used for computing the torque in a synchronous machine and in a switched reluctance motor: Arkkio's method (AM), local Jacobian matrix derivative (LJD) method, Maxwell stress tensor method (MST) and co‐energy variation method.

This paper shows that, the numerical stability produced by Lagrange multipliers yields a stable torque result, even in thin airgap machines if AM, LJD method or MST method are used.

This work presents a comparative study to indicate the performance of the most commonly used torque calculation methods, when a non‐conforming technique is used, considering a small displacement of the rotor, which is necessary for dynamic cases or coupling with circuit.

This article aims to present a direct solution to handle linear constraints in finite element (FE) analysis without penalties or the Lagrange multipliers introduced.

First, the system of linear equations corresponding to the linear constraints is solved for the leading variables in terms of the free variables and the constants. Then, the reduced system of equilibrium equations with respect to the free variables is derived from the finite-dimensional virtual work equation. Finally, the algorithm is designed.

The proposed procedure is promising in three typical cases: (1) to enforce displacement constraints in any direction; (2) to implement local refinements by allowing hanging nodes from element subdivision and (3) to treat non-matching grids of distinct parts of the problem domain. The procedure is general and suitable for 3D non-linear analyses.

The algorithm is fitted only to the Galerkin-based numerical methods.

The proposed procedure does not need Lagrange multipliers or penalties. The tangential stiffness matrix of the reduced system of equilibrium equations reserves positive definiteness and symmetry. Besides, many contemporary Galerkin-based numerical methods need to tackle the enforcement of the essential conditions, whose weak forms reduce to linear constraints. As a result, the proposed procedure is quite promising.

The numerical simulation of metal forming processes approximated by means of finite element techniques, require large computational effort, which contradicts the need of interactivity for industrial applications. This work analyses the computational efficiency of algorithms combining elastoplasticity with finite deformation and contact mechanics, and in particular, the optimum solution of the linear systems to be solved through the incremental‐iterative schemes associated with non linear implicit analysis. A method based on domain decomposition techniques especially adapted to contact problems is presented, as well as the improved performance obtained in the application to hot rolling simulation, as a consequence of bandwidth reduction and the differentiated treatment of subdomains along the non linear analysis.

The purpose of this paper is to describe reduced order modelling based on dynamic flexibility approximation and applied to transient analyses.

This work is based on a recently proposed flexibility‐based component modes synthesis (CMS) approach which was shown to be very efficient for solving large eigenvalue problems. The model reduction approach is based on partionning via the localized Lagrange multipliers method, which makes it very appropriate to handle coupled problems.

In particular, it is demonstrated in this paper how the utilised model reduction method can be applied only to one part of the structure and efficiently coupled to a full finite element model. The performance of the method is investigated on numerical examples of plate and 3D problems.

The proposed flexibility‐based CMS approach can be used as a very efficient tool for complex engineering structures under dynamic load where the mode superposition method applies. The efficiency of the computations is brought about by the model reduction.

This paper aims to overcome the lack of methodologies for optimizing the volume of bulky low-frequency inductors that the authors came across with when working on the design of hybrid active power filters. Sound work was published concerning this well-known technology, but it became evident that the mentioned optimization topic was left unaddressed.

Using the Lagrange multipliers optimization method combined with the electromagnetic laws of inductor design, it was possible to establish a new design method to determine the optimal solutions that fulfil any given scenario of specifications. In other words, it is now possible to obtain the inductor’s geometric and electric parameters that not only satisfy the system’s electromagnetic requirements but also lead to smaller, lighter or economical solutions.

A generalized set of equations was obtained to facilitate the calculations of all the inductor-building parameters. As expected, these equations take as inputs the inductor’s required inductance, its maximum current and the desired resistance, but also a customizable cost function. The later cost function will optimize the inductor’s volumes of copper and iron and can be settled, among other purposes, for minimizing the total weight, volume or cost.

All the mathematical expressions to obtain the general optimal solutions are given as well as practical graphics for the three above-mentioned optimization criteria. Using these charts, the reader will be able to obtain by simple inspection the optimal solutions for a large, generalized universe of intended specifications.