Toeplitz矩阵压缩恢复的两种中值修正的增广Lagrange乘子算法

增广Lagrange乘子算法是求解矩阵压缩恢复的一种有效迭代方法．为了有效求解Toeplitz矩阵压缩恢复模型,本文提出了两种中值修正的增广Lagrange乘子算法．在新算法中,对增广Lagrange乘子算法每步产生的迭代矩阵进行中值修正并保证其Toeplitz结构．新算法不仅减少了奇异值分解所用的时间和CPU时间,而且获得更精确的迭代矩阵．同时,本中还详细给出了两种新算法的收敛性分析．最后通过数值例子验证了新算法的可行性和有效性,并展示了新算法在计算时间和精度方面比增广Lagrange乘子算法更有优势．     

Lagrange constraints for transient finite element surface contact

A new approach to enforce surface contact conditions in transient non-linear finite element problems is developed in this paper. The method is based on the Lagrange multiplier concept and is compatible with explicit time integration operators. Compatibility with explicit operators is established by referencing Lagrange multipliers one time increment ahead of associated surface contact displacement constraints. However, the method is not purely explicit because a coupled system of equations must be solved to obtain the Lagrange multipliers. An important development herein is the formulation of a highly efficient method to solve the Lagrange multiplier equations. The equation solving strategy is a modified Gauss-Seidel method in which non-linear surface contact force conditions are enforced during iteration. The new surface contact method presented has two significant advantages over the widely accepted penalty function method: surface contact conditions are satisfied more precisely, and the method does not adversely affect the numerical stability of explicit integration. Transient finite element analysis results are presented for problems involving impact and sliding with friction. A brief review of the classical Lagrange multiplier method with implicit integration is also included.     

Direct numerical simulation of the dynamics of sliding rough surfaces

The noise generated by the friction of two rough surfaces under weak contact pressure is usually called roughness noise. The underlying vibration which produces the noise stems from numerous instantaneous shocks (in the microsecond range) between surface micro-asperities. The numerical simulation of this problem using classical mechanics requires a fine discretization in both space and time. This is why the finite element method takes much CPU time. In this study, we propose an alternative numerical approach which is based on a truncated modal decomposition of the vibration, a central difference integration scheme and two algorithms for contact: The penalty algorithm and the Lagrange multiplier algorithm. Not only does it reproduce the empirical laws of vibration level versus roughness and sliding speed found experimentally but it also provides the statistical properties of local events which are not accessible by experiment. The CPU time reduction is typically a factor of 10.     

A trust region-based approach to optimize triple response systems

This article presents a new computing procedure for the global optimization of the triple response system (TRS) where the response functions are non-convex quadratics and the input factors satisfy a radial constrained region of interest. The TRS arising from response surface modelling can be approximated using a nonlinear mathematical program that considers one primary objective function and two secondary constraint functions. An optimization algorithm named the triple response surface algorithm (TRSALG) is proposed to determine the global optimum for the non-degenerate TRS. In TRSALG, the Lagrange multipliers of the secondary functions are determined using the Hooke–Jeeves search method and the Lagrange multiplier of the radial constraint is located using the trust region method within the global optimality space. The proposed algorithm is illustrated in terms of three examples appearing in the quality-control literature. The results of TRSALG compared to a gradient-based method are also presented.     

A contact formulation based on localized Lagrange multipliers: formulation and application to two‐dimensional problems

The non‐penetration condition in contact problems is traditionally based on the classical Lagrange multiplier method. This method makes extensive use of modelling details of the contacting bodies for contact enforcement as the contact surface meshes are in general non‐matching. To deal with this problem we introduce a novel element in the Lagrange multiplier approach of contact modelling, namely, a contact frame placed in between contacting bodies. It acts as a medium through which contact forces are transferred without violating equilibrium in the contact domain for discrete contact models. Only nodal information of the contacting bodies is required which makes the proposed contact enforcement generic. The contact frame has its own independent freedoms, which allows the formulation to pass contact patch tests by design. Copyright © 2002 John Wiley & Sons, Ltd.     

A new slideline/eroding algorithm for EPIC2

This paper describes a new slideline/eroding algorithm implemented into EPIC2 code (Johnson , 1986). It also presents some results of impact calculations which show that this new algorithm not only better resolved the interface between two impacting bodies, but also smoothed out the curvature of the slideline. This was all done without an undue increase of CPU (central processing unit) time.     

A stable Lagrange multiplier space for stiff interface conditions within the extended finite element method

This paper introduces a new algorithm to define a stable Lagrange multiplier space to impose stiff interface conditions within the context of the extended finite element method. In contrast to earlier approaches, we do not work with an interior penalty formulation as, e.g. for Nitsche techniques, but impose the constraints weakly in terms of Lagrange multipliers. Roughly speaking a stable and optimal discrete Lagrange multiplier space has to satisfy two criteria: a best approximation property and a uniform inf–sup condition. Owing to the fact that the interface does not match the edges of the mesh, the choice of a good discrete Lagrange multiplier space is not trivial. Here we propose a new algorithm for the local construction of the Lagrange multiplier space and show that a uniform inf–sup condition is satisfied. A counterexample is also presented, i.e. the inf–sup constant depends on the mesh‐size and degenerates as it tends to zero. Numerical results in two‐dimensional confirm the theoretical ones. Copyright © 2008 John Wiley & Sons, Ltd.     

巴西圆盘中心裂纹摩擦接触问题的逐点Lagrange乘子法

采用逐点Lagrange乘子法求解巴西圆盘中心裂纹在压剪荷载作用下裂纹面可能发生的摩擦接触问题。为了避免传统的Lagrange乘子法中总刚度阵求逆的困难,将Lagrange乘子逐点转到局部坐标系下,采用Gauss-Seidel迭代法求解法向和切向乘子,同时注意在求解的过程中对切向乘子约束修正,待所有点乘子求解完成后再变换到整体坐标系下迭代求解位移。与传统接触算法相比,该算法无需对总刚度阵求逆,降低了求解规模,提高了计算效率。通过该方法计算了巴西圆盘中心裂纹两种典型情况下的应力强度因子,计算结果与文献比较,吻合良好。考虑不同荷载角和裂纹长度对位移,应力强度因子和接触区的影响,并对不同摩擦系数下应力强度因子的影响进行了分析。结果表明:忽略裂纹接触摩擦作用,应力强度因子可能被高估。     

A scalable Lagrange multiplier based domain decomposition method for time-dependent problems

We present a new efficient and scalable domain decomposition method for solving implicitly linear and non-linear time-dependent problems in computational mechanics. The method is derived by adding a coarse problem to the recently proposed transient FETI substructuring algorithm in order to propagate the error globally and accelerate convergence. It is proved that in the limit for large time steps, the new method converges toward the FETI algorithm for time-independent problems. Computational results confirm that the optimal convergence properties of the time-independent FETI method are preserved in the time-dependent case. We employ an iterative scheme for solving efficiently the coarse problem on massively parallel processors, and demonstrate the effective scalability of the new transient FETI method with the large-scale finite element dynamic analysis on the Paragon XP/S and IBM SP2 systems of several diffraction grating finite element structural models. We also show that this new domain decomposition method outperforms the popular direct skyline solver. The coarse problem presented herein is applicable and beneficial to a large class of Lagrange multiplier based substructuring algorithms for time-dependent problems, including the fictitious domain decomposition method.     

A mortar finite element approach for point,line, and surface contact

An approach for investigating finite deformation contact problems with frictional effects with a special emphasis on nonsmooth geometries such as sharp corners and edges is proposed in this contribution. The contact conditions are separately enforced for point contact, line contact, and surface contact by employing 3 different sets of Lagrange multipliers and, as far as possible, a variationally consistent discretization approach based on mortar finite element methods. The discrete unknowns due to the Lagrange multiplier approach are eliminated from the system of equations by employing so‐called dual or biorthogonal shape functions. For the combined algorithm, no transition parameters are required, and the decision between point contact, line contact, and surface contact is implicitly made by the variationally consistent framework. The algorithm is supported by a penalty regularization for the special scenario of nonparallel edge‐to‐edge contact. The robustness and applicability of the proposed algorithms are demonstrated with several numerical examples.     

DESIGN OF ENERGY CONSERVING ALGORITHMS FOR FRICTIONLESS DYNAMIC CONTACT PROBLEMS

This paper proposes a formulation of dynamic contact problems which enables exact algorithmic conservation of linear momentum, angular momentum, and energy in finite element simulations. It is seen that a Lagrange multiplier enforcement of an appropriate contact rate constraint produces these conservation properties. A related method is presented in which a penalty regularization of the aforementioned rate constraint is utilized. This penalty method sacrifices the energy conservation property, but is dissipative under all conditions of changing contact so that the global algorithm remains stable. Notably, it is also shown that augmented Lagrangian iteration utilizing this penalty kernel reproduces the energy conserving (i.e. Lagrange multiplier) solution to any desired degree of accuracy. The result is a robust, stable method even in the context of large deformations, as is shown by some representative numerical examples. In particular, the ability of the formulation to produce accurate results where more traditional integration schemes fail is emphasized by the numerical simulations. © 1997 by John Wiley & Sons, Ltd.     

A higher‐order equilibrium finite element method

In this paper, a mixed spectral element formulation is presented for planar, linear elasticity. The degrees of freedom for the stress are integrated traction components, ie, surface force components. As a result, the tractions between elements are continuous. The formulation is based on minimization of the complementary energy subject to the constraints that the stress field should satisfy equilibrium of forces and moments. The Lagrange multiplier, which enforces equilibrium of forces, is the displacement field and the Lagrange multiplier, which enforces equilibrium of moments, is the rotation. The formulation satisfies equilibrium of forces pointwise if the body forces are piecewise polynomial. Equilibrium of moments is weakly satisfied. Results of the method are given on orthogonal and curvilinear domains, and an example with a point singularity is given.     

Fast BEM–FEM mortar coupling for acoustic–structure interaction

A coupling algorithm based on Lagrange multipliers is proposed for the simulation of structure–acoustic field interaction. Finite plate elements are coupled to a Galerkin boundary element formulation of the acoustic domain. The interface pressure is interpolated as a Lagrange multiplier, thus, allowing the coupling of non‐matching grids. The resulting saddle‐point problem is solved by an approximate Uzawa‐type scheme in which the matrix–vector products of the boundary element operators are evaluated efficiently by the fast multipole boundary element method. The algorithm is demonstrated on the example of a cavity‐backed elastic panel. Copyright © 2005 John Wiley & Sons, Ltd.     

Model-based image reconstruction by means of a constrained least-squares solution

The problem of the optimal use of object model information in image reconstruction is addressed. A closed-form solution for the estimated object spectrum is derived with the Lagrange multiplier technique, which assumes a measured image, knowledge of the optical transfer function, statistical information about the measurement noise, and a model of the object. This reconstruction algorithm is iterative in nature because the optimal Lagrange multiplier is not generally known at the start of the problem. We derive the estimator, describe one technique for determining the optimal Lagrange multiplier, demonstrate a stopping criterion based on the mean-square error between a noise-free image and the photon-limited version of the image, and show representative results for both filled- and sparse-aperture imaging applications.     

Conservative integration of rigid body motion by quaternion parameters with implicit constraints

An angular momentum and energy‐conserving time integration algorithm for rigid body rotation is formulated in terms of the quaternion parameters and the corresponding four‐component conjugate momentum vector via Hamilton's equations. The introduction of an extended mass matrix leads to a symmetric set of eight state‐space equations of motion. The extra inertial parameter serves as a multiplier on the kinematic constraint, and it is demonstrated that convergence characteristics are improved by selecting this parameter somewhat larger than the inertial moments. External loads enter these equations via the set of momentum equations. Initially, the normalization of the quaternion array is introduced via a Lagrange multiplier. However, this Lagrange multiplier can be expressed explicitly in terms of the gradient of the external load potential, and elimination of the Lagrange multiplier from the final format leaves only an explicit projection applied to the external load potential gradient. An algorithm is developed by forming a finite increment of the Hamiltonian. This procedure identifies the proper selection of increments and mean values, and leads to an algorithm with conservation of momentum and energy. Implementation, conservation properties, and accuracy of the algorithm are illustrated by examples with a flying box and a spinning top. Copyright © 2012 John Wiley & Sons, Ltd.     

Domain decomposition approach to flexible multibody dynamics simulation

Finite element based formulations for flexible multibody systems are becoming increasingly popular and as the complexity of the configurations to be treated increases, so does the computational cost. It seems natural to investigate the applicability of parallel processing to this type of problems; domain decomposition techniques have been used extensively for this purpose. In this approach, the computational domain is divided into non-overlapping sub-domains, and the continuity of the displacement field across sub-domain boundaries is enforced via the Lagrange multiplier technique. In the finite element literature, this approach is presented as a mathematical algorithm that enables parallel processing. In this paper, the divided system is viewed as a flexible multibody system, and the sub-domains are connected by kinematic constraints. Consequently, all the techniques applicable to the enforcement of constraints in multibody systems become applicable to the present problem. In particular, it is shown that a combination of the localized Lagrange multiplier technique with the augmented Lagrange formulation leads to interesting solution strategies. The proposed algorithm is compared with the well-known FETI approach with regards to convergence and efficiency characteristics. The present algorithm is relatively simple and leads to improved convergence and efficiency characteristics. Finally, implementation on a parallel computer was conducted for the proposed approach.     

A contact algorithm for cohesive cracks in the extended finite element method

Cracks with quasibrittle behavior are extremely common in engineering structures. The modeling of cohesive cracks involves strong nonlinearity in the contact, material, and complex transition between contact and cohesive forces. In this article, we propose a novel contact algorithm for cohesive cracks in the framework of the extended finite element method. A cohesive-contact constitutive model is introduced to characterize the complex mechanical behavior of the fracture process zone. To avoid the stress oscillations and ill-conditioned system matrix that often occur in the conventional contact approach, the proposed algorithm employs a special dual Lagrange multiplier to impose the contact constraint. This Lagrange multiplier is constructed by means of the area-weighted average and biorthogonality conditions at the element level. The system matrix can be condensed into a positive definite matrix with an unchanged size at a very low computational cost. In addition, we illustrate solving the cohesive crack contact problem using a novel iteration strategy. Several numerical experiments are performed to illustrate the efficiency and high-quality results of our method in contact analysis of cohesive cracks.     

Interface problems with quadratic X‐FEM: design of a stable multiplier space and error analysis

The aim of this paper is to propose a procedure to accurately compute curved interfaces problems within the extended finite element method and with quadratic elements. It is dedicated to gradient discontinuous problems, which cover the case of bimaterials as the main application. We focus on the use of Lagrange multipliers to enforce adherence at the interface, which makes this strategy applicable to cohesive laws or unilateral contact. Convergence then occurs under the condition that a discrete inf‐sup condition is passed. A dedicated P1 multiplier space intended for use with P2 displacements is introduced. Analytical proof that it passes the inf‐sup condition is presented in the two‐dimensional case. Under the assumption that this inf‐sup condition holds, a priori error estimates are derived for linear or quadratic elements as functions of the curved interface resolution and of the interpolation properties of the discrete Lagrange multipliers space. The estimates are successfully checked against several numerical experiments: disparities, when they occur, are explained in the literature. Besides, the new multiplier space is able to produce quadratic convergence from P2 displacements and quadratic geometry resolution. Copyright © 2014 John Wiley & Sons, Ltd.     

Examinations for terminal condition of Lagrange multiplier for heat transfer control problems

This paper presents a method to express the terminal condition of Lagrange multiplier by the solution of the steady adjoint equation. In the control problem based on the adjoint equation method, the terminal condition of Lagrange multiplier has been set zero to satisfy the stationary condition of the extended performance function. Therefore, there is a possibility that the control value near the terminal time cannot be appropriately expressed. To solve this problem, a method to express the terminal condition of Lagrange multiplier by the solution of the steady adjoint equation is proposed and examined. Finally, to confirm the propriety of the proposed method, this method is applied to the sequential control problem, and some remarks are made. Copyright © 2007 John Wiley & Sons, Ltd.     

Trust region methods for structural optimization using exact second order sensitivity

The performance of multiplier algorithms for structural optimization has been significantly improved by using trust regions. The trust regions are constructed using analytical second order sensitivity, and within this region, the augmented Lagrangian ? is minimized subject to bounds. Evaluation of first and second derivatives of ? by the adjoint method does not require derivations of individual (implicit) constraint functions, which makes the method economical. Eight test problems are considered and a vast improvement over previously used multiplier algorithms has been noted. Also, the algorithm is robust with respect to scaling, input parameters and starting designs.