To address the issue that static densest subgraph mining algorithms often exhibit low efficiency when handling large scale dynamic graphs,this paper proposes a heuristic approximation algorithm.The algorithm approxima...To address the issue that static densest subgraph mining algorithms often exhibit low efficiency when handling large scale dynamic graphs,this paper proposes a heuristic approximation algorithm.The algorithm approximates the densest k-subgraphs of the entire graph through four steps:partitioning the large-scale dynamic graph,constructing a partial set of the densest k-subgraphs,heuristically merging the subgraph sets,and finally extracting the densest k-subgraphs.This approach significantly reduces the computational time for large-scale dynamic graphs while simultaneously improving the quality of the resulting subgraphs.This algorithm is applicable to various definitions of“density”and can accommodate diverse requirements on the number of edges.When integrated with existing static densest subgraph detection algorithms,it achieves scalability and computational efficiency.Theoretical analysis demonstrates that the optimal density of the densest k-subgraphs extracted by the proposed algorithm reaches 0.9.To evaluate the performance of the algorithm,experiments were conducted on four billion-scale datasets:Friendster,Orkut,YouTube,and DBLP.The results indicate that the proposed algorithm outperforms static methods in both runtime efficiency and subgraph quality on large-scale dynamic graphs.展开更多
In this paper,we construct a power type functional which is the approximation functional of the Singular Trudinger-Moser functional.Moreover,we obtain the concentration level of the functional and show it converges to...In this paper,we construct a power type functional which is the approximation functional of the Singular Trudinger-Moser functional.Moreover,we obtain the concentration level of the functional and show it converges to the concentration level of singular Trudinger-Moser functional on the unit ball.展开更多
Theoretical analysis has demonstrated that the dispersion relation of chorus waves plays an essential role in the resonant interaction and energy transformation between the waves and magnetospheric electrons.Previous ...Theoretical analysis has demonstrated that the dispersion relation of chorus waves plays an essential role in the resonant interaction and energy transformation between the waves and magnetospheric electrons.Previous quantitative analyses often simplified the chorus dispersion relation by using the cold plasma assumption.However,the applicability of the cold plasma assumption is doubtful,especially during geomagnetic disturbances.We here present a systematic statistical analysis on the validity of the cold plasma dispersion relation of chorus waves based on observations from the Van Allen Probes over the period from 2012 to 2018.The statistical results show that the observed magnetic field intensities deviate substantially from those calculated from the cold plasma dispersion relation and that they become more pronounced with an increase in geomagnetic activity or a decrease in background plasma density.The region with large deviations is mainly concentrated in the nightside and expands in both the radial and azimuthal directions as the geomagnetic activity increases or the background plasma density decreases.In addition,the bounce-averaged electron scattering rates are computed by using the observed and cold plasma dispersion relation of chorus waves.Compared with usage of the cold plasma dispersion relation,usage of the observed dispersion relation considerably lowers the minimum resonant energy of electrons and lowers the scattering rates of electrons above tens of kiloelectronvolts but enhances those below.Furthermore,these differences are more pronounced with the enhancement of geomagnetic activity or the decrease in background plasma density.展开更多
Suppose thatλ_(1),λ_(2),λ_(3),λ_(4),λ_(5)are nonzero real numbers,not all of the same sign,andλ_(1)/λ_(2)is irrational and algebraic.Let V be a well-spaced sequence,δ>0.In this paper,it is proved that,for ...Suppose thatλ_(1),λ_(2),λ_(3),λ_(4),λ_(5)are nonzero real numbers,not all of the same sign,andλ_(1)/λ_(2)is irrational and algebraic.Let V be a well-spaced sequence,δ>0.In this paper,it is proved that,for anyε>0,the number of v∈V with v≤N such that the following inequality|λ_(1)p_(1)~2+λ_(2)p_(2)~2+λ_(3)p_(3)~4+λ_(4)p_(4)~4+λ_5p_5~4-v|<v^(-δ)has no solution in prime variables p_(1),p_(2),p_(3),p_(4),p_(5)does not exceed O(N^(29/32+2δ+ε)).展开更多
This paper studies the Smoluchowski–Kramers approximation for a discrete-time dynamical system modeled as the motion of a particle in a force field.We show that the approximation holds for the drift-implicit Euler–M...This paper studies the Smoluchowski–Kramers approximation for a discrete-time dynamical system modeled as the motion of a particle in a force field.We show that the approximation holds for the drift-implicit Euler–Maruyama discretization and derive its convergence rate.In particular,the solution of the discretized system converges to the solution of the first-order limit equation in the mean-square sense,and this convergence is independent of the order in which the mass parameterμand the step size h tend to zero.展开更多
本文探讨了在大数据背景下,企业面临的数据分散、业务数据存储来源多样化,以及在高并发环境下数据共享和访问的挑战。这些问题导致后端开发成本的增加和系统维护的复杂性。为了解决这些核心问题,本文基于数据即服务(Data as a Service,D...本文探讨了在大数据背景下,企业面临的数据分散、业务数据存储来源多样化,以及在高并发环境下数据共享和访问的挑战。这些问题导致后端开发成本的增加和系统维护的复杂性。为了解决这些核心问题,本文基于数据即服务(Data as a Service,DaaS)的概念,通过整合多源数据管理、数据目录管理和API服务的全周期管理,助力企业实现数据资产化和数据服务化。这不仅减少了后端开发的工作量,还降低了整体的开发和维护成本,使得数据能够更有效地服务于业务需求。展开更多
With the growing demand for compute-intensive applications such as artificial intelligence(AI)and video processing,traditional reconfigurable array processors fail to meet the requirements of high-performance computin...With the growing demand for compute-intensive applications such as artificial intelligence(AI)and video processing,traditional reconfigurable array processors fail to meet the requirements of high-performance computing and related domains,primarily due to their high power consumption and low energy efficiency.To address this limitation,this paper proposes an accuracy-adaptive approxi-mate reconfigurable array architecture featuring preset dual thresholds and support for four computa-tional accuracy levels,enabling flexible adaptation to diverse application needs.The architecture in-tegrates a self-adaptive mechanism that dynamically adjusts computational precision based on real-time error threshold feedback.To evaluate the proposed architecture,the you only look once version 5(YOLOv5)deep neural network algorithm is parallelized and deployed on the approximate recon-figurable array.Experimental results demonstrate that the architecture achieves an 18.93%reduc-tion in power consumption compared with conventional reconfigurable structures operating in full-pre-cision mode.Additionally,the design exhibits superior energy efficiency and reduced computational resource utilization,thereby significantly enhancing the overall performance and applicability of reconfigurable array processors in power-sensitive scenarios.展开更多
In the present paper,we obtain the converse results of approximation of a newly introduced genuine Bernstein-Durrmeyer operators in movable interval.We also get the moments properties of an auxiliary operator which ha...In the present paper,we obtain the converse results of approximation of a newly introduced genuine Bernstein-Durrmeyer operators in movable interval.We also get the moments properties of an auxiliary operator which has its own independent values.The moments of the auxiliary operators play important roles in establishing the main result(Theorem 4).展开更多
The reuse of green sand in casting production is hindered by the accumulation of oolitic deposits,primarily composed of clay binder with surface degradation,which may adversely affect the the moulding sand performance...The reuse of green sand in casting production is hindered by the accumulation of oolitic deposits,primarily composed of clay binder with surface degradation,which may adversely affect the the moulding sand performance.Currently,there is a lack of standardized methods for quantifying the oolitic content.Accurate measurement of oolitic content is of great significance to the reuse of green sand.Attempts to determine oolitic content using potassium hydroxide(KOH)and phosphoric acid(H_(3)PO_(4))methods encounter challenges due to their excessive reactions with SiO_(2) in the sand.In this study,an improved method for measuring the oolitic content of green sand with repeated approximations was proposed.This method judges the chemical activity of the sample surface through the change of its mass to accurately obtain the mass of the reaction oolitic deposits.The test result of the used sand samples from the foundry shows that the oolitic deposits are completely removed after reacting with KOH solution three times at 300℃ for 20 min.SEM and EDS also show that after three times of reactions,the surface of green sand becomes smooth and the content of Al-containing oolitic deposits is very low.This indicates that the method can accurately control the extent of the reaction.Implementation of this method at Huangshi Dongbei Casting Co.,Ltd.has yielded consistent and reliable test results,effectively mirroring variations in green sand oolitic content on the production line.This new method is expected to be widely adopted to improve the efficiency and quality of reused green sand in casting operations.展开更多
Virtual coupling is a novel technology that enables trains to run closely together without physical connections through communication and automation systems.The paper addresses an adaptive polynomial approximation alg...Virtual coupling is a novel technology that enables trains to run closely together without physical connections through communication and automation systems.The paper addresses an adaptive polynomial approximation algorithm for the cooperative control of high-speed trains(HSTs)under virtual coupling.It aims to solve the cooperative tracking control problem of HST formation operations under various scenarios,including known and unknown parameters.To enable the HST formation system to achieve cooperative operation while ensuring an appropriate spacing distance,the tracking errors of displacement and speed throughout the entire operation converge to zero.The proposed control strategy focuses on adopting polynomial approximation to handle unknown parameters,which are estimated via adaptive laws.Additionally,the unknown parameters of the HSTs are estimated online through adaptive laws.Experimental results verify the effectiveness of this method.展开更多
Determining the minimal distance between the target state and the convex combination of given states is a fundamental problem in quantum resource theory,offering critical guidance for experimental implementations.In t...Determining the minimal distance between the target state and the convex combination of given states is a fundamental problem in quantum resource theory,offering critical guidance for experimental implementations.In this paper,we embark on an in-depth exploration of the use of a quantum state prepared by the convex combination of given qubit states to optimally approximate the l_(1)-norm of coherence of the target quantum state,striving to make the prepared state and the target state as similar as possible.Here,we present the analytical solution for the optimal distance for any N given quantum states.We find that the optimal approximation problem for any N>4 quantum states can be transformed into an optimal approximation problem for no more than four quantum states,which not only significantly streamlines the problem but also proves advantageous for laboratories in terms of material conservation.Ultimately,a one-to-one comparison between the analytical and numerical solutions verifies the effectiveness of our approach.展开更多
Dear Editor,This letter focuses on the remaining useful life(RUL)prediction task under limited labeled samples.Existing machine-learning-based RUL prediction methods for this task usually pay attention to mining degra...Dear Editor,This letter focuses on the remaining useful life(RUL)prediction task under limited labeled samples.Existing machine-learning-based RUL prediction methods for this task usually pay attention to mining degradation information to improve the prediction accuracy of degradation value or health indicator for the next epoch.However,they ignore the cumulative prediction error caused by iterations before reaching the failure point.展开更多
We present a robust quantum optimal control framework for implementing fast entangling gates on ion-trap quantum processors.The framework leverages tailored laser pulses to drive the multiple vibrational sidebands of ...We present a robust quantum optimal control framework for implementing fast entangling gates on ion-trap quantum processors.The framework leverages tailored laser pulses to drive the multiple vibrational sidebands of the ions to create phonon-mediated entangling gates and,unlike the state of the art,requires neither weakcoupling Lamb-Dicke approximation nor perturbation treatment.With the application of gradient-based optimal control,it enables finding amplitude-and phase-modulated laser control protocols that work without the Lamb-Dicke approximation,promising gate speeds on the order of microseconds comparable to the characteristic trap frequencies.Also,robustness requirements on the temperature of the ions and initial optical phase can be conveniently included to pursue high-quality fast gates against experimental imperfections.Our approach represents a step in speeding up quantum gates to achieve larger quantum circuits for quantum computation and simulation,and thus can find applications in near-future experiments.展开更多
为构建综合能源系统安全域(integrated energy system security region,IESSR),该文提出一种基于多项式混沌展开(polynomial chaos expansion,PCE)的IESSR边界(IESR boundary,IESSRB)近似方法,借助该方法可得IESSRB的多项式逼近表达式...为构建综合能源系统安全域(integrated energy system security region,IESSR),该文提出一种基于多项式混沌展开(polynomial chaos expansion,PCE)的IESSR边界(IESR boundary,IESSRB)近似方法,借助该方法可得IESSRB的多项式逼近表达式。首先,根据IESSRB的边界拓扑特性,构建系统的IESSR边界点搜索优化模型;然后,根据PCE,对IESSR边界点搜索优化模型进行参数化处理,构建IESSRB搜索的参数化优化模型;进一步地,根据IESSRB搜索的参数化优化模型的KKT条件,将IESSRB的参数化优化模型转化为高维参数化非线性方程组;在此基础上,借助广义Galerkin投影构建关于近似IESSRB的多项式逼近系数的Galerkin投影方程组,通过求解该方程组可得IESSRB的多项式逼近系数,从而获得IESSRB的多项式逼近表达式;为进一步降低Galerkin投影方程组求解复杂度,提出多项式分段近似IESSRB方法,在提高IESSRB近似精度的同时,提升了IESSRB近似的计算效率;最后,通过IES E39-G20测试系统和IES E118-G96测试系统对所提方法进行分析、验证。结果表明,所提方法可实现IESSR的准确、有效构建。展开更多
基金The National Natural Science Foundation of China(No.62172443).
文摘To address the issue that static densest subgraph mining algorithms often exhibit low efficiency when handling large scale dynamic graphs,this paper proposes a heuristic approximation algorithm.The algorithm approximates the densest k-subgraphs of the entire graph through four steps:partitioning the large-scale dynamic graph,constructing a partial set of the densest k-subgraphs,heuristically merging the subgraph sets,and finally extracting the densest k-subgraphs.This approach significantly reduces the computational time for large-scale dynamic graphs while simultaneously improving the quality of the resulting subgraphs.This algorithm is applicable to various definitions of“density”and can accommodate diverse requirements on the number of edges.When integrated with existing static densest subgraph detection algorithms,it achieves scalability and computational efficiency.Theoretical analysis demonstrates that the optimal density of the densest k-subgraphs extracted by the proposed algorithm reaches 0.9.To evaluate the performance of the algorithm,experiments were conducted on four billion-scale datasets:Friendster,Orkut,YouTube,and DBLP.The results indicate that the proposed algorithm outperforms static methods in both runtime efficiency and subgraph quality on large-scale dynamic graphs.
文摘In this paper,we construct a power type functional which is the approximation functional of the Singular Trudinger-Moser functional.Moreover,we obtain the concentration level of the functional and show it converges to the concentration level of singular Trudinger-Moser functional on the unit ball.
基金supported by the National Natural Science Foundation of China (NSFC) through Grant Number 42074193
文摘Theoretical analysis has demonstrated that the dispersion relation of chorus waves plays an essential role in the resonant interaction and energy transformation between the waves and magnetospheric electrons.Previous quantitative analyses often simplified the chorus dispersion relation by using the cold plasma assumption.However,the applicability of the cold plasma assumption is doubtful,especially during geomagnetic disturbances.We here present a systematic statistical analysis on the validity of the cold plasma dispersion relation of chorus waves based on observations from the Van Allen Probes over the period from 2012 to 2018.The statistical results show that the observed magnetic field intensities deviate substantially from those calculated from the cold plasma dispersion relation and that they become more pronounced with an increase in geomagnetic activity or a decrease in background plasma density.The region with large deviations is mainly concentrated in the nightside and expands in both the radial and azimuthal directions as the geomagnetic activity increases or the background plasma density decreases.In addition,the bounce-averaged electron scattering rates are computed by using the observed and cold plasma dispersion relation of chorus waves.Compared with usage of the cold plasma dispersion relation,usage of the observed dispersion relation considerably lowers the minimum resonant energy of electrons and lowers the scattering rates of electrons above tens of kiloelectronvolts but enhances those below.Furthermore,these differences are more pronounced with the enhancement of geomagnetic activity or the decrease in background plasma density.
基金Supported by NSFC(Nos.12301006,12471009,12071238,11901566,12001047,11971476)Beijing Natural Science Foundation(No.1242003)。
文摘Suppose thatλ_(1),λ_(2),λ_(3),λ_(4),λ_(5)are nonzero real numbers,not all of the same sign,andλ_(1)/λ_(2)is irrational and algebraic.Let V be a well-spaced sequence,δ>0.In this paper,it is proved that,for anyε>0,the number of v∈V with v≤N such that the following inequality|λ_(1)p_(1)~2+λ_(2)p_(2)~2+λ_(3)p_(3)~4+λ_(4)p_(4)~4+λ_5p_5~4-v|<v^(-δ)has no solution in prime variables p_(1),p_(2),p_(3),p_(4),p_(5)does not exceed O(N^(29/32+2δ+ε)).
基金supported by the PhD Research Startup Foundation of Hubei University of Economics(Grand No.XJ23BS42).
文摘This paper studies the Smoluchowski–Kramers approximation for a discrete-time dynamical system modeled as the motion of a particle in a force field.We show that the approximation holds for the drift-implicit Euler–Maruyama discretization and derive its convergence rate.In particular,the solution of the discretized system converges to the solution of the first-order limit equation in the mean-square sense,and this convergence is independent of the order in which the mass parameterμand the step size h tend to zero.
文摘本文探讨了在大数据背景下,企业面临的数据分散、业务数据存储来源多样化,以及在高并发环境下数据共享和访问的挑战。这些问题导致后端开发成本的增加和系统维护的复杂性。为了解决这些核心问题,本文基于数据即服务(Data as a Service,DaaS)的概念,通过整合多源数据管理、数据目录管理和API服务的全周期管理,助力企业实现数据资产化和数据服务化。这不仅减少了后端开发的工作量,还降低了整体的开发和维护成本,使得数据能够更有效地服务于业务需求。
基金Supported by the National Science and Technology Major Project(No.2022ZD0119001)the National Natural Science Foundation of China(No.61834005,61802304)the Key R&D Program Projects in Shaanxi Province(No.2024GX-YBXM-100).
文摘With the growing demand for compute-intensive applications such as artificial intelligence(AI)and video processing,traditional reconfigurable array processors fail to meet the requirements of high-performance computing and related domains,primarily due to their high power consumption and low energy efficiency.To address this limitation,this paper proposes an accuracy-adaptive approxi-mate reconfigurable array architecture featuring preset dual thresholds and support for four computa-tional accuracy levels,enabling flexible adaptation to diverse application needs.The architecture in-tegrates a self-adaptive mechanism that dynamically adjusts computational precision based on real-time error threshold feedback.To evaluate the proposed architecture,the you only look once version 5(YOLOv5)deep neural network algorithm is parallelized and deployed on the approximate recon-figurable array.Experimental results demonstrate that the architecture achieves an 18.93%reduc-tion in power consumption compared with conventional reconfigurable structures operating in full-pre-cision mode.Additionally,the design exhibits superior energy efficiency and reduced computational resource utilization,thereby significantly enhancing the overall performance and applicability of reconfigurable array processors in power-sensitive scenarios.
文摘In the present paper,we obtain the converse results of approximation of a newly introduced genuine Bernstein-Durrmeyer operators in movable interval.We also get the moments properties of an auxiliary operator which has its own independent values.The moments of the auxiliary operators play important roles in establishing the main result(Theorem 4).
基金financially supported by the National Key Research and Development Program of China(Grant No.2022YFB3706800)the National Natural Science Foundation of China(Grant Nos.51905188 and 51775205).
文摘The reuse of green sand in casting production is hindered by the accumulation of oolitic deposits,primarily composed of clay binder with surface degradation,which may adversely affect the the moulding sand performance.Currently,there is a lack of standardized methods for quantifying the oolitic content.Accurate measurement of oolitic content is of great significance to the reuse of green sand.Attempts to determine oolitic content using potassium hydroxide(KOH)and phosphoric acid(H_(3)PO_(4))methods encounter challenges due to their excessive reactions with SiO_(2) in the sand.In this study,an improved method for measuring the oolitic content of green sand with repeated approximations was proposed.This method judges the chemical activity of the sample surface through the change of its mass to accurately obtain the mass of the reaction oolitic deposits.The test result of the used sand samples from the foundry shows that the oolitic deposits are completely removed after reacting with KOH solution three times at 300℃ for 20 min.SEM and EDS also show that after three times of reactions,the surface of green sand becomes smooth and the content of Al-containing oolitic deposits is very low.This indicates that the method can accurately control the extent of the reaction.Implementation of this method at Huangshi Dongbei Casting Co.,Ltd.has yielded consistent and reliable test results,effectively mirroring variations in green sand oolitic content on the production line.This new method is expected to be widely adopted to improve the efficiency and quality of reused green sand in casting operations.
基金supported in part by the National Natural Science Foundation of China(Grant Nos.62203246 and 62003127)Shandong Provincial Natural Science Foundation(Grant No.ZR2024QF041)the Natural Science Foundation of Hebei Province(Grant No.F2023202060)。
文摘Virtual coupling is a novel technology that enables trains to run closely together without physical connections through communication and automation systems.The paper addresses an adaptive polynomial approximation algorithm for the cooperative control of high-speed trains(HSTs)under virtual coupling.It aims to solve the cooperative tracking control problem of HST formation operations under various scenarios,including known and unknown parameters.To enable the HST formation system to achieve cooperative operation while ensuring an appropriate spacing distance,the tracking errors of displacement and speed throughout the entire operation converge to zero.The proposed control strategy focuses on adopting polynomial approximation to handle unknown parameters,which are estimated via adaptive laws.Additionally,the unknown parameters of the HSTs are estimated online through adaptive laws.Experimental results verify the effectiveness of this method.
基金supported by the Fundamental Research Projects of Shanxi Province(Grant No.202203021222225)the National Natural Science Foundation of China(Grant Nos.12175029,12011530014,and 11775040)the Key Research and Development Project of Liaoning Province(Grant No.2020JH2/10500003).
文摘Determining the minimal distance between the target state and the convex combination of given states is a fundamental problem in quantum resource theory,offering critical guidance for experimental implementations.In this paper,we embark on an in-depth exploration of the use of a quantum state prepared by the convex combination of given qubit states to optimally approximate the l_(1)-norm of coherence of the target quantum state,striving to make the prepared state and the target state as similar as possible.Here,we present the analytical solution for the optimal distance for any N given quantum states.We find that the optimal approximation problem for any N>4 quantum states can be transformed into an optimal approximation problem for no more than four quantum states,which not only significantly streamlines the problem but also proves advantageous for laboratories in terms of material conservation.Ultimately,a one-to-one comparison between the analytical and numerical solutions verifies the effectiveness of our approach.
基金supported in part by the National Natural Science Foundation of China(U2034209)the Postdoctoral Science Foundation of Chongqing(cstc2021jcyj-bsh X0047)+1 种基金the Fundamental Research Funds for the Central Universities(2022CDJJMRH-008)the National Natural Science Foundation of China(62203075)
文摘Dear Editor,This letter focuses on the remaining useful life(RUL)prediction task under limited labeled samples.Existing machine-learning-based RUL prediction methods for this task usually pay attention to mining degradation information to improve the prediction accuracy of degradation value or health indicator for the next epoch.However,they ignore the cumulative prediction error caused by iterations before reaching the failure point.
基金supported by the National Natural Science Foundation of China(Grant Nos.12441502,12122506,12204230,and 12404554)the National Science and Technology Major Project of the Ministry of Science and Technology of China(2024ZD0300404)+6 种基金Guangdong Basic and Applied Basic Research Foundation(Grant No.2021B1515020070)Shenzhen Science and Technology Program(Grant No.RCYX20200714114522109)China Postdoctoral Science Foundation(CPSF)(2024M762114)Postdoctoral Fellowship Program of CPSF(GZC20231727)supported by the National Natural Science Foundation of China(Grant Nos.92165206 and 11974330)Innovation Program for Quantum Science and Technology(Grant No.2021ZD0301603)the Fundamental Research Funds for the Central Universities。
文摘We present a robust quantum optimal control framework for implementing fast entangling gates on ion-trap quantum processors.The framework leverages tailored laser pulses to drive the multiple vibrational sidebands of the ions to create phonon-mediated entangling gates and,unlike the state of the art,requires neither weakcoupling Lamb-Dicke approximation nor perturbation treatment.With the application of gradient-based optimal control,it enables finding amplitude-and phase-modulated laser control protocols that work without the Lamb-Dicke approximation,promising gate speeds on the order of microseconds comparable to the characteristic trap frequencies.Also,robustness requirements on the temperature of the ions and initial optical phase can be conveniently included to pursue high-quality fast gates against experimental imperfections.Our approach represents a step in speeding up quantum gates to achieve larger quantum circuits for quantum computation and simulation,and thus can find applications in near-future experiments.
文摘为构建综合能源系统安全域(integrated energy system security region,IESSR),该文提出一种基于多项式混沌展开(polynomial chaos expansion,PCE)的IESSR边界(IESR boundary,IESSRB)近似方法,借助该方法可得IESSRB的多项式逼近表达式。首先,根据IESSRB的边界拓扑特性,构建系统的IESSR边界点搜索优化模型;然后,根据PCE,对IESSR边界点搜索优化模型进行参数化处理,构建IESSRB搜索的参数化优化模型;进一步地,根据IESSRB搜索的参数化优化模型的KKT条件,将IESSRB的参数化优化模型转化为高维参数化非线性方程组;在此基础上,借助广义Galerkin投影构建关于近似IESSRB的多项式逼近系数的Galerkin投影方程组,通过求解该方程组可得IESSRB的多项式逼近系数,从而获得IESSRB的多项式逼近表达式;为进一步降低Galerkin投影方程组求解复杂度,提出多项式分段近似IESSRB方法,在提高IESSRB近似精度的同时,提升了IESSRB近似的计算效率;最后,通过IES E39-G20测试系统和IES E118-G96测试系统对所提方法进行分析、验证。结果表明,所提方法可实现IESSR的准确、有效构建。
