This paper proposes a numerical solution method for upper bound shakedown analysis of perfectly elasto-plastic thin plates by employing the C^(1) natural element method.Based on the Koiter’s theorem and von Mises yie...This paper proposes a numerical solution method for upper bound shakedown analysis of perfectly elasto-plastic thin plates by employing the C^(1) natural element method.Based on the Koiter’s theorem and von Mises yield criterion,the nonlinear mathematical programming formulation for upper bound shakedown analysis of thin plates is established.In this formulation,the trail function of residual displacement increment is approximated by using the C^(1) shape functions,the plastic incompressibility condition is satisfied by introducing a constant matrix in the objective function,and the time integration is resolved by using the Konig’s technique.Meanwhile,the objective function is linearized by distinguishing the non-plastic integral points from the plastic integral points and revising the objective function and associated equality constraints at each iteration.Finally,the upper bound shakedown load multipliers of thin plates are obtained by direct iterative and monotone convergence processes.Several benchmark examples verify the good precision and fast convergence of this proposed method.展开更多
In this paper, a new elimination of finite differential equations has been discussed. It applies the numerical direct iteration to obtain the residual equations, in which the number of unknowns has been reduced greatl...In this paper, a new elimination of finite differential equations has been discussed. It applies the numerical direct iteration to obtain the residual equations, in which the number of unknowns has been reduced greatly. The solution process is simple and efficient, and the solution is exact展开更多
In this paper we study the computational performance of variants of an algebraic additive Schwarz preconditioner for the Schur complement for the solution of large sparse linear systems.In earlier works,the local Schu...In this paper we study the computational performance of variants of an algebraic additive Schwarz preconditioner for the Schur complement for the solution of large sparse linear systems.In earlier works,the local Schur complements were computed exactly using a sparse direct solver.The robustness of the preconditioner comes at the price of this memory and time intensive computation that is the main bottleneck of the approach for tackling huge problems.In this work we investigate the use of sparse approximation of the dense local Schur complements.These approximations are computed using a partial incomplete LU factorization.Such a numerical calculation is the core of the multi-level incomplete factorization such as the one implemented in pARMS. The numerical and computing performance of the new numerical scheme is illustrated on a set of large 3D convection-diffusion problems;preliminary experiments on linear systems arising from structural mechanics are also reported.展开更多
An adaptive beamforming algorithm named robust joint iterative optimizationdirection adaptive （RJIO-DA） is proposed for large-array scenarios. Based on the framework of minimum variance distortionless response （MVD...An adaptive beamforming algorithm named robust joint iterative optimizationdirection adaptive （RJIO-DA） is proposed for large-array scenarios. Based on the framework of minimum variance distortionless response （MVDR）, the proposed algorithm jointly updates a transforming matrix and a reduced-rank filter. Each column of the transforming matrix is treated as an independent direction vector and updates the weight values of each dimension within a subspace. In addition, the direction vector rotation improves the performance of the algorithm by reducing the uncertainties due to the direction error. Simulation results show that the RJIO-DA algorithm has lower complexity and faster convergence than other conventional reduced-rank algorithms.展开更多
To improve the computational efficiency and hold calculation accuracy at the same time,we study the parallel computation for radiation heat transfer. In this paper, the discrete ordinates method（DOM） and the spatial...To improve the computational efficiency and hold calculation accuracy at the same time,we study the parallel computation for radiation heat transfer. In this paper, the discrete ordinates method（DOM） and the spatial domain decomposition parallelization（DDP） are combined by message passing interface（MPI） language. The DDP–DOM computation of the radiation heat transfer within the rectangular furnace is described. When the result of DDP–DOM along one-dimensional direction is compared with that along multi-dimensional directions, it is found that the result of the latter one has higher precision without considering the medium scattering. Meanwhile, an in-depth study of the convergence of DDP–DOM for radiation heat transfer is made. Analyzing the cause of the weak convergence, we relate the total number of iteration steps when the convergence is obtained to the number of sub-domains. When we decompose the spatial domain along one-,two- and three-dimensional directions, different linear relationships between the number of total iteration steps and the number of sub-domains will be possessed separately, then several equations are developed to show the relationships. Using the equations, some phenomena in DDP–DOM can be made clear easily. At the same time, the correctness of the equations is verified.展开更多
With the increasing of detection ability of passive sonar,the weak signal detection problem in multiple interferences becomes more and more important.In the time/bearing record（TBR） display of sonar detection,when t...With the increasing of detection ability of passive sonar,the weak signal detection problem in multiple interferences becomes more and more important.In the time/bearing record（TBR） display of sonar detection,when there exist traces of multiple interferences,the identification of weak signal is difficult or impossible.The adaptive noise cancellation technique provides the theoretical basis for suppressing strong interferences.But the solution for finding the steady-state optimum filter matrix is quite difficult due to the real time calculation of inverse matrix of input data correlation matrix.The iterative inverse beamforming（IBF） algorithm for solving the optimum filter vector,which is expressed by inverse matrix of the ocean environment data,is derived in this paper,by which,the optimum filter can be eventually expressed as a sum of series simple matrices of constructed from sensor data.Based on the algorithm proposed in this paper,some examples of at sea experiment are provided.The strong interferences are cancelled and the weak signal is emerged,even it didn＇t appear in the conventional beamforming（CBF） processing.展开更多
This paper proposes a decentralized robust two-stage dispatch framework for multi-area integrated electric-gas systems (M-IEGSs), with the consideration of Weymouth and linepack equations of tie-pipelines. The overall...This paper proposes a decentralized robust two-stage dispatch framework for multi-area integrated electric-gas systems (M-IEGSs), with the consideration of Weymouth and linepack equations of tie-pipelines. The overall methodology includes the equivalent conversion for the robust two-stage program and the decentralized optimization for the equivalent form. To obtain a tractable and equivalent counterpart for the robust two-stage program, a quadruple-loop procedure based on the column-and-constraint generation (C&CG) and the penalty convex-concave procedure (P-CCP) algorithms is derived, resulting in a series of mixed integer second-order cone programs (MISOCPs). Then, an improved I-ADMM is proposed to realize the decentralized optimization for MISOCPs. Moreover, three acceleration methods are devised to reduce the computation burden. Simulation results validate the effectiveness of the proposed methodology and corresponding acceleration measures.展开更多
The two-dimensional(2D)space-fractional diffusion equations can be effectively discretized by an implicit finite difference scheme with the shifted Grünwald formula.The coefficient matrices of the discretized lin...The two-dimensional(2D)space-fractional diffusion equations can be effectively discretized by an implicit finite difference scheme with the shifted Grünwald formula.The coefficient matrices of the discretized linear systems are equal to the sum of the identity matrix and a block-Toeplitz with a Toeplitz-block matrix.In this paper,one variant of the alternating direction implicit(ADI)iteration method is proposed to solve the discretized linear systems.By making use of suitable permutations,each iteration of the ADI iteration method requires the solutions of two linear subsystems whose coefficient matrices are block diagonal matrices with diagonal blocks being Toeplitz matrices.These two linear subsystems can be solved block by block by fast or superfast direct methods.Theoretical analyses show that the ADI iteration method is convergent.In particular,we derive a sharp upper bound about its asymptotic convergence rate and deduce the optimal value of its iteration parameter.Numerical results exhibit that the corresponding ADI preconditioner can improve the computational efficiency of the Krylov subspace iteration methods.展开更多
This paper presents optimum an one-parameter iteration (OOPI) method and a multi-parameter iteration direct (MPID) method for efficiently solving linear algebraic systems with low order matrix A and high order matrix ...This paper presents optimum an one-parameter iteration (OOPI) method and a multi-parameter iteration direct (MPID) method for efficiently solving linear algebraic systems with low order matrix A and high order matrix B: Y = (A B)Y + Φ. On parallel computers (also on serial computer) the former will be efficient, even very efficient under certain conditions, the latter will be universally very efficient.展开更多
基金supported by the Chinese Postdoctoral Science Foundation(2013M540934)supported by the National Key Research and Development Program of China(2016YFC0801905,2017YFF0210704).
文摘This paper proposes a numerical solution method for upper bound shakedown analysis of perfectly elasto-plastic thin plates by employing the C^(1) natural element method.Based on the Koiter’s theorem and von Mises yield criterion,the nonlinear mathematical programming formulation for upper bound shakedown analysis of thin plates is established.In this formulation,the trail function of residual displacement increment is approximated by using the C^(1) shape functions,the plastic incompressibility condition is satisfied by introducing a constant matrix in the objective function,and the time integration is resolved by using the Konig’s technique.Meanwhile,the objective function is linearized by distinguishing the non-plastic integral points from the plastic integral points and revising the objective function and associated equality constraints at each iteration.Finally,the upper bound shakedown load multipliers of thin plates are obtained by direct iterative and monotone convergence processes.Several benchmark examples verify the good precision and fast convergence of this proposed method.
文摘In this paper, a new elimination of finite differential equations has been discussed. It applies the numerical direct iteration to obtain the residual equations, in which the number of unknowns has been reduced greatly. The solution process is simple and efficient, and the solution is exact
基金developed in the framework of the associated team PhyLeas(Study of parallel hybrid sparse linear solvers) funded by INRIA where the partners are INRIA,T.U.Brunswick and University of Minnesotasupported by the US Department of Energy under grant DE-FG-08ER25841 and by the Minnesota Supercomputer Institute.
文摘In this paper we study the computational performance of variants of an algebraic additive Schwarz preconditioner for the Schur complement for the solution of large sparse linear systems.In earlier works,the local Schur complements were computed exactly using a sparse direct solver.The robustness of the preconditioner comes at the price of this memory and time intensive computation that is the main bottleneck of the approach for tackling huge problems.In this work we investigate the use of sparse approximation of the dense local Schur complements.These approximations are computed using a partial incomplete LU factorization.Such a numerical calculation is the core of the multi-level incomplete factorization such as the one implemented in pARMS. The numerical and computing performance of the new numerical scheme is illustrated on a set of large 3D convection-diffusion problems;preliminary experiments on linear systems arising from structural mechanics are also reported.
基金supported by the National Science&Technology Pillar Program(2013BAF07B03)Zhejiang Provincial Natural Science Foundation of China(LY13F010009)
文摘An adaptive beamforming algorithm named robust joint iterative optimizationdirection adaptive （RJIO-DA） is proposed for large-array scenarios. Based on the framework of minimum variance distortionless response （MVDR）, the proposed algorithm jointly updates a transforming matrix and a reduced-rank filter. Each column of the transforming matrix is treated as an independent direction vector and updates the weight values of each dimension within a subspace. In addition, the direction vector rotation improves the performance of the algorithm by reducing the uncertainties due to the direction error. Simulation results show that the RJIO-DA algorithm has lower complexity and faster convergence than other conventional reduced-rank algorithms.
基金co-supported by the National Nature Science Foundation of China(No.51176039)the Ph.D.Programs Foundation of Ministry of Education of China(No.20102302110015)
文摘To improve the computational efficiency and hold calculation accuracy at the same time,we study the parallel computation for radiation heat transfer. In this paper, the discrete ordinates method（DOM） and the spatial domain decomposition parallelization（DDP） are combined by message passing interface（MPI） language. The DDP–DOM computation of the radiation heat transfer within the rectangular furnace is described. When the result of DDP–DOM along one-dimensional direction is compared with that along multi-dimensional directions, it is found that the result of the latter one has higher precision without considering the medium scattering. Meanwhile, an in-depth study of the convergence of DDP–DOM for radiation heat transfer is made. Analyzing the cause of the weak convergence, we relate the total number of iteration steps when the convergence is obtained to the number of sub-domains. When we decompose the spatial domain along one-,two- and three-dimensional directions, different linear relationships between the number of total iteration steps and the number of sub-domains will be possessed separately, then several equations are developed to show the relationships. Using the equations, some phenomena in DDP–DOM can be made clear easily. At the same time, the correctness of the equations is verified.
基金supported by the National Natural Science Foundation of China(11304343)
文摘With the increasing of detection ability of passive sonar,the weak signal detection problem in multiple interferences becomes more and more important.In the time/bearing record（TBR） display of sonar detection,when there exist traces of multiple interferences,the identification of weak signal is difficult or impossible.The adaptive noise cancellation technique provides the theoretical basis for suppressing strong interferences.But the solution for finding the steady-state optimum filter matrix is quite difficult due to the real time calculation of inverse matrix of input data correlation matrix.The iterative inverse beamforming（IBF） algorithm for solving the optimum filter vector,which is expressed by inverse matrix of the ocean environment data,is derived in this paper,by which,the optimum filter can be eventually expressed as a sum of series simple matrices of constructed from sensor data.Based on the algorithm proposed in this paper,some examples of at sea experiment are provided.The strong interferences are cancelled and the weak signal is emerged,even it didn＇t appear in the conventional beamforming（CBF） processing.
文摘This paper proposes a decentralized robust two-stage dispatch framework for multi-area integrated electric-gas systems (M-IEGSs), with the consideration of Weymouth and linepack equations of tie-pipelines. The overall methodology includes the equivalent conversion for the robust two-stage program and the decentralized optimization for the equivalent form. To obtain a tractable and equivalent counterpart for the robust two-stage program, a quadruple-loop procedure based on the column-and-constraint generation (C&CG) and the penalty convex-concave procedure (P-CCP) algorithms is derived, resulting in a series of mixed integer second-order cone programs (MISOCPs). Then, an improved I-ADMM is proposed to realize the decentralized optimization for MISOCPs. Moreover, three acceleration methods are devised to reduce the computation burden. Simulation results validate the effectiveness of the proposed methodology and corresponding acceleration measures.
文摘The two-dimensional(2D)space-fractional diffusion equations can be effectively discretized by an implicit finite difference scheme with the shifted Grünwald formula.The coefficient matrices of the discretized linear systems are equal to the sum of the identity matrix and a block-Toeplitz with a Toeplitz-block matrix.In this paper,one variant of the alternating direction implicit(ADI)iteration method is proposed to solve the discretized linear systems.By making use of suitable permutations,each iteration of the ADI iteration method requires the solutions of two linear subsystems whose coefficient matrices are block diagonal matrices with diagonal blocks being Toeplitz matrices.These two linear subsystems can be solved block by block by fast or superfast direct methods.Theoretical analyses show that the ADI iteration method is convergent.In particular,we derive a sharp upper bound about its asymptotic convergence rate and deduce the optimal value of its iteration parameter.Numerical results exhibit that the corresponding ADI preconditioner can improve the computational efficiency of the Krylov subspace iteration methods.
基金national natural science foundation of China !(19671039).
文摘This paper presents optimum an one-parameter iteration (OOPI) method and a multi-parameter iteration direct (MPID) method for efficiently solving linear algebraic systems with low order matrix A and high order matrix B: Y = (A B)Y + Φ. On parallel computers (also on serial computer) the former will be efficient, even very efficient under certain conditions, the latter will be universally very efficient.
