A novel method for simulating nuclear explosion with chemical explosion to form an approximate plane wave: Field test and numerical simulation

A nuclear explosion in the rock mass medium can produce strong shock waves,seismic shocks,and other destructive effects,which can cause extreme damage to the underground protection infrastructures.With the increase in nuclear explosion power,underground protection engineering enabled by explosion-proof impact theory and technology ushered in a new challenge.This paper proposes to simulate nuclear explosion tests with on-site chemical explosion tests in the form of multi-hole explosions.First,the mechanism of using multi-hole simultaneous blasting to simulate a nuclear explosion to generate approximate plane waves was analyzed.The plane pressure curve at the vault of the underground protective tunnel under the action of the multi-hole simultaneous blasting was then obtained using the impact test in the rock mass at the site.According to the peak pressure at the vault plane,it was divided into three regions:the stress superposition region,the superposition region after surface reflection,and the approximate plane stress wave zone.A numerical simulation approach was developed using PFC and FLAC to study the peak particle velocity in the surrounding rock of the underground protective cave under the action of multi-hole blasting.The time-history curves of pressure and peak pressure partition obtained by the on-site multi-hole simultaneous blasting test and numerical simulation were compared and analyzed,to verify the correctness and rationality of the formation of an approximate plane wave in the simulated nuclear explosion.This comparison and analysis also provided a theoretical foundation and some research ideas for the ensuing study on the impact of a nuclear explosion.

Determining Hubbard U of VO_(2) by the quasi-harmonic approximation

Vanadium dioxide VO_(2) is a strongly correlated material that undergoes a metal-to-insulator transition around 340 K.In order to describe the electron correlation effects in VO_(2), the DFT+U method is commonly employed in calculations.However, the choice of the Hubbard U parameter has been a subject of debate and its value has been reported over a wide range. In this paper, taking focus on the phase transition behavior of VO_(2), the Hubbard U parameter for vanadium oxide is determined by using the quasi-harmonic approximation(QHA). First-principles calculations demonstrate that the phase transition temperature can be modulated by varying the U values. The phase transition temperature can be well reproduced by the calculations using the Perdew–Burke–Ernzerhof functional combined with the U parameter of 1.5eV. Additionally,the calculated band structure, insulating or metallic properties, and phonon dispersion with this U value are in line with experimental observations. By employing the QHA to determine the Hubbard U parameter, this study provides valuable insights into the phase transition behavior of VO_(2). The findings highlight the importance of electron correlation effects in accurately describing the properties of this material. The agreement between the calculated results and experimental observations further validates the chosen U value and supports the use of the DFT+U method in studying VO_(2).

Saddlepoint Approximation Method in Reliability Analysis:A Review

The escalating need for reliability analysis(RA)and reliability-based design optimization(RBDO)within engineering challenges has prompted the advancement of saddlepoint approximationmethods(SAM)tailored for such problems.This article offers a detailed overview of the general SAM and summarizes the method characteristics first.Subsequently,recent enhancements in the SAM theoretical framework are assessed.Notably,the mean value first-order saddlepoint approximation(MVFOSA)bears resemblance to the conceptual framework of the mean value second-order saddlepoint approximation(MVSOSA);the latter serves as an auxiliary approach to the former.Their distinction is rooted in the varying expansion orders of the performance function as implemented through the Taylor method.Both the saddlepoint approximation and third-moment(SATM)and saddlepoint approximation and fourth-moment(SAFM)strategies model the cumulant generating function(CGF)by leveraging the initial random moments of the function.Although their optimal application domains diverge,each method consistently ensures superior relative precision,enhanced efficiency,and sustained stability.Every method elucidated is exemplified through pertinent RA or RBDO scenarios.By juxtaposing them against alternative strategies,the efficacy of these methods becomes evident.The outcomes proffered are subsequently employed as a foundation for contemplating prospective theoretical and practical research endeavors concerning SAMs.The main purpose and value of this article is to review the SAM and reliability-related issues,which can provide some reference and inspiration for future research scholars in this field.

Relaxed Stability Criteria for Time-Delay Systems:A Novel Quadratic Function Convex Approximation Approach

This paper develops a quadratic function convex approximation approach to deal with the negative definite problem of the quadratic function induced by stability analysis of linear systems with time-varying delays.By introducing two adjustable parameters and two free variables,a novel convex function greater than or equal to the quadratic function is constructed,regardless of the sign of the coefficient in the quadratic term.The developed lemma can also be degenerated into the existing quadratic function negative-determination(QFND)lemma and relaxed QFND lemma respectively,by setting two adjustable parameters and two free variables as some particular values.Moreover,for a linear system with time-varying delays,a relaxed stability criterion is established via our developed lemma,together with the quivalent reciprocal combination technique and the Bessel-Legendre inequality.As a result,the conservatism can be reduced via the proposed approach in the context of constructing Lyapunov-Krasovskii functionals for the stability analysis of linear time-varying delay systems.Finally,the superiority of our results is illustrated through three numerical examples.

An Overview of Sequential Approximation in Topology Optimization of Continuum Structure

This paper offers an extensive overview of the utilization of sequential approximate optimization approaches in the context of numerically simulated large-scale continuum structures.These structures,commonly encountered in engineering applications,often involve complex objective and constraint functions that cannot be readily expressed as explicit functions of the design variables.As a result,sequential approximation techniques have emerged as the preferred strategy for addressing a wide array of topology optimization challenges.Over the past several decades,topology optimization methods have been advanced remarkably and successfully applied to solve engineering problems incorporating diverse physical backgrounds.In comparison to the large-scale equation solution,sensitivity analysis,graphics post-processing,etc.,the progress of the sequential approximation functions and their corresponding optimizersmake sluggish progress.Researchers,particularly novices,pay special attention to their difficulties with a particular problem.Thus,this paper provides an overview of sequential approximation functions,related literature on topology optimization methods,and their applications.Starting from optimality criteria and sequential linear programming,the other sequential approximate optimizations are introduced by employing Taylor expansion and intervening variables.In addition,recent advancements have led to the emergence of approaches such as Augmented Lagrange,sequential approximate integer,and non-gradient approximation are also introduced.By highlighting real-world applications and case studies,the paper not only demonstrates the practical relevance of these methods but also underscores the need for continued exploration in this area.Furthermore,to provide a comprehensive overview,this paper offers several novel developments that aim to illuminate potential directions for future research.

Nonlinear Filtering With Sample-Based Approximation Under Constrained Communication:Progress, Insights and Trends

The nonlinear filtering problem has enduringly been an active research topic in both academia and industry due to its ever-growing theoretical importance and practical significance.The main objective of nonlinear filtering is to infer the states of a nonlinear dynamical system of interest based on the available noisy measurements. In recent years, the advance of network communication technology has not only popularized the networked systems with apparent advantages in terms of installation,cost and maintenance, but also brought about a series of challenges to the design of nonlinear filtering algorithms, among which the communication constraint has been recognized as a dominating concern. In this context, a great number of investigations have been launched towards the networked nonlinear filtering problem with communication constraints, and many samplebased nonlinear filters have been developed to deal with the highly nonlinear and/or non-Gaussian scenarios. The aim of this paper is to provide a timely survey about the recent advances on the sample-based networked nonlinear filtering problem from the perspective of communication constraints. More specifically, we first review three important families of sample-based filtering methods known as the unscented Kalman filter, particle filter,and maximum correntropy filter. Then, the latest developments are surveyed with stress on the topics regarding incomplete/imperfect information, limited resources and cyber security.Finally, several challenges and open problems are highlighted to shed some lights on the possible trends of future research in this realm.

EPSILON-ALGORITHM AND ETA-ALGORITHM OF GENERALIZED INVERSE FUNCTION-VALUED PAD APPROXIMANTS USING FOR SOLUTION OF INTEGRAL EQUATIONS

Two efficient recursive algorithms epsilon_algorithm and eta_algorithm are introduced to compute the generalized inverse function_valued Padé approximants. The approximants were used to accelerate the convergence of the power series with function_valued coefficients and to estimate characteristic value of the integral equations. Famous Wynn identities of the Pad approximants is also established by means of the connection of two algorithms.

Adomian decomposition method and Padé approximants for solving the Blaszak-Marciniak lattice

The Adomian decomposition method （ADM） and Pade approximants are combined to solve the well-known Blaszak-Marciniak lattice, which has rich mathematical structures and many important applications in physics and mathematics. In some cases, the truncated series solution of ADM is adequate only in a small region when the exact solution is not reached. To overcome the drawback, the Pade approximants, which have the advantage in turning the polynomials approximation into a rational function, are applied to the series solution to improve the accuracy and enlarge the convergence domain. By using the ADM-Pade technique, the soliton solutions of the Blaszak-Marciniak lattice are constructed with better accuracy and better convergence than by using the ADM alone. Numerical and figurative illustrations show that it is a promising tool for solving nonlinear problems.

A Note on Pad Approximants Pairs as Limits of Algebraic Polynomials Pairs of Weighted Best Approximation in Orlicz Spaces

In this short note, we show the behavior in Orlicz spaces of best approximations by algebraic polynomials pairs on union of neighborhoods, when the measure of them tends to zero.

COMPUTATION FORMULAS OF GENERALIZED INVERSE PAD APPROXIMANTS USING FOR SOLUTION OF INTEGRAL EQUATIONS

For the generalized inverse function-valued Pade approximants, its intact computation formulas are given. The explicit determinantal formulas for the denominator scalar polynomials and the numerator function-valued polynomials are first established. A useful existence condition is given by means of determinant form.

Distribution of Points of Interpolation and of Zeros of Exactly Maximally Convergent Multipoint PadéApproximants

Given a regular compact set E in , a unit measure μ supported by , a triangular point set , and a function f , holomorphic on E , let πβ,fn,m be the associated multipoint β-Padé approximant of order (n,m) . We show that if the sequence πβ,fn,m , n∈Λ , ∧∈n,k are uniformly distributed on with respect to u as n∈Λ . Furthermore, a result about the behavior of the zeros of the exact maximally convergent sequence Λ is provided, under the condition that Λ is “dense enough”.

Vector Approximate Message Passing with Sparse Bayesian Learning for Gaussian Mixture Prior

Compressed sensing(CS)aims for seeking appropriate algorithms to recover a sparse vector from noisy linear observations.Currently,various Bayesian-based algorithms such as sparse Bayesian learning(SBL)and approximate message passing(AMP)based algorithms have been proposed.For SBL,it has accurate performance with robustness while its computational complexity is high due to matrix inversion.For AMP,its performance is guaranteed by the severe restriction of the measurement matrix,which limits its application in solving CS problem.To overcome the drawbacks of the above algorithms,in this paper,we present a low complexity algorithm for the single linear model that incorporates the vector AMP(VAMP)into the SBL structure with expectation maximization(EM).Specifically,we apply the variance auto-tuning into the VAMP to implement the E step in SBL,which decrease the iterations that require to converge compared with VAMP-EM algorithm when using a Gaussian mixture(GM)prior.Simulation results show that the proposed algorithm has better performance with high robustness under various cases of difficult measurement matrices.

Integrating a novel irrigation approximation method with a process-based remote sensing model to estimate multi-years'winter wheat yield over the North China Plain

Accurate estimation of regional winter wheat yields is essential for understanding the food production status and ensuring national food security.However,using the existing remote sensing-based crop yield models to accurately reproduce the inter-annual and spatial variations in winter wheat yields remains challenging due to the limited ability to acquire irrigation information in water-limited regions.Thus,we proposed a new approach to approximating irrigations of winter wheat over the North China Plain(NCP),where irrigation occurs extensively during the winter wheat growing season.This approach used irrigation pattern parameters(IPPs)to define the irrigation frequency and timing.Then,they were incorporated into a newly-developed process-based and remote sensing-driven crop yield model for winter wheat(PRYM–Wheat),to improve the regional estimates of winter wheat over the NCP.The IPPs were determined using statistical yield data of reference years(2010–2015)over the NCP.Our findings showed that PRYM–Wheat with the optimal IPPs could improve the regional estimate of winter wheat yield,with an increase and decrease in the correlation coefficient(R)and root mean square error(RMSE)of 0.15(about 37%)and 0.90 t ha–1(about 41%),respectively.The data in validation years(2001–2009 and 2016–2019)were used to validate PRYM–Wheat.In addition,our findings also showed R(RMSE)of 0.80(0.62 t ha–1)on a site level,0.61(0.91 t ha–1)for Hebei Province on a county level,0.73(0.97 t ha–1)for Henan Province on a county level,and 0.55(0.75 t ha–1)for Shandong Province on a city level.Overall,PRYM–Wheat can offer a stable and robust approach to estimating regional winter wheat yield across multiple years,providing a scientific basis for ensuring regional food security.

PADE APPROXIMANTS AS LIMITS OF RATIONAL FUNCTIONS OF BEST APPROXIMATION IN ORLICZ SPACE

In this paper, we prove that the best rational approximation of a given analytic function in Orlicz space L~*(G), where G = {|z|≤∈}, converges to the Pade approximants of the function as the measure of G approaches zero.

Low-Rank Positive Approximants of Symmetric Matrices

Given a symmetric matrix X, we consider the problem of finding a low-rank positive approximant of X. That is, a symmetric positive semidefinite matrix, S, whose rank is smaller than a given positive integer, , which is nearest to X in a certain matrix norm. The problem is first solved with regard to four common norms: The Frobenius norm, the Schatten p-norm, the trace norm, and the spectral norm. Then the solution is extended to any unitarily invariant matrix norm. The proof is based on a subtle combination of Ky Fan dominance theorem, a modified pinching principle, and Mirsky minimum-norm theorem.

A New Class of Vector PadéApproximants in the Asymptotic Numerical Method: Application in Nonlinear 2D Elasticity

The Asymptotic Numerical Method (ANM) is a family of algorithms for path following problems, where each step is based on the computation of truncated vector series [1]. The Vector Padé approximants were introduced in the ANM to improve the domain of validity of vector series and to reduce the number of steps needed to obtain the entire solution path [1,2]. In this paper and in the framework of the ANM, we define and build a new type of Vector Padé approximant from a truncated vector series by extending the definition of the Padé approximant of a scalar series without any orthonormalization procedure. By this way, we define a new class of Vector Padé approximants which can be used to extend the domain of validity in the ANM algorithms. There is a connection between this type of Vector Padé approximant and Vector Padé type approximant introduced in [3, 4]. We show also that the Vector Padé approximants introduced in the previous works [1,2], are special cases of this class. Applications in 2D nonlinear elasticity are presented.

A PROPERTY OF HERMITE-PADE INTERPOLATION ON THE ROOTS OF UNITY

We extend a theorem of Ivanev and Saff to show that for the Hermite-Pade interpolant at the roots of unity to a function meromorphic in the unit disc, its leading coefficients vanish if and only if the corresponding interpolani to a related function vanishes at given points outside the unit disc. The result is then extended to simultaneous Hermite-Pade interpolation to a finite set of functions.

Adomian Decomposition Method and Padé Approximants for Nonlinear Differential-Difference Equations

有 Pad é approximants 的联合 Adomian 分解方法(ADM ) ，我们解决二个微分差别的方程(DDE ) ：相对论的 Toda 格子方程和修改 Volterra 格子方程。在符号的计算枫树的帮助下， ADM-Pad é技术获得的结果与独自使用 ADM 获得的那些相比。数字结果比使用 ADM 证明 ADM-Pad é技术在集中的更大的领域与更快的集中率和更高的精确性和亲戚给近似答案。

CONVERGENCE IN MEASURE OF MULTIVARIATE PADE APPROXIMANTS

Convergence conclusions of Pade approximants in the univariate case can be found in various papers. However,resuhs in the multivariate case are few.A.Cuyt seems to be the only one who discusses convergence for multivariate Pade approximants,she gives in[2]a de Montessus de Bollore type theorem.In this paper,we will discuss the zero set of a real multivariate polynomial,and present a convergence theorem in measure of multivariate Pade approximant.The proof technique used in this paper is quite different from that used in the univariate case.

A Comparative Survey of an Approximate Solution Method for Stochastic Delay Differential Equations

This study is focused on the approximate solution for the class of stochastic delay differential equations. The techniques applied involve the use of Caratheodory and Euler Maruyama procedures which approximated to stochastic delay differential equations. Based on the Caratheodory approximate procedure, it was proved that stochastic delay differential equations have unique solution and established that the Caratheodory approximate solution converges to the unique solution of stochastic delay differential equations under the Cauchy sequence and initial condition. This Caratheodory approximate procedure and Euler method both converge at the same rate. This is achieved by replacing the present state with past state. The existence and uniqueness of an approximate solution of the stochastic delay differential equation were shown and the approximate solution to the unique solution was also shown. .