期刊文献+
共找到155,072篇文章
< 1 2 250 >
每页显示 20 50 100
Re-examination of the Two-Body Problem Using Our New General System Theory 被引量:3
1
作者 PAN Lingli CUI Weicheng 《Journal of Philosophy Study》 2021年第12期891-913,共23页
It is well-known that philosophical conflicts exist among classical mechanics,quantum mechanics and relativistic mechanics.In order to use the framework of general system theory to unify these three mechanics subjects... It is well-known that philosophical conflicts exist among classical mechanics,quantum mechanics and relativistic mechanics.In order to use the framework of general system theory to unify these three mechanics subjects,a new general system theory is developed based on a new ontology of ether and minds as the fundamental existences in the world.The two-body problem is the simplest model in mechanics and in this paper,it is re-examined by using our new general system theory.It is found that the current description of the classical full two-body problem is inappropriate since the observer and the measurement apparatus have not been explicitly considered.After considering these,it is actually a three-body problem while only the special case of the Kepler problem is the two-body problem.By introducing the concepts of psychic force and psychic field,all the possible movement states in the two-body problem can be explained within the framework of classical mechanics.There is no need to change the meanings of many fundamental concepts,such as time,space,matter,mass,and energy as done in quantum mechanics and relativity theory.This points out a new direction for the unification of different theories. 展开更多
关键词 two-body problem new general system theory gravitational field psychic field classical mechanics quantum mechanics relativity theory
在线阅读 下载PDF
GENERALIZED HOMOGENEOUS FUNCTIONS AND THE TWO-BODY PROBLEM
2
作者 C.Biasi S.M.S.Godoy 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 2005年第2期171-178,共8页
A generalization of the homogeneous function concept is studied.An application is done with a solution of the two-body problem.
关键词 homogeneous function generalized homogeneous function Kepler's second law two-body problem
在线阅读 下载PDF
Approximate and Exact GR-Solutions for the Two-Body Problem
3
作者 Jan Helm 《Journal of High Energy Physics, Gravitation and Cosmology》 CAS 2022年第3期690-723,共34页
A binary gravitational rotator, also called the two-body problem, is a pair of masses m<sub>1</sub>, m<sub>2</sub> moving around their center-of-mass (com) in their own gravitational field. In ... A binary gravitational rotator, also called the two-body problem, is a pair of masses m<sub>1</sub>, m<sub>2</sub> moving around their center-of-mass (com) in their own gravitational field. In Newtonian gravitation, the two-body problem can be described by a single reduced mass (gravitational rotator) m<sub>r</sub> = m<sub>1</sub>m<sub>2</sub>/(m<sub>1</sub>+m<sub>2</sub>) orbiting around the total mass m = m<sub>1</sub>+m<sub>2</sub> situated in com in the distance r, which is the distance between the two original masses. In this paper, we discuss the rotator in Newtonian, Schwarzschild and Kerr spacetime context. We formulate the corresponding Kerr orbit equations, and adapt the Kerr rotational parameter to the Newtonian correction of the rotator potential. We present a vacuum solution of Einstein equations (Manko-Ruiz), which is a generalized Kerr spacetime with five parameters g<sub>μν</sub> (m<sub>1</sub>, m<sub>2</sub>, R, a<sub>1</sub>, a<sub>2</sub>), and adapt it to the Newtonian correction for observer orbits. We show that the Manko-Ruiz metric is the exact solution of the GR-two-body problem (i.e. GR-rotator) and express the orbit energy and angular momentum in terms of the 5 parameters. We calculate and discuss Manko-Ruiz rotator orbits in their own field, and present numerical results for two examples. Finally, we carry out numerical calculations of observer orbits in the rotator field for all involved models and compare them. 展开更多
关键词 General Relativity two-body problem Gravitational Rotator Kerr Metric Generalized Kerr Metric
在线阅读 下载PDF
The Criteria for Reducing Centrally Restricted Three-Body Problem to Two-Body Problem
4
作者 Bijay Kumar Sharma 《International Journal of Astronomy and Astrophysics》 2024年第1期1-19,共19页
Our Solar System contains eight planets and their respective natural satellites excepting the inner two planets Mercury and Venus. A satellite hosted by a given Planet is well protected by the gravitational pertubatio... Our Solar System contains eight planets and their respective natural satellites excepting the inner two planets Mercury and Venus. A satellite hosted by a given Planet is well protected by the gravitational pertubation of much heavier planets such as Jupiter and Saturn if the natural satellite lies deep inside the respective host Planet Hill sphere. Each planet has a Hill radius a<sub>H</sub> and planet mean radius R<sub>P </sub>and the ratio R<sub>1</sub>=R<sub>P</sub>/a<sub>H</sub>. Under very low R<sub>1 </sub>(less than 0.006) the approximation of CRTBP (centrally restricted three-body problem) to two-body problem is valid and planet has spacious Hill lobe to capture a satellite and retain it. This ensures a high probability of capture of natural satellite by the given planet and Sun’s perturbation on Planet-Satellite binary can be neglected. This is the case with Earth, Mars, Jupiter, Saturn, Neptune and Uranus. But Mercury and Venus has R<sub>1</sub>=R<sub>P</sub>/a<sub>H</sub> =0.01 and 5.9862 × 10<sup>-3</sup> respectively hence they have no satellites. There is a limit to the dimension of the captured body. It must be a much smaller body both dimensionally as well masswise. The qantitative limit is a subject of an independent study. 展开更多
关键词 Hill’s Radius two-body problem Fixed-Point Solution Lagrange Points Earth-Moon-Test Particle CRTBP
在线阅读 下载PDF
Neural networks-based solution of the two-body problem
5
作者 Zhuojun Hou Qinbo Sun Zhaohui Dang 《Astrodynamics》 2025年第4期537-564,共28页
This paper presents a novel machine learning approach designed to efficiently solve the classical two-body problem.The inherent structure of the two-body problem involves the integration of a system of second-order no... This paper presents a novel machine learning approach designed to efficiently solve the classical two-body problem.The inherent structure of the two-body problem involves the integration of a system of second-order nonlinear ordinary differential equations.Conventional numerical integration techniques that rely on small computation steps result in a prolonged computational time.Moreover,calculus has limitations in resolving the two-body problem,inevitably converging towards an unresolved Kepler equation of a transcendental nature.To address this issue,we integrate the conventional analytical solution based on true anomaly with a deep neural network representation of the Kepler equation.This results in a highly accurate closed-form solution that is solely dependent on time,which is termed a learning-based solution to the two-body problem.To enhance the precision,a correction module based on Halley iteration is introduced,which substantially improves the final solution in terms of precision and computational cost.Compared to stateof-the-art methods such as the piecewise Padéapproximation,Adomian decomposition method,and modified Mikkola's method,our approach achieves a computational speedup of several thousand to tens of thousands,while maintaining accuracy in large-scale orbit propagation scenarios.Empirical validation under simulated conditions underscores its effectiveness and potential value for long-term orbit determination. 展开更多
关键词 machine learning two-body problem Kepler equation neural network
原文传递
Graph Guide Diffusion Solvers with Noises for Travelling Salesman Problem
6
作者 Yan Kong Xinpeng Guo Chih-Hsien Hsia 《Computers, Materials & Continua》 2026年第3期689-707,共19页
With the development of technology,diffusion model-based solvers have shown significant promise in solving Combinatorial Optimization(CO)problems,particularly in tackling Non-deterministic Polynomial-time hard(NP-hard... With the development of technology,diffusion model-based solvers have shown significant promise in solving Combinatorial Optimization(CO)problems,particularly in tackling Non-deterministic Polynomial-time hard(NP-hard)problems such as the Traveling Salesman Problem(TSP).However,existing diffusion model-based solvers typically employ a fixed,uniform noise schedule(e.g.,linear or cosine annealing)across all training instances,failing to fully account for the unique characteristics of each problem instance.To address this challenge,we present GraphGuided Diffusion Solvers(GGDS),an enhanced method for improving graph-based diffusion models.GGDS leverages Graph Neural Networks(GNNs)to capture graph structural information embedded in node coordinates and adjacency matrices,dynamically adjusting the noise levels in the diffusion model.This study investigates the TSP by examining two distinct time-step noise generation strategies:cosine annealing and a Neural Network(NN)-based approach.We evaluate their performance across different problem scales,particularly after integrating graph structural information.Experimental results indicate that GGDS outperforms previous methods with average performance improvements of 18.7%,6.3%,and 88.7%on TSP-500,TSP-100,and TSP-50,respectively.Specifically,GGDS demonstrates superior performance on TSP-500 and TSP-50,while its performance on TSP-100 is either comparable to or slightly better than that of previous methods,depending on the chosen noise schedule and decoding strategy. 展开更多
关键词 Combinatorial optimization problem diffusion model noise schedule traveling salesman problem
在线阅读 下载PDF
Mindfulness and internalizing/externalizing problems among adolescents:Ethnicity moderation and psychological capital mediation
7
作者 Jia Wu Wei Luo +4 位作者 Qianguo Xiao Qinhong Xie Xiaodong Li Taiyong Bi Hui Kou 《Journal of Psychology in Africa》 2026年第1期97-106,共10页
This study examines the mediating role of positive psychological capital and the moderating role of ethnicity in the relationship between mindfulness and internalizing/externalizing problems among adolescents.The stud... This study examines the mediating role of positive psychological capital and the moderating role of ethnicity in the relationship between mindfulness and internalizing/externalizing problems among adolescents.The study sample comprized Chinese adolescents(N=637 ethnic minority;females=40.97%,meam age=12.68,SD=0.49 years;N=636 Han;females=49.06%,mean age=12.71,SD=0.47 years).The participants completed the Child and Adolescent Mindfulness Measure,the Positive Psycap Questionnaire,and the Youth Self-Report.Results from the moderated mediation analysis showed mindfulness was negatively associated with both internalizing and externalizing problems.Ethnicity moderated the relationship between mindfulness and internalizing problems to be stronger for Han adolescents compared to ethnic minority adolescents.Psychological capital mediated the relationship between mindfulness and internalizing problems in both groups,with a negative direction.Findings support the Conservation of Resources theory and highlight mindfulness as a personal resource fostering adolescent well-being in multicultural contexts. 展开更多
关键词 Ethnic minority adolescent MINDFULNESS positive psychological capital internalizing problems externalizing problems
在线阅读 下载PDF
Diagnosing Organizational Bottlenecks in Student Software Projects with Extended Problem Frames
8
作者 Zicheng Huang Hongbin Xiao Zhi Li 《计算机教育》 2026年第3期210-219,共10页
In educational settings,instructors often lead students through hands-on software projects,sometimes engaging two different schools or departments.How can such collaborations be made more efficient,and how can student... In educational settings,instructors often lead students through hands-on software projects,sometimes engaging two different schools or departments.How can such collaborations be made more efficient,and how can students truly experience the importance of teamwork and the impact of organizational structure on project complexity?To answer these questions,we introduce the requirement-driven organization structure(R-DOS)approach,which tightly couples software requirements with the actual development process.By extending problem-frames modeling and focusing on requirements,R-DOS allows educators and students to(1)diagnose structural flaws early,(2)prescribe role-level and communication fixes,and(3)observe-in real time-how poor structure can derail a project while good structure accelerates learning and delivery. 展开更多
关键词 Requirements engineering Organization structure problem Frames
在线阅读 下载PDF
Solutions of three-body problem based on an equivalent system approach
9
作者 Jing Tang Xing 《Acta Mechanica Sinica》 2026年第1期292-309,共18页
Generalised reduced masses with a set of equations governing the three relative motions between two of 3-bodies in their gravitational field are established,of which the dynamic characteristics of 3-body dynamics,fund... Generalised reduced masses with a set of equations governing the three relative motions between two of 3-bodies in their gravitational field are established,of which the dynamic characteristics of 3-body dynamics,fundamental bases of this paper,are revealed.Based on these findings,an equivalent system is developed,which is a 2-body system with its total mass,constant angular momentum,kinetic and potential energies same as the total ones of three relative motions,so that it can be solved using the well-known theory of the 2-body system.From the solution of an equivalent system with the revealed characteristics of three relative motions,the general theoretical solutions of the 3-body system are obtained in the curve-integration forms along the orbits in the imaged radial motion space.The possible periodical orbits with generalised Kepler’s law are presented.Following the description and mathematical demonstrations of the proposed methods,the examples including Euler’s/Lagrange’s problems,and a reported numerical one are solved to validate the proposed methods.The methods derived from the 3-body system are extended to N-body problems. 展开更多
关键词 Three-body problem Equivalent system with solutions Orbit-equation of a conic section Generalised reduced mass Chaotic motions Generalised Kepler’s law N-body problem
原文传递
Sensitivity of glacial isostatic adjustment observations on 3D Earths with lateral viscosity variations:A perspective from the Forward problem
10
作者 Patrick Wu 《Geodesy and Geodynamics》 2026年第1期1-11,共11页
Sensitivity of observational data is important in the study of Glacial Isostatic Adjustment(GIA).However,depending on whether sensitivity is used for the Inverse Problem or the Forward Problem,the final formulation an... Sensitivity of observational data is important in the study of Glacial Isostatic Adjustment(GIA).However,depending on whether sensitivity is used for the Inverse Problem or the Forward Problem,the final formulation and display of the sensitivity kernel will be different.Unfortunately,in the past,both perspectives give the same name to their quantity computed/displayed,and that has caused some confusion.To distinguish between the two,their perspective should be added to the names.This paper focuses only on the perspective of the Forward Problem where the input parameters are known.The Perturbation method has been successfully used in the computation of the sensitivity kernels of observations on 1D and 3D viscosity variations from the Forward perspective.One aim of this paper is to review and clarify the physics of the Perturbation method and bring out some important aspects of this method that have been misunderstood or neglected.Another aim is to present sensitivity kernels from the Perturbation method using 3D(both radially and laterally heterogeneous)Earth models with realistic ice history.These new results are now suitable for future comparison with those from new methods using the Forward perspective.Finally,the sensitivity computations for realistic ice histories on a 3D Earth is reviewed and used to search for optimal locations of new GIA observations. 展开更多
关键词 Mantle rheology Loading of the Earth Forward problem
原文传递
Micromagnetic simulation of μMAG standard problem No.3:Evaluating the standard dipole-dipole interaction
11
作者 A.K.F.Silva D.C.Carvalho +1 位作者 H.S.Assis P.Z.Coura 《Chinese Physics B》 2026年第1期180-186,共7页
Cubic-shaped magnetic particles subjected to a dimensionless uniaxial anisotropy(Q=0.1)aligned with one of the crystallographic axes provide an ideal system for investigating magnetic equilibrium states.In this system... Cubic-shaped magnetic particles subjected to a dimensionless uniaxial anisotropy(Q=0.1)aligned with one of the crystallographic axes provide an ideal system for investigating magnetic equilibrium states.In this system,three fundamental magnetization configurations are identified:(i)the flower state,(ii)the twisted flower state,and(iii)the vortex state.This problem corresponds to standard problem No.3 proposed by the NIST Micromagnetics Modeling Group,widely adopted as a benchmark for validating computational micromagnetics methods.In this work,we approach the problem using a computational method based on direct dipolar interactions,in contrast to conventional techniques that typically compute the demagnetizing field via finite difference-based fast Fourier transform(FFT)methods,tensor grid approaches,or finite element formulations.Our results are compared with established literature data,focusing on the dimensionless parameterλ=L/l_(ex),where L is the cube edge length and l_(ex)is the exchange length of the material.To analyze equilibrium state transitions,we systematically varied the size L as a function of the simulation cell number N and intercellular spacing a,determining the criticalλvalue associated with configuration changes.Our simulations reveal that the transition between the twisted flower and vortex states occurs atλ≈8.45,consistent with values reported in the literature,validating our code(Grupo de Física da Matéeria Condensada-UFJF),and shows that this standard problem can be resolved using only interaction dipolar of a direct way without the need for sophisticated additional calculations. 展开更多
关键词 micromagnetic simulation standard problem No.3 dipolar interaction
原文传递
Collaborative scheduling problem pertaining to launch and recovery operations for carrier aircraft
12
作者 GUO Fang HAN Wei +3 位作者 LIU Yujie SU Xichao LIU Jie LI Changjiu 《Journal of Systems Engineering and Electronics》 2026年第1期287-306,共20页
The proliferation of carrier aircraft and the integration of unmanned aerial vehicles(UAVs)on aircraft carriers present new challenges to the automation of launch and recovery operations.This paper investigates a coll... The proliferation of carrier aircraft and the integration of unmanned aerial vehicles(UAVs)on aircraft carriers present new challenges to the automation of launch and recovery operations.This paper investigates a collaborative scheduling problem inherent to the operational processes of carrier aircraft,where launch and recovery tasks are conducted concurrently on the flight deck.The objective is to minimize the cumulative weighted waiting time in the air for recovering aircraft and the cumulative weighted delay time for launching aircraft.To tackle this challenge,a multiple population self-adaptive differential evolution(MPSADE)algorithm is proposed.This method features a self-adaptive parameter updating mechanism that is contingent upon population diversity,an asynchronous updating scheme,an individual migration operator,and a global crossover mechanism.Additionally,comprehensive experiments are conducted to validate the effectiveness of the proposed model and algorithm.Ultimately,a comparative analysis with existing operation modes confirms the enhanced efficiency of the collaborative operation mode. 展开更多
关键词 carrier aircraft collaborative scheduling problem LAUNCH RECOVERY multiple population differential evolution
在线阅读 下载PDF
Precedence Criteria and Gradient-Based Scheduling Algorithm for the Airplane Refueling Problem
13
作者 LIN Hao HE Cheng 《Chinese Quarterly Journal of Mathematics》 2026年第1期38-49,共12页
The airplane refueling problem can be stated as follows.We are given n airplanes which can refuel one another during the flight.Each airplane has a reservoir volume wj(liters)and a consumption rate pj(liters per kilom... The airplane refueling problem can be stated as follows.We are given n airplanes which can refuel one another during the flight.Each airplane has a reservoir volume wj(liters)and a consumption rate pj(liters per kilometer).As soon as one airplane runs out of fuel,it is dropping out of the flight.The problem asks for finding a refueling scheme such that the last plane in the air reach a maximal distance.An equivalent version is the n-vehicle exploration problem.The computational complexity of this non-linear combinatorial optimization problem is open so far.This paper employs the neighborhood exchange method of single-machine scheduling to study the precedence relations of jobs,so as to improve the necessary and sufficiency conditions of optimal solutions,and establish an efficient heuristic algorithm which is a generalization of several existing special algorithms. 展开更多
关键词 Combinatorial optimization Scheduling method The airplane refueling problem Optimality criteria Heuristic algorithm
在线阅读 下载PDF
NONLINEAR RIEMANN AND HILBERT BOUNDARY VALUE PROBLEMS WITH SQUARE ROOTS IN VARIABLE EXPONENT SPACES
14
作者 Yajun Hu Fuli He 《Acta Mathematica Scientia》 2026年第1期1-18,共18页
In this paper,we study the nonlinear Riemann boundary value problem with square roots that is represented by a Cauchy-type integral with kernel density in variable exponent Lebesgue spaces.We discuss the odd-order zer... In this paper,we study the nonlinear Riemann boundary value problem with square roots that is represented by a Cauchy-type integral with kernel density in variable exponent Lebesgue spaces.We discuss the odd-order zero-points distribution of the solutions and separate the single valued analytic branch of the solutions with square roots,then convert the problem to a Riemann boundary value problem in variable exponent Lebesgue spaces and discuss the singularity of solutions at individual zeros belonging to curve.We consider two types of cases those where the coefficient is Hölder and those where it is piecewise Hölder.Then we solve the Hilbert boundary value problem with square roots in variable exponent Lebesgue spaces.By discussing the distribution of the odd-order zero-points for solutions and the method of symmetric extension,we convert the Hilbert problem to a Riemann boundary value problem.The equivalence of the transformation is discussed.Finally,we get the solvable conditions and the direct expressions of the solutions in variable exponent Lebesgue spaces. 展开更多
关键词 boundary value problem Cauchy-type integral variable exponent spaces non-linearity piecewise Lyapunov curve
在线阅读 下载PDF
Centralized Circumcentered-Reflection Method for Solving the Convex Feasibility Problem in Sparse Signal Recovery
15
作者 Chunmei LI Bangjun CHEN Xuefeng DUAN 《Journal of Mathematical Research with Applications》 2026年第1期119-133,共15页
Convex feasibility problems are widely used in image reconstruction, sparse signal recovery, and other areas. This paper is devoted to considering a class of convex feasibility problem arising from sparse signal recov... Convex feasibility problems are widely used in image reconstruction, sparse signal recovery, and other areas. This paper is devoted to considering a class of convex feasibility problem arising from sparse signal recovery. We first derive the projection formulas for a vector onto the feasible sets. The centralized circumcentered-reflection method is designed to solve the convex feasibility problem. Some numerical experiments demonstrate the feasibility and effectiveness of the proposed algorithm, showing superior performance compared to conventional alternating projection methods. 展开更多
关键词 convex feasibility problem centralized circumcentered-re ection method sparse signal recovery compressed sensing
原文传递
Quality-guaranteed Dubins Path Planning for USV Based on Mixed-integer Piecewise linear Programming for Addressing the Extended Minimum-time Intercept Problem
16
作者 Xing Zhou Kelin Zhu +3 位作者 Shuang Liu Zhaoqing Li Wenxin Zhang Kang Du 《哈尔滨工程大学学报(英文版)》 2026年第1期216-227,共12页
During the use of robotics in applications such as antiterrorism or combat,a motion-constrained pursuer vehicle,such as a Dubins unmanned surface vehicle(USV),must get close enough(within a prescribed zero or positive... During the use of robotics in applications such as antiterrorism or combat,a motion-constrained pursuer vehicle,such as a Dubins unmanned surface vehicle(USV),must get close enough(within a prescribed zero or positive distance)to a moving target as quickly as possible,resulting in the extended minimum-time intercept problem(EMTIP).Existing research has primarily focused on the zero-distance intercept problem,MTIP,establishing the necessary or sufficient conditions for MTIP optimality,and utilizing analytic algorithms,such as root-finding algorithms,to calculate the optimal solutions.However,these approaches depend heavily on the properties of the analytic algorithm,making them inapplicable when problem settings change,such as in the case of a positive effective range or complicated target motions outside uniform rectilinear motion.In this study,an approach employing a high-accuracy and quality-guaranteed mixed-integer piecewise-linear program(QG-PWL)is proposed for the EMTIP.This program can accommodate different effective interception ranges and complicated target motions(variable velocity or complicated trajectories).The high accuracy and quality guarantees of QG-PWL originate from elegant strategies such as piecewise linearization and other developed operation strategies.The approximate error in the intercept path length is proved to be bounded to h^(2)/(4√2),where h is the piecewise length. 展开更多
关键词 Minimum-time intercept problem Dubins vehicle Mixed-integer piecewise-linear program LINEARIZATION Approximate error trigonometric function USV
在线阅读 下载PDF
Cooperative Metaheuristics with Dynamic Dimension Reduction for High-Dimensional Optimization Problems
17
作者 Junxiang Li Zhipeng Dong +2 位作者 Ben Han Jianqiao Chen Xinxin Zhang 《Computers, Materials & Continua》 2026年第1期1484-1502,共19页
Owing to their global search capabilities and gradient-free operation,metaheuristic algorithms are widely applied to a wide range of optimization problems.However,their computational demands become prohibitive when ta... Owing to their global search capabilities and gradient-free operation,metaheuristic algorithms are widely applied to a wide range of optimization problems.However,their computational demands become prohibitive when tackling high-dimensional optimization challenges.To effectively address these challenges,this study introduces cooperative metaheuristics integrating dynamic dimension reduction(DR).Building upon particle swarm optimization(PSO)and differential evolution(DE),the proposed cooperative methods C-PSO and C-DE are developed.In the proposed methods,the modified principal components analysis(PCA)is utilized to reduce the dimension of design variables,thereby decreasing computational costs.The dynamic DR strategy implements periodic execution of modified PCA after a fixed number of iterations,resulting in the important dimensions being dynamically identified.Compared with the static one,the dynamic DR strategy can achieve precise identification of important dimensions,thereby enabling accelerated convergence toward optimal solutions.Furthermore,the influence of cumulative contribution rate thresholds on optimization problems with different dimensions is investigated.Metaheuristic algorithms(PSO,DE)and cooperative metaheuristics(C-PSO,C-DE)are examined by 15 benchmark functions and two engineering design problems(speed reducer and composite pressure vessel).Comparative results demonstrate that the cooperative methods achieve significantly superior performance compared to standard methods in both solution accuracy and computational efficiency.Compared to standard metaheuristic algorithms,cooperative metaheuristics achieve a reduction in computational cost of at least 40%.The cooperative metaheuristics can be effectively used to tackle both high-dimensional unconstrained and constrained optimization problems. 展开更多
关键词 Dimension reduction modified principal components analysis high-dimensional optimization problems cooperative metaheuristics metaheuristic algorithms
在线阅读 下载PDF
Non-Newtonian rivulet flows on an inclined planar surface applying the 2nd Stokes problem
18
作者 S.V.ERSHKOV E.S.BARANOVSKII A.V.YUDIN 《Applied Mathematics and Mechanics(English Edition)》 2026年第1期153-164,共12页
The newly formulated non-Newtonian rivulet flows streaming down an inclined planar surface,with additional periodic perturbations arising from the application of the 2nd Stokes problem to the investigation of rivulet ... The newly formulated non-Newtonian rivulet flows streaming down an inclined planar surface,with additional periodic perturbations arising from the application of the 2nd Stokes problem to the investigation of rivulet dynamics,are demonstrated in the current research.Hereby,the 2nd Stokes problem assumes that the surface,with a thin shared layer of the fluid on it,oscillates in a harmonic manner along the x-axis of the rivulet flow,which coincides with the main flow direction streaming down the underlying surface.We obtain the exact extension of the rivulet flow family,clarifying the structure of the pressure field,which fully absorbs the arising perturbation.The profile of the velocity field is assumed to be Gaussian-type with a non-zero level of plasticity.Hence,the absolutely non-Newtonian case of the viscoplastic flow solution,which satisfies the motion and continuity equations,is considered(with particular cases of exact solutions for pressure).The perturbed governing equations of motion for rivulet flows then result in the Riccati-type ordinary differential equation(ODE),describing the dynamics of the coordinate x(t).The approximated schematic dynamics are presented in graphical plots. 展开更多
关键词 rivulet flow non-Newtonian fluid creeping viscoplastic flow 1st/2nd Stokes problem
在线阅读 下载PDF
Neural boundary shape functions in physics-informed neural networks for discontinuous and high-frequency problems
19
作者 P.T.NGUYEN K.A.LUONG J.H.LEE 《Applied Mathematics and Mechanics(English Edition)》 2026年第2期423-442,共20页
Physics-informed neural networks(PINNs)have been shown as powerful tools for solving partial differential equations(PDEs)by embedding physical laws into the network training.Despite their remarkable results,complicate... Physics-informed neural networks(PINNs)have been shown as powerful tools for solving partial differential equations(PDEs)by embedding physical laws into the network training.Despite their remarkable results,complicated problems such as irregular boundary conditions(BCs)and discontinuous or high-frequency behaviors remain persistent challenges for PINNs.For these reasons,we propose a novel two-phase framework,where a neural network is first trained to represent shape functions that can capture the irregularity of BCs in the first phase,and then these neural network-based shape functions are used to construct boundary shape functions(BSFs)that exactly satisfy both essential and natural BCs in PINNs in the second phase.This scheme is integrated into both the strong-form and energy PINN approaches,thereby improving the quality of solution prediction in the cases of irregular BCs.In addition,this study examines the benefits and limitations of these approaches in handling discontinuous and high-frequency problems.Overall,our method offers a unified and flexible solution framework that addresses key limitations of existing PINN methods with higher accuracy and stability for general PDE problems in solid mechanics. 展开更多
关键词 physics-informed neural network(PINN) boundary shape function(BSF) strong-form approach energy approach DISCONTINUITY high-frequency problem
在线阅读 下载PDF
An Improved Variant of Multi-Population Cooperative Constrained Multi-Objective Optimization(MCCMO)for Multi-Objective Optimization Problem
20
作者 Muhammad Waqar Khan Adnan Ahmed Siddiqui Syed Sajjad Hussain Rizvi 《Computers, Materials & Continua》 2026年第2期1874-1888,共15页
The multi-objective optimization problems,especially in constrained environments such as power distribution planning,demand robust strategies for discovering effective solutions.This work presents the improved variant... The multi-objective optimization problems,especially in constrained environments such as power distribution planning,demand robust strategies for discovering effective solutions.This work presents the improved variant of the Multi-population Cooperative Constrained Multi-Objective Optimization(MCCMO)Algorithm,termed Adaptive Diversity Preservation(ADP).This enhancement is primarily focused on the improvement of constraint handling strategies,local search integration,hybrid selection approaches,and adaptive parameter control.Theimproved variant was experimented on with the RWMOP50 power distribution systemplanning benchmark.As per the findings,the improved variant outperformed the original MCCMO across the eleven performance metrics,particularly in terms of convergence speed,constraint handling efficiency,and solution diversity.The results also establish that MCCMOADP consistently delivers substantial performance gains over the baseline MCCMO,demonstrating its effectiveness across performancemetrics.The new variant also excels atmaintaining the balanced trade-off between exploration and exploitation throughout the search process,making it especially suitable for complex optimization problems in multiconstrained power systems.These enhancements make MCCMO-ADP a valuable and promising candidate for handling problems such as renewable energy scheduling,logistics planning,and power system optimization.Future work will benchmark the MCCMO-ADP against widely recognized algorithms such as NSGA-Ⅱ,NSGA-Ⅲ,and MOEA/D and will also extend its validation to large-scale real-world optimization domains to further consolidate its generalizability. 展开更多
关键词 MCCMO algorithms adaptive diversity preservation RWMOP50 power distribution system multi-modal multi objective optimization evolutionary algorithm multi objective problem
在线阅读 下载PDF
上一页 1 2 250 下一页 到第
使用帮助 返回顶部