Based on the fact that a static problem has an equivalent wave speed of infinity and a dynamic problem has a wave speed of finite value, an effective loading algorithm associated with the explicit dynamic relaxation m...Based on the fact that a static problem has an equivalent wave speed of infinity and a dynamic problem has a wave speed of finite value, an effective loading algorithm associated with the explicit dynamic relaxation method was presented to produce meaningful numerical solutions for static problems. The central part of the explicit dynamic relaxation method is to turn a time-independent static problem into an artificial time-dependent dynamic problem. The related numerical testing results demonstrate that: (1) the proposed effective loading algorithm is capable of enabling an applied load in a static problem to be propagated throughout the whole system within a given loading increment, so that the time-independent solution of the static problem can be obtained; (2) the proposed effective loading algorithm can be straightforwardly applied to the particle simulation method for solving a wide range of static problems.展开更多
A class of nonidentical parallel machine scheduling problems are considered in which the goal is to minimize the total weighted completion time. Models and relaxations are collected. Most of these problems are NP-hard...A class of nonidentical parallel machine scheduling problems are considered in which the goal is to minimize the total weighted completion time. Models and relaxations are collected. Most of these problems are NP-hard, in the strong sense, or open problems, therefore approximation algorithms are studied. The review reveals that there exist some potential areas worthy of further research.展开更多
In this paper,we establish a new algorithm to the non-overlapping Schwarz domain decomposition methods with changing transmission conditions for solving one dimensional advection reaction diffusion problem.More precis...In this paper,we establish a new algorithm to the non-overlapping Schwarz domain decomposition methods with changing transmission conditions for solving one dimensional advection reaction diffusion problem.More precisely,we first describe the new algorithm and prove the convergence results under several natural assumptions on the sequences of parameters which determine the transmission conditions.Then we give a simple method to estimate the new value of parameters in each iteration.The interesting advantage of our method is that one may update the better parameters in each iteration to save the computational cost for optimizing the parameters after many steps.Finally some numerical experiments are performed to show the behavior of the convergence rate for the new method.展开更多
The multiple knapsack problem denoted by MKP (B,S,m,n) can be defined as fol- lows.A set B of n items and a set Sof m knapsacks are given such thateach item j has a profit pjand weightwj,and each knapsack i has a ca...The multiple knapsack problem denoted by MKP (B,S,m,n) can be defined as fol- lows.A set B of n items and a set Sof m knapsacks are given such thateach item j has a profit pjand weightwj,and each knapsack i has a capacity Ci.The goal is to find a subset of items of maximum profit such that they have a feasible packing in the knapsacks.MKP(B,S,m,n) is strongly NP- Complete and no polynomial- time approximation algorithm can have an approxima- tion ratio better than0 .5 .In the last ten years,semi- definite programming has been empolyed to solve some combinatorial problems successfully.This paper firstly presents a semi- definite re- laxation algorithm (MKPS) for MKP (B,S,m,n) .It is proved that MKPS have a approxima- tion ratio better than 0 .5 for a subclass of MKP (B,S,m,n) with n≤ 1 0 0 ,m≤ 5 and maxnj=1{ wj} minmi=1{ Ci} ≤ 2 3 .展开更多
In this paper, a new method, so called A-method, is given for the convergence analysis of the MQ-algorithm. And the finer relaxation parameter θA is obtained. The numerical results show that our new method has the ou...In this paper, a new method, so called A-method, is given for the convergence analysis of the MQ-algorithm. And the finer relaxation parameter θA is obtained. The numerical results show that our new method has the outstanding effect of accelerating convergence. Moreover, the relaxation parameter θA is the optimum in a point of view.展开更多
In this paper,a new algorithm relaxation-strategy-based modification branchand-bound algorithm is developed for a type of solving the minimum cost transportationproduction problem with concave production costs.The maj...In this paper,a new algorithm relaxation-strategy-based modification branchand-bound algorithm is developed for a type of solving the minimum cost transportationproduction problem with concave production costs.The major improvement of the proposed new method is that modification algorithm reinforces the bounding operation using a Lagrangian relaxation,which is a concave minimization but obtains a tighter bound than the usual linear programming relaxation.Some computational results are included.Computation results indicate that the algorithm can solve fairly large scale problems.展开更多
The multisplitting algorithm for solving large systems of ordinary differential equations on parallel computers was introduced by Jeltsch and Pohl in [1]. On fixed time intervals conver gence results could be derived ...The multisplitting algorithm for solving large systems of ordinary differential equations on parallel computers was introduced by Jeltsch and Pohl in [1]. On fixed time intervals conver gence results could be derived if the subsystems are solving exactly.Firstly,in theis paper,we deal with an extension of the waveform relaxation algorithm by us ing multisplittin AOR method based on an overlapping block decomposition. We restricted our selves to equidistant timepoints and dealed with the case that an implicit integration method was used to solve the subsystems numerically in parallel. Then we have proved convergence of multi splitting AOR waveform relaxation algorithm on a fixed window containing a finite number of timepoints.展开更多
We implement a parallel algorithm with the advantage of MPI （Message Passing Interface） to speed up the rapid relaxation inversion for 3D magnetotelluric data. We test the parallel rapid relaxation algorithm with sy...We implement a parallel algorithm with the advantage of MPI （Message Passing Interface） to speed up the rapid relaxation inversion for 3D magnetotelluric data. We test the parallel rapid relaxation algorithm with synthetic and real data. The execution efficiency of the algorithm for several different situations is also compared. The results indicate that the parallel rapid relaxation algorithm for 3D magnetotelluric inversion is effective. This parallel algorithm implemented on a common PC promotes the practical application of 3D magnetotelluric inversion and can be suitable for the other geophysical 3D modeling and inversion.展开更多
Constrained long-term production scheduling problem(CLTPSP) of open pit mines has been extensively studied in the past few decades due to its wide application in mining projects and the computational challenges it pos...Constrained long-term production scheduling problem(CLTPSP) of open pit mines has been extensively studied in the past few decades due to its wide application in mining projects and the computational challenges it poses become an NP-hard problem.This problem has major practical significance because the effectiveness of the schedules obtained has strong economical impact for any mining project.Despite of the rapid theoretical and technical advances in this field,heuristics is still the only viable approach for large scale industrial applications.This work presents an approach combining genetic algorithms(GAs) and Lagrangian relaxation(LR) to optimally determine the CLTPSP of open pit mines.GAs are stochastic,parallel search algorithms based on the natural selection and the process of evolution.LR method is known for handling large-scale separable problems; however,the convergence to the optimal solution can be slow.The proposed Lagrangian relaxation and genetic algorithms(LR-GAs) combines genetic algorithms into Lagrangian relaxation method to update the Lagrangian multipliers.This approach leads to improve the performance of Lagrangian relaxation method in solving CLTPSP.Numerical results demonstrate that the LR method using GAs to improve its performance speeding up the convergence.Subsequently,highly near-optimal solution to the CLTPSP can be achieved by the LR-GAs.展开更多
In this paper, an absorbing Fictitious Boundary Condition (FBC) is presented to generate an iterative Domain Decomposition Method (DDM) for analyzing waveguide problems.The relaxed algorithm is introduced to improve t...In this paper, an absorbing Fictitious Boundary Condition (FBC) is presented to generate an iterative Domain Decomposition Method (DDM) for analyzing waveguide problems.The relaxed algorithm is introduced to improve the iterative convergence. And the matrix equations are solved using the multifrontal algorithm. The resulting CPU time is greatly reduced.Finally, a number of numerical examples are given to illustrate its accuracy and efficiency.展开更多
A collaborative planning framework based on the Lagrangian Relaxation was developed to coordinate and optimize the production planning of independent partners in multiple tier supply chains. Linking constraints and de...A collaborative planning framework based on the Lagrangian Relaxation was developed to coordinate and optimize the production planning of independent partners in multiple tier supply chains. Linking constraints and dependent demand constraints were added to the monolithic Multi-Level, multi-item Capacitated Lot Sizing Problem (MLCLSP). MLCLSP was Lagrangian relaxed and decomposed into facility-separable subproblems. Surrogate gradient algorithm was used to update Lagrangian multipliers, which coordinate decentralized decisions of the facilities. Production planning of independent partners could be appropriately coordinated and optimized by this framework without intruding their decisionities and private information. Experimental results show that the proposed coordination mechanism and procedure come close to optimal results as obtained by central coordination.展开更多
This study applies the diatonic chord in music theory,utilization rate,and the close relationship between the main chord system,the dominant chord system,and the subordinate chord system.From the perspective of music ...This study applies the diatonic chord in music theory,utilization rate,and the close relationship between the main chord system,the dominant chord system,and the subordinate chord system.From the perspective of music theory,the computer can automatically and quickly analyze the music,and establish a set of algorithms for configuring the chord accompaniment for the main melody,called the symmetrical circle offifths algorithm,SCFA(Symmetrical Circle of Fifths Algorithm).SCFA can immediately confirm the key,perform harmony analysis,configure chord accompaniment for the main melody,and effectively and correctly complete any given melody or interval.It can also quickly analyze and correctly configure the chord accompaniment for any MIDI(Musical Instrument Digital Interface)music,enriching the musicality of the music.It can also allow scorers or computer music creators to quickly deconstruct the harmony configuration of the melody.Through the measurement of bio-feedback sensor HRV(Heart Rate Variability),it can achieve a relaxing music healing effect.展开更多
In this paper, a new class of over-relaxed proximal point algorithms for solving nonlinear operator equations with (A,η,m)-monotonicity framework in Hilbert spaces is introduced and studied. Further, by using the gen...In this paper, a new class of over-relaxed proximal point algorithms for solving nonlinear operator equations with (A,η,m)-monotonicity framework in Hilbert spaces is introduced and studied. Further, by using the generalized resolvent operator technique associated with the (A,η,m)-monotone operators, the approximation solvability of the operator equation problems and the convergence of iterative sequences generated by the algorithm are discussed. Our results improve and generalize the corresponding results in the literature.展开更多
In open quantum systems,the Liouvillian gap characterizes the relaxation time toward the steady state.However,accurately computing this quantity is notoriously difficult due to the exponential growth of the Hilbert sp...In open quantum systems,the Liouvillian gap characterizes the relaxation time toward the steady state.However,accurately computing this quantity is notoriously difficult due to the exponential growth of the Hilbert space and the non-Hermitian nature of the Liouvillian superoperator.In this work,we propose a variational quantum algorithm for efficiently estimating the Liouvillian gap.By utilizing the Choi-Jamio lkowski isomorphism,we reformulate the problem as finding the first excitation energy of an effective non-Hermitian Hamiltonian.Our method employs variance minimization with an orthogonality constraint to locate the first excited state and adopts a two-stage optimization scheme to enhance convergence.Moreover,to address scenarios with degenerate steady states,we introduce an iterative energy-offset scanning technique.Numerical simulations on the dissipative XXZ model confirm the accuracy and robustness of our algorithm across a range of system sizes and dissipation strengths.These results demonstrate the promise of variational quantum algorithms for simulating open quantum many-body systems on near-term quantum hardware.展开更多
基金Projects(10872219 10672190) supported by the National Natural Science Foundation of China
文摘Based on the fact that a static problem has an equivalent wave speed of infinity and a dynamic problem has a wave speed of finite value, an effective loading algorithm associated with the explicit dynamic relaxation method was presented to produce meaningful numerical solutions for static problems. The central part of the explicit dynamic relaxation method is to turn a time-independent static problem into an artificial time-dependent dynamic problem. The related numerical testing results demonstrate that: (1) the proposed effective loading algorithm is capable of enabling an applied load in a static problem to be propagated throughout the whole system within a given loading increment, so that the time-independent solution of the static problem can be obtained; (2) the proposed effective loading algorithm can be straightforwardly applied to the particle simulation method for solving a wide range of static problems.
基金the National Natural Science Foundation of China (70631003)the Hefei University of Technology Foundation (071102F).
文摘A class of nonidentical parallel machine scheduling problems are considered in which the goal is to minimize the total weighted completion time. Models and relaxations are collected. Most of these problems are NP-hard, in the strong sense, or open problems, therefore approximation algorithms are studied. The review reveals that there exist some potential areas worthy of further research.
文摘In this paper,we establish a new algorithm to the non-overlapping Schwarz domain decomposition methods with changing transmission conditions for solving one dimensional advection reaction diffusion problem.More precisely,we first describe the new algorithm and prove the convergence results under several natural assumptions on the sequences of parameters which determine the transmission conditions.Then we give a simple method to estimate the new value of parameters in each iteration.The interesting advantage of our method is that one may update the better parameters in each iteration to save the computational cost for optimizing the parameters after many steps.Finally some numerical experiments are performed to show the behavior of the convergence rate for the new method.
基金Supported by the National Natural Science Foundation of China(1 9971 0 78)
文摘The multiple knapsack problem denoted by MKP (B,S,m,n) can be defined as fol- lows.A set B of n items and a set Sof m knapsacks are given such thateach item j has a profit pjand weightwj,and each knapsack i has a capacity Ci.The goal is to find a subset of items of maximum profit such that they have a feasible packing in the knapsacks.MKP(B,S,m,n) is strongly NP- Complete and no polynomial- time approximation algorithm can have an approxima- tion ratio better than0 .5 .In the last ten years,semi- definite programming has been empolyed to solve some combinatorial problems successfully.This paper firstly presents a semi- definite re- laxation algorithm (MKPS) for MKP (B,S,m,n) .It is proved that MKPS have a approxima- tion ratio better than 0 .5 for a subclass of MKP (B,S,m,n) with n≤ 1 0 0 ,m≤ 5 and maxnj=1{ wj} minmi=1{ Ci} ≤ 2 3 .
文摘In this paper, a new method, so called A-method, is given for the convergence analysis of the MQ-algorithm. And the finer relaxation parameter θA is obtained. The numerical results show that our new method has the outstanding effect of accelerating convergence. Moreover, the relaxation parameter θA is the optimum in a point of view.
基金Foundation item： Supported by the National Natural Science Foundation of China（10726016） Supported by the Hubei Province Natural Science Foundation Project（T200809 D200613002）
文摘In this paper,a new algorithm relaxation-strategy-based modification branchand-bound algorithm is developed for a type of solving the minimum cost transportationproduction problem with concave production costs.The major improvement of the proposed new method is that modification algorithm reinforces the bounding operation using a Lagrangian relaxation,which is a concave minimization but obtains a tighter bound than the usual linear programming relaxation.Some computational results are included.Computation results indicate that the algorithm can solve fairly large scale problems.
文摘The multisplitting algorithm for solving large systems of ordinary differential equations on parallel computers was introduced by Jeltsch and Pohl in [1]. On fixed time intervals conver gence results could be derived if the subsystems are solving exactly.Firstly,in theis paper,we deal with an extension of the waveform relaxation algorithm by us ing multisplittin AOR method based on an overlapping block decomposition. We restricted our selves to equidistant timepoints and dealed with the case that an implicit integration method was used to solve the subsystems numerically in parallel. Then we have proved convergence of multi splitting AOR waveform relaxation algorithm on a fixed window containing a finite number of timepoints.
基金sponsored by National Natural Science Foundation of China(Grant No.40774029,40374024)the National Hi-tech Rsearch and Development Program of China(863 Program)(No.2007AA09Z310,)the Program for New Century Excellent Talents in University(NCET)
文摘We implement a parallel algorithm with the advantage of MPI （Message Passing Interface） to speed up the rapid relaxation inversion for 3D magnetotelluric data. We test the parallel rapid relaxation algorithm with synthetic and real data. The execution efficiency of the algorithm for several different situations is also compared. The results indicate that the parallel rapid relaxation algorithm for 3D magnetotelluric inversion is effective. This parallel algorithm implemented on a common PC promotes the practical application of 3D magnetotelluric inversion and can be suitable for the other geophysical 3D modeling and inversion.
文摘Constrained long-term production scheduling problem(CLTPSP) of open pit mines has been extensively studied in the past few decades due to its wide application in mining projects and the computational challenges it poses become an NP-hard problem.This problem has major practical significance because the effectiveness of the schedules obtained has strong economical impact for any mining project.Despite of the rapid theoretical and technical advances in this field,heuristics is still the only viable approach for large scale industrial applications.This work presents an approach combining genetic algorithms(GAs) and Lagrangian relaxation(LR) to optimally determine the CLTPSP of open pit mines.GAs are stochastic,parallel search algorithms based on the natural selection and the process of evolution.LR method is known for handling large-scale separable problems; however,the convergence to the optimal solution can be slow.The proposed Lagrangian relaxation and genetic algorithms(LR-GAs) combines genetic algorithms into Lagrangian relaxation method to update the Lagrangian multipliers.This approach leads to improve the performance of Lagrangian relaxation method in solving CLTPSP.Numerical results demonstrate that the LR method using GAs to improve its performance speeding up the convergence.Subsequently,highly near-optimal solution to the CLTPSP can be achieved by the LR-GAs.
文摘In this paper, an absorbing Fictitious Boundary Condition (FBC) is presented to generate an iterative Domain Decomposition Method (DDM) for analyzing waveguide problems.The relaxed algorithm is introduced to improve the iterative convergence. And the matrix equations are solved using the multifrontal algorithm. The resulting CPU time is greatly reduced.Finally, a number of numerical examples are given to illustrate its accuracy and efficiency.
文摘A collaborative planning framework based on the Lagrangian Relaxation was developed to coordinate and optimize the production planning of independent partners in multiple tier supply chains. Linking constraints and dependent demand constraints were added to the monolithic Multi-Level, multi-item Capacitated Lot Sizing Problem (MLCLSP). MLCLSP was Lagrangian relaxed and decomposed into facility-separable subproblems. Surrogate gradient algorithm was used to update Lagrangian multipliers, which coordinate decentralized decisions of the facilities. Production planning of independent partners could be appropriately coordinated and optimized by this framework without intruding their decisionities and private information. Experimental results show that the proposed coordination mechanism and procedure come close to optimal results as obtained by central coordination.
基金The Ministry of Science and Technology project of Taiwan:MOST 108-2511-H-424-001-MY3.
文摘This study applies the diatonic chord in music theory,utilization rate,and the close relationship between the main chord system,the dominant chord system,and the subordinate chord system.From the perspective of music theory,the computer can automatically and quickly analyze the music,and establish a set of algorithms for configuring the chord accompaniment for the main melody,called the symmetrical circle offifths algorithm,SCFA(Symmetrical Circle of Fifths Algorithm).SCFA can immediately confirm the key,perform harmony analysis,configure chord accompaniment for the main melody,and effectively and correctly complete any given melody or interval.It can also quickly analyze and correctly configure the chord accompaniment for any MIDI(Musical Instrument Digital Interface)music,enriching the musicality of the music.It can also allow scorers or computer music creators to quickly deconstruct the harmony configuration of the melody.Through the measurement of bio-feedback sensor HRV(Heart Rate Variability),it can achieve a relaxing music healing effect.
文摘In this paper, a new class of over-relaxed proximal point algorithms for solving nonlinear operator equations with (A,η,m)-monotonicity framework in Hilbert spaces is introduced and studied. Further, by using the generalized resolvent operator technique associated with the (A,η,m)-monotone operators, the approximation solvability of the operator equation problems and the convergence of iterative sequences generated by the algorithm are discussed. Our results improve and generalize the corresponding results in the literature.
基金supported by the National Natural Science Foundation of China(Grant Nos.12375013 and 12275090)the Guangdong Basic and Applied Basic Research Fund(Grant No.2023A1515011460)Guangdong Provincial Quantum Science Strategic Initiative(Grant No.GDZX2200001)。
文摘In open quantum systems,the Liouvillian gap characterizes the relaxation time toward the steady state.However,accurately computing this quantity is notoriously difficult due to the exponential growth of the Hilbert space and the non-Hermitian nature of the Liouvillian superoperator.In this work,we propose a variational quantum algorithm for efficiently estimating the Liouvillian gap.By utilizing the Choi-Jamio lkowski isomorphism,we reformulate the problem as finding the first excitation energy of an effective non-Hermitian Hamiltonian.Our method employs variance minimization with an orthogonality constraint to locate the first excited state and adopts a two-stage optimization scheme to enhance convergence.Moreover,to address scenarios with degenerate steady states,we introduce an iterative energy-offset scanning technique.Numerical simulations on the dissipative XXZ model confirm the accuracy and robustness of our algorithm across a range of system sizes and dissipation strengths.These results demonstrate the promise of variational quantum algorithms for simulating open quantum many-body systems on near-term quantum hardware.
