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.

A Simple Embedding Method for the Laplace-Beltrami Eigenvalue Problem onImplicit Surfaces

We propose a simple embedding method for computing the eigenvalues and eigenfunctions of the Laplace-Beltrami operator on implicit surfaces.The approach follows an embedding approach for solving the surface eikonal equation.We replace the differential operator on the interface with a typical Cartesian differential operator in the surface neighborhood.Our proposed algorithm is easy to implement and efficient.We will give some two-and three-dimensional numerical examples to demonstrate the effectiveness of our proposed approach.

THE INTERIOR TRANSMISSION EIGENVALUE PROBLEM FOR AN ANISOTROPIC MEDIUM BY A PARTIALLY COATED BOUNDARY

We consider the interior transmission eigenvalue problem corresponding to the scattering for an anisotropic medium of the scalar Helmholtz equation in the case where the boundary?Ωis split into two disjoint parts and possesses different transmission conditions.Using the variational method,we obtain the well posedness of the interior transmission problem,which plays an important role in the proof of the discreteness of eigenvalues.Then we achieve the existence of an infinite discrete set of transmission eigenvalues provided that n≡1,where a fourth order differential operator is applied.In the case of n■1,we show the discreteness of the transmission eigenvalues under restrictive assumptions by the analytic Fredholm theory and the T-coercive method.

Physics-constrained neural network for solving discontinuous interface K-eigenvalue problem with application to reactor physics

Machine learning-based modeling of reactor physics problems has attracted increasing interest in recent years.Despite some progress in one-dimensional problems,there is still a paucity of benchmark studies that are easy to solve using traditional numerical methods albeit still challenging using neural networks for a wide range of practical problems.We present two networks,namely the Generalized Inverse Power Method Neural Network(GIPMNN)and Physics-Constrained GIPMNN(PC-GIPIMNN)to solve K-eigenvalue problems in neutron diffusion theory.GIPMNN follows the main idea of the inverse power method and determines the lowest eigenvalue using an iterative method.The PC-GIPMNN additionally enforces conservative interface conditions for the neutron flux.Meanwhile,Deep Ritz Method(DRM)directly solves the smallest eigenvalue by minimizing the eigenvalue in Rayleigh quotient form.A comprehensive study was conducted using GIPMNN,PC-GIPMNN,and DRM to solve problems of complex spatial geometry with variant material domains from the fleld of nuclear reactor physics.The methods were compared with the standard flnite element method.The applicability and accuracy of the methods are reported and indicate that PC-GIPMNN outperforms GIPMNN and DRM.

Estimates on the eigenvalues of complex nonlocal Sturm-Liouville problems

The present paper deals with the eigenvalues of complex nonlocal Sturm-Liouville boundary value problems.The bounds of the real and imaginary parts of eigenvalues for the nonlocal Sturm-Liouville differential equation involving complex nonlocal potential terms associated with nonlocal boundary conditions are obtained in terms of the integrable conditions of coefficients and the real part of the eigenvalues.

Association of preschool children behavior and emotional problems with the parenting behavior of both parents

BACKGROUND Parental behaviors are key in shaping children’s psychological and behavioral development,crucial for early identification and prevention of mental health issues,reducing psychological trauma in childhood.AIM To investigate the relationship between parenting behaviors and behavioral and emotional issues in preschool children.METHODS From October 2017 to May 2018,7 kindergartens in Ma’anshan City were selected to conduct a parent self-filled questionnaire-Health Development Survey of Preschool Children.Children’s Strength and Difficulties Questionnaire(Parent Version)was applied to measures the children’s behavioral and emotional performance.Parenting behavior was evaluated using the Parental Behavior Inventory.Binomial logistic regression model was used to analyze the association between the detection rate of preschool children’s behavior and emotional problems and their parenting behaviors.RESULTS High level of parental support/participation was negatively correlated with conduct problems,abnormal hyperactivity,abnormal total difficulty scores and abnormal prosocial behavior problems.High level of maternal support/participation was negatively correlated with abnormal emotional symptoms and abnormal peer interaction in children.High level of parental hostility/coercion was positively correlated with abnormal emotional symptoms,abnormal conduct problems,abnormal hyperactivity,abnormal peer interaction,and abnormal total difficulty scores in children(all P<0.05).Moreover,paternal parenting behaviors had similarly effects on behavior and emotional problems of preschool children compared with maternal parenting behaviors(all P>0.05),after calculating ratio of odds ratio values.CONCLUSION Our study found that parenting behaviors are associated with behavioral and emotional issues in preschool children.Overall,the more supportive or involved the parents are,the fewer behavioral and emotional problems the children experience;conversely,the more hostile or controlling the parents are,the more behavioral and emotional problems the children face.Moreover,the impact of fathers’parenting behaviors on preschool children’s behavior and emotions is no less significant than that of mothers’parenting behaviors.

Real eigenvalues determined by recursion of eigenstates

Quantum physics is primarily concerned with real eigenvalues,stemming from the unitarity of time evolutions.With the introduction of PT symmetry,a widely accepted consensus is that,even if the Hamiltonian of the system is not Hermitian,the eigenvalues can still be purely real under specific symmetry.Hence,great enthusiasm has been devoted to exploring the eigenvalue problem of non-Hermitian systems.In this work,from a distinct perspective,we demonstrate that real eigenvalues can also emerge under the appropriate recursive condition of eigenstates.Consequently,our findings provide another path to extract the real energy spectrum of non-Hermitian systems,which guarantees the conservation of probability and stimulates future experimental observations.

Efficient method to calculate the eigenvalues of the Zakharov–Shabat system

A numerical method is proposed to calculate the eigenvalues of the Zakharov–Shabat system based on Chebyshev polynomials. A mapping in the form of tanh(ax) is constructed according to the asymptotic of the potential function for the Zakharov–Shabat eigenvalue problem. The mapping can distribute Chebyshev nodes very well considering the gradient for the potential function. Using Chebyshev polynomials, tanh(ax) mapping, and Chebyshev nodes, the Zakharov–Shabat eigenvalue problem is transformed into a matrix eigenvalue problem. This method has good convergence for the Satsuma–Yajima potential and the convergence rate is faster than the Fourier collocation method. This method is not only suitable for simple potential functions but also converges quickly for a complex Y-shape potential. It can also be further extended to other linear eigenvalue problems.

Enhancing Critical Path Problem in Neutrosophic Environment Using Python

In the real world,one of the most common problems in project management is the unpredictability of resources and timelines.An efficient way to resolve uncertainty problems and overcome such obstacles is through an extended fuzzy approach,often known as neutrosophic logic.Our rigorous proposed model has led to the creation of an advanced technique for computing the triangular single-valued neutrosophic number.This innovative approach evaluates the inherent uncertainty in project durations of the planning phase,which enhances the potential significance of the decision-making process in the project.Our proposed method,for the first time in the neutrosophic set literature,not only solves existing problems but also introduces a new set of problems not yet explored in previous research.A comparative study using Python programming was conducted to examine the effectiveness of responsive and adaptive planning,as well as their differences from other existing models such as the classical critical path problem and the fuzzy critical path problem.The study highlights the use of neutrosophic logic in handling complex projects by illustrating an innovative dynamic programming framework that is robust and flexible,according to the derived results,and sets the stage for future discussions on its scalability and application across different industries.

A Comparative Study of Metaheuristic Optimization Algorithms for Solving Real-World Engineering Design Problems

Real-world engineering design problems with complex objective functions under some constraints are relatively difficult problems to solve.Such design problems are widely experienced in many engineering fields,such as industry,automotive,construction,machinery,and interdisciplinary research.However,there are established optimization techniques that have shown effectiveness in addressing these types of issues.This research paper gives a comparative study of the implementation of seventeen new metaheuristic methods in order to optimize twelve distinct engineering design issues.The algorithms used in the study are listed as:transient search optimization(TSO),equilibrium optimizer(EO),grey wolf optimizer(GWO),moth-flame optimization(MFO),whale optimization algorithm(WOA),slimemould algorithm(SMA),harris hawks optimization(HHO),chimp optimization algorithm(COA),coot optimization algorithm(COOT),multi-verse optimization(MVO),arithmetic optimization algorithm(AOA),aquila optimizer(AO),sine cosine algorithm(SCA),smell agent optimization(SAO),and seagull optimization algorithm(SOA),pelican optimization algorithm(POA),and coati optimization algorithm(CA).As far as we know,there is no comparative analysis of recent and popular methods against the concrete conditions of real-world engineering problems.Hence,a remarkable research guideline is presented in the study for researchersworking in the fields of engineering and artificial intelligence,especiallywhen applying the optimization methods that have emerged recently.Future research can rely on this work for a literature search on comparisons of metaheuristic optimization methods in real-world problems under similar conditions.

An Effective Meshless Approach for Inverse Cauchy Problems in 2D and 3D Electroelastic Piezoelectric Structures

In the past decade,notable progress has been achieved in the development of the generalized finite difference method(GFDM).The underlying principle of GFDM involves dividing the domain into multiple sub-domains.Within each sub-domain,explicit formulas for the necessary partial derivatives of the partial differential equations(PDEs)can be obtained through the application of Taylor series expansion and moving-least square approximation methods.Consequently,the method generates a sparse coefficient matrix,exhibiting a banded structure,making it highly advantageous for large-scale engineering computations.In this study,we present the application of the GFDM to numerically solve inverse Cauchy problems in two-and three-dimensional piezoelectric structures.Through our preliminary numerical experiments,we demonstrate that the proposed GFDMapproach shows great promise for accurately simulating coupled electroelastic equations in inverse problems,even with 3%errors added to the input data.

Optimal Shape Factor and Fictitious Radius in the MQ-RBF:Solving Ill-Posed Laplacian Problems

To solve the Laplacian problems,we adopt a meshless method with the multiquadric radial basis function(MQRBF)as a basis whose center is distributed inside a circle with a fictitious radius.A maximal projection technique is developed to identify the optimal shape factor and fictitious radius by minimizing a merit function.A sample function is interpolated by theMQ-RBF to provide a trial coefficient vector to compute the merit function.We can quickly determine the optimal values of the parameters within a preferred rage using the golden section search algorithm.The novel method provides the optimal values of parameters and,hence,an optimal MQ-RBF;the performance of the method is validated in numerical examples.Moreover,nonharmonic problems are transformed to the Poisson equation endowed with a homogeneous boundary condition;this can overcome the problem of these problems being ill-posed.The optimal MQ-RBF is extremely accurate.We further propose a novel optimal polynomial method to solve the nonharmonic problems,which achieves high precision up to an order of 10^(−11).

Identifying multidisciplinary problems from scientific publications based on a text generation method

Purpose:A text generation based multidisciplinary problem identification method is proposed,which does not rely on a large amount of data annotation.Design/methodology/approach:The proposed method first identifies the research objective types and disciplinary labels of papers using a text classification technique;second,it generates abstractive titles for each paper based on abstract and research objective types using a generative pre-trained language model;third,it extracts problem phrases from generated titles according to regular expression rules;fourth,it creates problem relation networks and identifies the same problems by exploiting a weighted community detection algorithm;finally,it identifies multidisciplinary problems based on the disciplinary labels of papers.Findings:Experiments in the“Carbon Peaking and Carbon Neutrality”field show that the proposed method can effectively identify multidisciplinary research problems.The disciplinary distribution of the identified problems is consistent with our understanding of multidisciplinary collaboration in the field.Research limitations:It is necessary to use the proposed method in other multidisciplinary fields to validate its effectiveness.Practical implications:Multidisciplinary problem identification helps to gather multidisciplinary forces to solve complex real-world problems for the governments,fund valuable multidisciplinary problems for research management authorities,and borrow ideas from other disciplines for researchers.Originality/value:This approach proposes a novel multidisciplinary problem identification method based on text generation,which identifies multidisciplinary problems based on generative abstractive titles of papers without data annotation required by standard sequence labeling techniques.

Oscillation properties of eigenfunctions for Sturm-Liouville problems with interface conditions via Prufer transformation

A class of Sturm-Liouville problems with discontinuity is studied in this paper.The oscillation properties of eigenfunctions for Sturm-Liouville problems with interface conditions are obtained.The main method used in this paper is based on Prufer transformation,which is different from the classical ones.Moreover,we give two examples to verify our main results.

Review of Computational Approaches to Optimization Problems in Inhomogeneous Rods and Plates

In this paper,we review computational approaches to optimization problems of inhomogeneous rods and plates.We consider both the optimization of eigenvalues and the localization of eigenfunctions.These problems are motivated by physical problems including the determination of the extremum of the fundamental vibration frequency and the localization of the vibration displacement.We demonstrate how an iterative rearrangement approach and a gradient descent approach with projection can successfully solve these optimization problems under different boundary conditions with different densities given.

ON THE CAUCHY PROBLEM FOR THE GENERALIZED BOUSSINESQ EQUATION WITH A DAMPED TERM

This paper is devoted to the Cauchy problem for the generalized damped Boussinesq equation with a nonlinear source term in the natural energy space.With the help of linear time-space estimates,we establish the local existence and uniqueness of solutions by means of the contraction mapping principle.The global existence and blow-up of the solutions at both subcritical and critical initial energy levels are obtained.Moreover,we construct the sufficient conditions of finite time blow-up of the solutions with arbitrary positive initial energy.

On the eigenvalues and eigendisplacement of the critical mode in horizontally layered media

Wave propagation in horizontally layered media is a classical problem in seismic-wave theory.In semi-infinite space,a nondispersive Rayleigh wave mode exists,and the eigendisplacement decays exponentially with depth.In a layered model with increasing layer velocity,the phase velocity of the Rayleigh wave varies between the S-wave velocity of the bottom half-space and that of the classical Rayleigh wave propagated in a supposed half-space formed by the parameters of the top layer.If the phase velocity is the same as the P-or S-wave velocity of the layer,which is called the critical mode or critical phase velocity of surface waves,the general solution of the wave equation is not a homogeneous(expressed by trigonometric functions)or inhomogeneous(expressed by exponential functions)plane wave,but one whose amplitude changes linearly with depth(expressed by a linear function).Theories based on a general solution containing only trigonometric or exponential functions do not apply to the critical mode,owing to the singularity at the critical phase velocity.In this study,based on the classical framework of generalized reflection and transmission coefficients,the propagation of surface waves in horizontally layered media was studied by introducing a solution for the linear function at the critical phase velocity.Therefore,the eigenvalues and eigenfunctions of the critical mode can be calculated by solving a singular problem.The eigendisplacement characteristics associated with the critical phase velocity were investigated for different layered models.In contrast to the normal mode,the eigendisplacement associated with the critical phase velocity exhibits different characteristics.If the phase velocity is equal to the S-wave velocity in the bottom half-space,the eigendisplacement remains constant with increasing depth.

Problematic Use of Video Games in Schools in Northern Benin (2023)

Objective: To study the problematic use of video games among secondary school students in the city of Parakou in 2023. Methods: Descriptive cross-sectional study conducted in the commune of Parakou from December 2022 to July 2023. The study population consisted of students regularly enrolled in public and private secondary schools in the city of Parakou for the 2022-2023 academic year. A two-stage non-proportional stratified sampling technique combined with simple random sampling was adopted. The Problem Video Game Playing (PVP) scale was used to assess problem gambling in the study population, while anxiety and depression were assessed using the Hospital Anxiety and Depression Scale (HADS). Results: A total of 1030 students were included. The mean age of the pupils surveyed was 15.06 ± 2.68 years, with extremes of 10 and 28 years. The [13 - 18] age group was the most represented, with a proportion of 59.6% (614) in the general population. Females predominated, at 52.8% (544), with a sex ratio of 0.89. The prevalence of problematic video game use was 24.9%, measured using the Video Game Playing scale. Associated factors were male gender (p = 0.005), pocket money under 10,000 cfa (p = 0.001) and between 20,000 - 90,000 cfa (p = 0.030), addictive family behavior (p < 0.001), monogamous family (p = 0.023), good relationship with father (p = 0.020), organization of video game competitions (p = 0.001) and definite anxiety (p Conclusion: Substance-free addiction is struggling to attract the attention it deserves, as it did in its infancy everywhere else. This study complements existing data and serves as a reminder of the need to focus on this group of addictions, whose problematic use of video games remains the most frequent due to its accessibility and social tolerance. Preventive action combined with curative measures remains the most effective means of combating the problem at national level.

Reciprocal Distance Laplacian Eigenvalue Distribution Based on Graph Parameters

Let G be a connected graph of order n and m_(RD)^(L)_(G)I denote the number of reciprocal distance Laplacian eigenvaluesof G in an interval I.For a given interval I,we mainly present several bounds on m_(RD)^(L)_(G)I in terms of various structuralparameters of the graph G,including vertex-connectivity,independence number and pendant vertices.

Quafu-Qcover:Explore combinatorial optimization problems on cloud-based quantum computers

We introduce Quafu-Qcover,an open-source cloud-based software package developed for solving combinatorial optimization problems using quantum simulators and hardware backends.Quafu-Qcover provides a standardized and comprehensive workflow that utilizes the quantum approximate optimization algorithm(QAOA).It facilitates the automatic conversion of the original problem into a quadratic unconstrained binary optimization(QUBO)model and its corresponding Ising model,which can be subsequently transformed into a weight graph.The core of Qcover relies on a graph decomposition-based classical algorithm,which efficiently derives the optimal parameters for the shallow QAOA circuit.Quafu-Qcover incorporates a dedicated compiler capable of translating QAOA circuits into physical quantum circuits that can be executed on Quafu cloud quantum computers.Compared to a general-purpose compiler,our compiler demonstrates the ability to generate shorter circuit depths,while also exhibiting superior speed performance.Additionally,the Qcover compiler has the capability to dynamically create a library of qubits coupling substructures in real-time,utilizing the most recent calibration data from the superconducting quantum devices.This ensures that computational tasks can be assigned to connected physical qubits with the highest fidelity.The Quafu-Qcover allows us to retrieve quantum computing sampling results using a task ID at any time,enabling asynchronous processing.Moreover,it incorporates modules for results preprocessing and visualization,facilitating an intuitive display of solutions for combinatorial optimization problems.We hope that Quafu-Qcover can serve as an instructive illustration for how to explore application problems on the Quafu cloud quantum computers.