Numerical Investigations on the Resonance Errors of Multiscale Discontinuous Galerkin Methods for One-Dimensional Stationary Schrödinger Equation

In this paper,numerical experiments are carried out to investigate the impact of penalty parameters in the numerical traces on the resonance errors of high-order multiscale discontinuous Galerkin(DG)methods(Dong et al.in J Sci Comput 66:321–345,2016;Dong and Wang in J Comput Appl Math 380:1–11,2020)for a one-dimensional stationary Schrödinger equation.Previous work showed that penalty parameters were required to be positive in error analysis,but the methods with zero penalty parameters worked fine in numerical simulations on coarse meshes.In this work,by performing extensive numerical experiments,we discover that zero penalty parameters lead to resonance errors in the multiscale DG methods,and taking positive penalty parameters can effectively reduce resonance errors and make the matrix in the global linear system have better condition numbers.

A New Two-Parameter Family of Nonlinear Conjugate Gradient Method Without Line Search for Unconstrained Optimization Problem

This paper puts forward a two-parameter family of nonlinear conjugate gradient(CG)method without line search for solving unconstrained optimization problem.The main feature of this method is that it does not rely on any line search and only requires a simple step size formula to always generate a sufficient descent direction.Under certain assumptions,the proposed method is proved to possess global convergence.Finally,our method is compared with other potential methods.A large number of numerical experiments show that our method is more competitive and effective.

Highly Accurate Golden Section Search Algorithms and Fictitious Time Integration Method for Solving Nonlinear Eigenvalue Problems

This study sets up two new merit functions,which are minimized for the detection of real eigenvalue and complex eigenvalue to address nonlinear eigenvalue problems.For each eigen-parameter the vector variable is solved from a nonhomogeneous linear system obtained by reducing the number of eigen-equation one less,where one of the nonzero components of the eigenvector is normalized to the unit and moves the column containing that component to the right-hand side as a nonzero input vector.1D and 2D golden section search algorithms are employed to minimize the merit functions to locate real and complex eigenvalues.Simultaneously,the real and complex eigenvectors can be computed very accurately.A simpler approach to the nonlinear eigenvalue problems is proposed,which implements a normalization condition for the uniqueness of the eigenvector into the eigenequation directly.The real eigenvalues can be computed by the fictitious time integration method(FTIM),which saves computational costs compared to the one-dimensional golden section search algorithm(1D GSSA).The simpler method is also combined with the Newton iterationmethod,which is convergent very fast.All the proposed methods are easily programmed to compute the eigenvalue and eigenvector with high accuracy and efficiency.

Route Search Method for Railway Replacement Buses Adopting Ant Colony Optimization

In recent years, Japan, and especially rural areas have faced the growing problems of debt-ridden local railway lines along with the population decline and aging population. Therefore, it is best to consider the discontinuation of local railway lines and introduce replacement buses to secure the transportation methods of the local people especially in rural areas. Based on the above background, targeting local railway lines that may be discontinued in the near future, appropriate bus stops when provided with potential bus stops were selected, the present study proposed a method that introduces routes for railway replacement buses adopting ant colony optimization (ACO). The improved ACO was designed and developed based on the requirements set concerning the route length, number of turns, road width, accessibility of railway lines and zones without bus stops as well as the constraint conditions concerning the route length, number of turns and zones without bus stops. Original road network data were generated and processed adopting a geographic information systems (GIS), and these are used to search for the optimal route for railway replacement buses adopting the improved ACO concerning the 8 zones on the target railway line (JR Kakogawa line). By comparing the improved ACO with Dijkstra’s algorithm, its relevance was verified and areas needing further improvements were revealed.

A study on the numerical prediction method for the vertical thermal structure in the Bohai Sea and the Huanghai Sea-I.One-dimensional numerical prediction model

In this paper, on the basis of the heat conduction equation without consideration of the advection and turbulence effects, one-dimensional model for describing surface sea temperature ( T1), bottom sea temperature ( Tt ) and the thickness of the upper homogeneous layer ( h ) is developed in terms of the dimensionless temperature θT and depth η and self-simulation function θT - f(η) of vertical temperature profile by means of historical temperature data.The results of trial prediction with our one-dimensional model on T, Th, h , the thickness and gradient of thermocline are satisfactory to some extent.

基于Elasticsearch的挂号系统设计与实现

目的:设计并实现基于Elasticsearch的挂号系统,解决传统挂号系统预约挂号方式单一和搜索挂号平台信息片面等问题,以满足患者日益增长的多元化和智能化就诊需求。方法:采用浏览器与服务器(B/S)架构实现挂号系统设计,前端使用有机对象描述语言(NOODL)渲染界面,并通过Typescript实现函数方法和接口数据交互,Elasticsearch搜索引擎实现高效的搜索功能。后端通过基于边的云对象存储(ECOS)系统处理数据请求,并将业务数据存储在MySQL数据库中。系统包括应用层、服务层和存储层3层架构,可实现登录注册、搜索预约、链接预约、扫码预约、医生设置预约信息等功能。结果:基于Elasticsearch的挂号系统可实现线上搜索预约、医院专属链接预约、扫码预约等多种预约挂号方式,适用于Web和移动设备等多个平台。截止2023年6月,系统拥有医生219人,服务19903例患者,完成预约62737次,为患者就医节省大量时间,提高了医院运转效率。结论:基于Elasticsearch的挂号系统能够满足患者的多元化和智能化就诊需求,为患者提供全面、准确及智能的预约诊疗服务,有效提高诊疗效率。

An Adaptive Spectral Conjugate Gradient Method with Restart Strategy

As a generalization of the two-term conjugate gradient method(CGM),the spectral CGM is one of the effective methods for solving unconstrained optimization.In this paper,we enhance the JJSL conjugate parameter,initially proposed by Jiang et al.(Computational and Applied Mathematics,2021,40:174),through the utilization of a convex combination technique.And this improvement allows for an adaptive search direction by integrating a newly constructed spectral gradient-type restart strategy.Then,we develop a new spectral CGM by employing an inexact line search to determine the step size.With the application of the weak Wolfe line search,we establish the sufficient descent property of the proposed search direction.Moreover,under general assumptions,including the employment of the strong Wolfe line search for step size calculation,we demonstrate the global convergence of our new algorithm.Finally,the given unconstrained optimization test results show that the new algorithm is effective.

An efficient locally one-dimensional finite-difference time-domain method based on the conformal scheme

An efficient conformal locally one-dimensional finite-difference time-domain（LOD-CFDTD） method is presented for solving two-dimensional（2D） electromagnetic（EM） scattering problems. The formulation for the 2D transverse-electric（TE） case is presented and its stability property and numerical dispersion relationship are theoretically investigated. It is shown that the introduction of irregular grids will not damage the numerical stability. Instead of the staircasing approximation, the conformal scheme is only employed to model the curve boundaries, whereas the standard Yee grids are used for the remaining regions. As the irregular grids account for a very small percentage of the total space grids, the conformal scheme has little effect on the numerical dispersion. Moreover, the proposed method, which requires fewer arithmetic operations than the alternating-direction-implicit（ADI） CFDTD method, leads to a further reduction of the CPU time. With the total-field/scattered-field（TF/SF） boundary and the perfectly matched layer（PML）, the radar cross section（RCS） of two2 D structures is calculated. The numerical examples verify the accuracy and efficiency of the proposed method.

Algebraic Calculation Method of One-Dimensional Steady Compressible Gas Flow

This paper describes a new method of calculation of one-dimensional steady compressible gas flows in channels with possible heat and mass exchange through perforated sidewalls. The channel is divided into small elements of a finite size for which mass, energy and momentum conservation laws are written in the integral form, assuming linear distribution of the parameters along the length. As a result, the calculation is reduced to finding the roots of a quadratic algebraic equation, thus providing an alternative to numerical methods based on differential equations. The advantage of this method is its high tolerance to coarse discretization of the calculation area as well as its good applicability for transonic flow calculations.

Alternating Group Explicit Iterative Methods for One-Dimensional Advection-Diffusion Equation

The finite difference method such as alternating group iterative methods is useful in numerical method for evolutionary equations and this is the standard approach taken in this paper. Alternating group explicit (AGE) iterative methods for one-dimensional convection diffusion equations problems are given. The stability and convergence are analyzed by the linear method. Numerical results of the model problem are taken. Known test problems have been studied to demonstrate the accuracy of the method. Numerical results show that the behavior of the method with emphasis on treatment of boundary conditions is valuable.

Controlling the Bandgaps of One-Dimensional TiO2/SiO2, TiO2/SnO2, and SiO2/SnO2 Photonic Crystals Using the Transfer Matrix Method

One-dimensional photonic crystals (1D PhCs) have a unique ability to control the propagation of light waves, however certain classes of 1D oxides remain relatively unexplored for use as PhCs. Specifically, there has not been a comparative study of the three different 1D PhC structures to compare the influence of layer thickness, number, and refractive index on the ability of the PhCs to control light transmission. Herein, we use the transfer matrix method (TMM) to theoretically examine the transmission of 1D PhCs composed of layers of TiO2/SiO2, TiO2/SnO2, SiO2/SnO2, and combinations of the three with various top and bottom layer thicknesses to cover a substantial region of the electromagnetic spectrum (UV to NIR). With increasing layer numbers for TiO2/SiO2 and SiO2/SnO2, the edges became sharper and wider and the photonic bandgap width increased. Moreover, we demonstrated that PhCs with significantly thick TiO2/SiO2 layers had a high transmittance for a wide bandgap, allowing for wide-band optical filter applications. These different PhC architectures could enable a variety of applications, depending on the properties needed.

GLOBAL CONVERGENCE RESULTS OF A THREE TERM MEMORY GRADIENT METHOD WITH A NON-MONOTONE LINE SEARCH TECHNIQUE

In this paper, a new class of three term memory gradient method with non-monotone line search technique for unconstrained optimization is presented. Global convergence properties of the new methods are discussed. Combining the quasi-Newton method with the new method, the former is modified to have global convergence property. Numerical results show that the new algorithm is efficient.

Exact analytic solutions for an elliptic hole with asymmetric collinear cracks in a one-dimensional hexagonal quasi-crystal

Using the complex variable function method and the technique of conformal mapping, the anti-plane shear problem of an elliptic hole with asymmetric colfinear cracks in a one-dimensional hexagonal quasi-crystal is solved, and the exact analytic solutions of the stress intensity factors （SIFs） for mode Ⅲ problem are obtained. Under the limiting conditions, the present results reduce to the Griffith crack and many new results obtained as well, such as the circular hole with asymmetric collinear cracks, the elliptic hole with a straight crack, the mode T crack, the cross crack and so on. As far as the phonon field is concerned, these results, which play an important role in many practical and theoretical applications, are shown to be in good agreement with the classical results.

One-dimensional nonlinear consolidation analysis of soil with continuous drainage boundary

Following the assumptions proposed by MESRI and ROKHSAR,the one-dimensional nonlinear consolidation problem of soil under constant loading is studied by introducing continuous drainage boundary.The numerical solution is derived by using finite difference method and its correctness is assessed by comparing with existing analytical and numerical solutions.Based on the present solution,the effects of interface parameters,stress ratios(i.e.,final effective stress over initial effective stress,N_(σ))and the ratio c_(c)/c_(k)of compression index to permeability index on the consolidation behavior of soil are studied in detail.The results show that,the characteristics of one-dimensional nonlinear consolidation of soil are not only related to c_(c)/c_(k)and N_(σ),but also related to boundary conditions.In the engineering practice,the soil drainage rate of consolidation process can be designed by adjusting the values of interface parameters.

Recursive super-convergence computation for multi-dimensional problems via one-dimensional element energy pro jection technique

This paper presents a strategy for computation of super-convergent solutions of multi-dimensional problems in the finite element method （FEM） by recursive application of the one-dimensional （1D） element energy projection （EEP） technique. The main idea is to conceptually treat multi-dimensional problems as generalized 1D problems, based on which the concepts of generalized 1D FEM and its consequent EEP formulae have been developed in a unified manner. Equipped with these concepts, multi-dimensional problems can be recursively discretized in one dimension at each step, until a fully discretized standard finite element （FE） model is reached. This conceptual dimension-by- dimension （D-by-D） discretization procedure is entirely equivalent to a full FE discretization. As a reverse D-by-D recovery procedure, by using the unified EEP formulae together with proper extraction of the generalized nodal solutions, super-convergent displacements and first derivatives for two-dimensional （2D） and three-dimensional （3D） problems can be obtained over the domain. Numerical examples of 3D Poisson＇s equation and elasticity problem are given to verify the feasibility and effectiveness of the proposed strategy.

Study on boundary search method for DFM mesh generation

The boundary mesh of the casting model was determined by direct calculation on the triangular facets extracted from the STL file of the 3D model. Then the inner and outer grids of the model were identified by the algorithm in which we named Inner Seed Grid Method. Finally, a program to automatically generate a 3D FDM mesh was compiled. In the paper, a method named Triangle Contraction Search Method (TCSM) was put forward to ensure not losing the boundary grids; while an algorithm to search inner seed grids to identify inner/outer grids of the casting model was also brought forward. Our algorithm was simple, clear and easy to construct program. Three examples for the casting mesh generation testified the validity of the program.

Effective elastic properties of one-dimensional hexagonal quasicrystal composites

The explicit expression of Eshelby tensors for one-dimensional(1D) hexagonal quasicrystal composites is presented by using Green’s function method. The closed forms of Eshelby tensors in the special cases of spheroid, elliptic cylinder, ribbon-like,penny-shaped, and rod-shaped inclusions embedded in 1 D hexagonal quasicrystal matrices are given. As an application of Eshelby tensors, the analytical expressions for the effective properties of the 1 D hexagonal quasicrystal composites are derived based on the Mori-Tanaka method. The effects of the volume fraction of the inclusion on the elastic properties of the composite materials are discussed.

A New Genetic Algorithm Based on Niche Technique and Local Search Method

The genetic algorithm has been widely used in many fields as an easy robust global search and optimization method. In this paper, a new generic algorithm based on niche technique and local search method is presented under the consideration of inadequacies of the simple genetic algorithm. In order to prove the adaptability and validity of the improved genetic algorithm, optimization problems of multimodal functions with equal peaks, unequal peaks and complicated peak distribution are discussed. The simulation results show that compared to other niching methods, this improved genetic algorithm has obvious potential on many respects, such as convergence speed, solution accuracy, ability of global optimization, etc.

Dual threshold search method for asperity boundary determination based on geodetic and seismic catalog data

As an important model for explaining the seismic rupture mode,the asperity model plays an important role in studying the stress accumulation of faults and the location of earthquake initiation.Taking Qilian-Haiyuan fault as an example,this paper combines geodetic method and b-value method to propose a multi-source observation data fusion detection method that accurately determines the asperity boundary named dual threshold search method.The method is based on the criterion that the b-value asperity boundary should be most consistent with the slip deficit rate asperity boundary.Then the optimal threshold combination of slip deficit rate and b-value is obtained through threshold search,which can be used to determine the boundary of the asperity.Based on this method,the study finds that there are four potential asperities on the Qilian-Haiyuan fault:two asperities(A1 and A2)are on the Tuolaishan segment and the other two asperities(B and C)are on Lenglongling segment and Jinqianghe segment,respectively.Among them,the lengths of asperities A1 and A2 on Tuolaishan segment are 17.0 km and 64.8 km,respectively.And the lower boundaries are 5.5 km and 15.5 km,respectively;The length of asperity B on Lenglongling segment is 70.7 km,and the lower boundary is 10.2 km.The length of asperity C on Jinqianghe segment is 42.3 km,and the lower boundary is 8.3 km.

A Hybrid Unit Commitment Approach Incorporating Modified Priority List with Charged System Search Methods

This paper presents a new hybrid approach that combines Modified Priority List (MPL) with Charged System Search (CSS), termed MPL-CSS, to solve one of the most crucial power system’s operational optimization problems, known as unit commitment (UC) scheduling. The UC scheduling problem is a mixed-integer nonlinear problem, highly-dimensional and extremely constrained. Existing meta-heuristic UC solution methods have the problems of stopping at a local optimum and slow convergence when applied to large-scale, heavily-constrained UC applications. In the first step of the proposed method, initial hourly optimum solutions of UC are obtained by Modified Priority List (MPL);however, the obtained UC solution may still be possible to be further improved. Therefore, in the second step, the CSS is utilized to achieve higher quality solutions. The UC is formulated as mixed integer linear programming to ensure the tractability of the results. The proposed method is successfully applied to a popular test system up to 100 units generators for both 24-hr and 168-hr system. Computational results show that both solution cost and execution time are superior to those of published methods.