Explore the vast range of titles available.

The free vibration responses are divergent based on a complex time-domain damping model. The traditional step by step integration method cannot be used to calculate the time-domain responses. Based on the theoretic solution that eliminates the divergent term for the complex damping model, the equivalent viscous damping model is proposed and the corresponding average acceleration method is realized in this paper. The numerical cases show that the calculated results of the equivalent viscous damped system are convergent, which are equal to the ones of the deleted divergent term based on the complex damping model. The correctness of the proposed method is verified, and the computational efficiency is high.

Compact and efficient Matlab implementations of compliance topology optimization (TO) for 2D and 3D continua are given, consisting of 99 and 125 lines respectively. On discretizations ranging from 3 ⋅ 10 4 to 4.8 ⋅ 10 5 elements, the 2D version, named top99neo, shows speedups from 2.55 to 5.5 times compared to the well-known top88 code of Andreassen et al. (Struct Multidiscip Optim 43(1):1–16, 2011 ). The 3D version, named top3D125, is the most compact and efficient Matlab implementation for 3D TO to date, showing a speedup of 1.9 times compared to the code of Amir et al. (Struct Multidiscip Optim 49(5):815–829, 2014 ), on a discretization with 2.2 ⋅ 10 5 elements. For both codes, improvements are due to much more efficient procedures for the assembly and implementation of filters and shortcuts in the design update step. The use of an acceleration strategy, yielding major cuts in the overall computational time, is also discussed, stressing its easy integration within the basic codes.

This work is focused on the topology optimization related to harmonic responses for large-scale problems. A comparative study is made among mode displacement method (MDM), mode acceleration method (MAM) and full method (FM) to highlight their effectiveness. It is found that the MDM results in the unsatisfactory convergence due to the low accuracy of harmonic responses, while MAM and FM have a good accuracy and evidently favor the optimization convergence. Especially, the FM is of superiority in both accuracy and efficiency under the excitation at one specific frequency; MAM is preferable due to its balance between the computing efficiency and accuracy when multiple excitation frequencies are taken into account.

In this study, a code or computer program has been developed as an educational material for courses on kinematics. This code is expected to help the learning of kinematic which mostly uses analysis of velocity and acceleration graphically. By using this code, explanation of velocity and acceleration analysis can be performed by the code/computer program, instead of using the ruler and protractor manually. This eases the teacher and student in learning of kinematic. The code is written based on MATLAB. GUI (Graphical User Interface) is used to make this code as a user friendly kinematic learning media. The calculation of velocity and acceleration is performed based on the method of relative velocity and relative acceleration. This code provides tutorial of velocity and acceleration analysis which is displayed in the GUI screen. The animation of movement and its trajectory is also displayed. In this present research work, acceleration analysis on slider crank mechanism created by the code is presented. The results is compared with the theoritical calculation and the differences are less than 1%. Therefore, the code is considered acceptable and feasible to enrich the learning experience in kinematics.

This work is focused on the structural topology optimization methods related to dynamic responses under harmonic base acceleration excitations. The uniform acceleration input model is chosen to be the input form of base excitations. In the dynamic response analysis, we propose using the large mass method (LMM) in which artificial large mass values are attributed to each driven nodal degree of freedom (DOF), which can thus transform the base acceleration excitations into force excitations. Mode displacement method (MDM) and mode acceleration method (MAM) are then used to calculate the harmonic responses and the design sensitivities due to their balances between computing efficiency and accuracy especially when frequency bands are taken into account. A density based topology optimization method of minimizing dynamic responses is then formulated based on the integration of LMM and MDM or MAM. Moreover, some particular appearances such as the precision of response analysis using MDM or MAM, and the duplicated frequencies are briefly discussed. Numerical examples are finally tested to verify the accuracy of the proposed schemes in dynamic response analysis and the quality of the optimized design in improving dynamic performances.

The dynamic response topology optimization problems are usually computationally expensive, so it is necessary to employ the model reduction methods to reduce computational cost. This work will investigate the effectiveness of the mode displacement method(MDM) and mode acceleration method(MAM) for time-domain response problems within the framework of density-based topology optimization. Three objective functions, the mean dynamic compliance, mean strain energy and mean squared displacement are considered. It is found that, in general cases, MDM is not suitable for time-domain response topology optimization problems due to its low accuracy of approximation, while MAM works well for problems of a wide range, and when there are many time steps, the MAM based topology optimization approach is more efficient than the direct integration based approach. So for practical applications, when the problem needs many time steps, the MAM based approach is preferred and otherwise, the direct integration based approach is suggested.

This paper concerns an acceleration method for fixed-point iterations that originated in work of D. G. Anderson [J. Assoc. Comput. Mach., 12 (1965), pp. 547–560], which we accordingly call Anderson acceleration here. This method has enjoyed considerable success and wide usage in electronic structure computations, where it is known as Anderson mixing; however, it seems to have been untried or underexploited in many other important applications. Moreover, while other acceleration methods have been extensively studied by the mathematics and numerical analysis communities, this method has received relatively little attention from these communities over the years. A recent paper by H. Fang and Y. Saad [Numer. Linear Algebra Appl., 16 (2009), pp. 197–221] has clarified a remarkable relationship of Anderson acceleration to quasi-Newton (secant updating) methods and extended it to define a broader Anderson family of acceleration methods. In this paper, our goals are to shed additional light on Anderson acceleration and to draw further attention to its usefulness as a general tool. We first show that, on linear problems, Anderson acceleration without truncation is \"essentially equivalent\" in a certain sense to the generalized minimal residual (GMRES) method. We also show that the Type 1 variant in the Fang—Saad Anderson family is similarly essentially equivalent to the Arnoldi (full orthogonalization) method. We then discuss practical considerations for implementing Anderson acceleration and illustrate its performance through numerical experiments involving a variety of applications.

The subspace minimization conjugate gradient methods based on Barzilai–Borwein method (SMCG_BB) and regularization model (SMCG_PR), which were proposed by Liu and Liu (J Optim Theory Appl 180(3):879–906, 2019) and Zhao et al. (Numer Algorithm, 2020. https://doi.org/10.1007/s11075-020-01017-1), respectively, are very interesting and efficient for unconstrained optimization. In this paper, two accelerated subspace minimization conjugate gradient methods are proposed for unconstrained optimization. Motivated by the subspace minimization conjugate gradient methods and the finite termination of linear conjugate gradient methods, we derive an acceleration parameter by the quadratic interpolation function to improve the stepsize, and the modified stepsize may be more closer to the stepsize obtained by exact line search. Moreover, several specific acceleration criteria to enhance the efficiency of the algorithm are designed. Under standard conditions, the global convergence of the proposed methods can be guaranteed. Numerical results show that the proposed accelerated methods are superior to two excellent subspace minimization conjugate gradient methods SMCG_BB and SMCG_PR.

Massive multiple input–multiple output (M-MIMO) is a promising and pivotal technology in contemporary wireless communication systems that can effectively enhance link reliability and data throughput, especially in uplink scenarios. Even so, the receiving end requires more computational complexity to reconstitute the signal. This problem has emerged in fourth-generation (4G) MIMO system; with the dramatic increase in demand for devices and data in beyond-5G (B5G) systems, this issue will become yet more obvious. To take into account both complexity and signal-revested capability at the receiver, this study uses the matrix iteration method to avoid the staggering amount of operations produced by the inverse matrix. Then, we propose a highly efficient multi-user detector (MUD) named hybrid SOR-based Chebyshev acceleration (CHSOR) for the uplink of M-MIMO orthogonal frequency-division multiplexing (OFDM) and universal filtered multi-carrier (UFMC) waveforms, which can be promoted to B5G developments. The proposed CHSOR scheme includes two stages: the first consists of successive over-relaxation (SOR) and modified successive over-relaxation (MSOR), combining the advantages of low complexity of both and generating a better initial transmission symbol, iteration matrix, and parameters for the next stage; sequentially, the second stage adopts the low-cost iterative Chebyshev acceleration method for performance refinement to obtain a lower bit error rate (BER). Under constrained evaluation settings, Section (Simulation Results and Discussion) presents the results of simulations performed in MATLAB version R2022a. Results show that the proposed detector can achieve a 91.624% improvement in BER performance compared with Chebyshev successive over-relaxation (CSOR). This is very near to the performance of the minimum mean square error (MMSE) detector and is achieved in only a few iterations. In summary, our proposed CHSOR scheme demonstrates fast convergence compared to previous works and as such possesses excellent BER and complexity performance, making it a competitive solution for uplink M-MIMO B5G systems.

With wave-particle decomposition, a unified gas-kinetic wave-particle (UGKWP) method has been developed for multiscale flow simulations. With the variation of the cell Knudsen number, the UGKWP method captures the transport process in all flow regimes without the kinetic solver’s constraint on the numerical mesh size and time step being determined by the kinetic particle mean free path and particle collision time. In the current UGKWP method, the cell Knudsen number, which is defined as the ratio of particle collision time to numerical time step, is used to distribute the components in the wave-particle decomposition. The adaptation of particles in the UGKWP method is mainly for the capturing of the non-equilibrium transport. In this aspect, the cell Knudsen number alone is not enough to identify the non-equilibrium state. For example, in the equilibrium flow regime with a Maxwellian distribution function, even at a large cell Knudsen number, the flow evolution can be still modelled by the Navier-Stokes solver. More specifically, in the near space environment both the hypersonic flow around a space vehicle and the plume flow from a satellite nozzle will encounter a far field rarefied equilibrium flow in a large computational domain. In the background dilute equilibrium region, the large particle collision time and a uniform small numerical time step can result in a large local cell Knudsen number and make the UGKWP method track a huge number of particles for the far field background flow in the original approach. But, in this region the analytical wave representation can be legitimately used in the UGKWP method to capture the nearly equilibrium flow evolution. Therefore, to further improve the efficiency of the UGKWP method for multiscale flow simulations, an adaptive UGKWP (AUGKWP) method is developed with the introduction of an additional local flow variable gradient-dependent Knudsen number. As a result, the wave-particle decomposition in the UGKWP method is determined by both the cell and gradient Knudsen numbers, and the use of particles in the UGKWP method is solely to capture the non-equilibrium flow transport. The current AUGKWP method becomes much more efficient than the previous one with the cell Knudsen number only in the determination of wave-particle composition. Many numerical tests, including Sod shock tube, normal shock structure, hypersonic flow around cylinder, flow around reentry capsule, and an unsteady nozzle plume flow, have been conducted to validate the accuracy and efficiency of the AUGKWP method. Compared with the original UGKWP method, the AUGKWP method achieves the same accuracy, but has advantages in memory reduction and computational efficiency in the simulation for flows with the co-existing of multiple regimes.