The performance analysis of the generalized Carlson iterating process,which can realize the rational approximation of fractional operator with arbitrary order,is presented in this paper.The reasons why the generalized...The performance analysis of the generalized Carlson iterating process,which can realize the rational approximation of fractional operator with arbitrary order,is presented in this paper.The reasons why the generalized Carlson iterating function possesses more excellent properties such as self-similarity and exponential symmetry are also explained.K-index,P-index,O-index,and complexity index are introduced to contribute to performance analysis.Considering nine different operational orders and choosing an appropriate rational initial impedance for a certain operational order,these rational approximation impedance functions calculated by the iterating function meet computational rationality,positive reality,and operational validity.Then they are capable of having the operational performance of fractional operators and being physical realization.The approximation performance of the impedance function to the ideal fractional operator and the circuit network complexity are also exhibited.展开更多
Three dimensional Euler equations are solved in the finite volume form with van Leer's flux vector splitting technique. Block matrix is inverted by Gauss-Seidel iteration in two dimensional plane while strongly im...Three dimensional Euler equations are solved in the finite volume form with van Leer's flux vector splitting technique. Block matrix is inverted by Gauss-Seidel iteration in two dimensional plane while strongly implicit alternating sweeping is implemented in the direction of the third dimension. Very rapid convergence rate is obtained with CFL number reaching the order of 100. The memory resources can be greatly saved too. It is verified that the reflection boundary condition can not be used with flux vector splitting since it will produce too large numerical dissipation. The computed flow fields agree well with experimental results. Only one or two grid points are there within the shock transition zone.展开更多
Iteration problems such as compound interest calculations have well-specified parameters and aim to derive an exact value. Not all problems offer well-specified parameters, even for well-defined dynamic equations;the ...Iteration problems such as compound interest calculations have well-specified parameters and aim to derive an exact value. Not all problems offer well-specified parameters, even for well-defined dynamic equations;the linear “weak field approximation” of general relativity is iteratively equivalent to Einstein’s non-linear field equation, but the exact parameters involved in some applications are unknown. This paper develops a theory based on “fuzzy” parameters that must produce exact results. The problem is analyzed and example calculations are produced.展开更多
In this paper,we present local functional law of the iterated logarithm for Cs?rg?-Révész type increments of fractional Brownian motion.The results obtained extend works of Gantert[Ann.Probab.,1993,21(2):104...In this paper,we present local functional law of the iterated logarithm for Cs?rg?-Révész type increments of fractional Brownian motion.The results obtained extend works of Gantert[Ann.Probab.,1993,21(2):1045-1049]and Monrad and Rootzén[Probab.Theory Related Fields,1995,101(2):173-192].展开更多
The increased demand for personalized customization calls for new production modes to enhance collaborations among a wide range of manufacturing practitioners who unnecessarily trust each other.In this article,a block...The increased demand for personalized customization calls for new production modes to enhance collaborations among a wide range of manufacturing practitioners who unnecessarily trust each other.In this article,a blockchain-enabled manufacturing collaboration framework is proposed,with a focus on the production capacity matching problem for blockchainbased peer-to-peer(P2P)collaboration.First,a digital model of production capacity description is built for trustworthy and transparent sharing over the blockchain.Second,an optimization problem is formulated for P2P production capacity matching with objectives to maximize both social welfare and individual benefits of all participants.Third,a feasible solution based on an iterative double auction mechanism is designed to determine the optimal price and quantity for production capacity matching with a lack of personal information.It facilitates automation of the matching process while protecting users'privacy via blockchainbased smart contracts.Finally,simulation results from the Hyperledger Fabric-based prototype show that the proposed approach increases social welfare by 1.4%compared to the Bayesian game-based approach,makes all participants profitable,and achieves 90%fairness of enterprises.展开更多
A new method based on the iterative adaptive algorithm(IAA)and blocking matrix preprocessing(BMP)is proposed to study the suppression of multi-mainlobe interference.The algorithm is applied to precisely estimate the s...A new method based on the iterative adaptive algorithm(IAA)and blocking matrix preprocessing(BMP)is proposed to study the suppression of multi-mainlobe interference.The algorithm is applied to precisely estimate the spatial spectrum and the directions of arrival(DOA)of interferences to overcome the drawbacks associated with conventional adaptive beamforming(ABF)methods.The mainlobe interferences are identified by calculating the correlation coefficients between direction steering vectors(SVs)and rejected by the BMP pretreatment.Then,IAA is subsequently employed to reconstruct a sidelobe interference-plus-noise covariance matrix for the preferable ABF and residual interference suppression.Simulation results demonstrate the excellence of the proposed method over normal methods based on BMP and eigen-projection matrix perprocessing(EMP)under both uncorrelated and coherent circumstances.展开更多
This work proposes the application of an iterative learning model predictive control(ILMPC)approach based on an adaptive fault observer(FOBILMPC)for fault-tolerant control and trajectory tracking in air-breathing hype...This work proposes the application of an iterative learning model predictive control(ILMPC)approach based on an adaptive fault observer(FOBILMPC)for fault-tolerant control and trajectory tracking in air-breathing hypersonic vehicles.In order to increase the control amount,this online control legislation makes use of model predictive control(MPC)that is based on the concept of iterative learning control(ILC).By using offline data to decrease the linearized model’s faults,the strategy may effectively increase the robustness of the control system and guarantee that disturbances can be suppressed.An adaptive fault observer is created based on the suggested ILMPC approach in order to enhance overall fault tolerance by estimating and compensating for actuator disturbance and fault degree.During the derivation process,a linearized model of longitudinal dynamics is established.The suggested ILMPC approach is likely to be used in the design of hypersonic vehicle control systems since numerical simulations have demonstrated that it can decrease tracking error and speed up convergence when compared to the offline controller.展开更多
The distributed permutation flow shop scheduling problem(DPFSP)has received increasing attention in recent years.The iterated greedy algorithm(IGA)serves as a powerful optimizer for addressing such a problem because o...The distributed permutation flow shop scheduling problem(DPFSP)has received increasing attention in recent years.The iterated greedy algorithm(IGA)serves as a powerful optimizer for addressing such a problem because of its straightforward,single-solution evolution framework.However,a potential draw-back of IGA is the lack of utilization of historical information,which could lead to an imbalance between exploration and exploitation,especially in large-scale DPFSPs.As a consequence,this paper develops an IGA with memory and learning mechanisms(MLIGA)to efficiently solve the DPFSP targeted at the mini-malmakespan.InMLIGA,we incorporate a memory mechanism to make a more informed selection of the initial solution at each stage of the search,by extending,reconstructing,and reinforcing the information from previous solutions.In addition,we design a twolayer cooperative reinforcement learning approach to intelligently determine the key parameters of IGA and the operations of the memory mechanism.Meanwhile,to ensure that the experience generated by each perturbation operator is fully learned and to reduce the prior parameters of MLIGA,a probability curve-based acceptance criterion is proposed by combining a cube root function with custom rules.At last,a discrete adaptive learning rate is employed to enhance the stability of the memory and learningmechanisms.Complete ablation experiments are utilized to verify the effectiveness of the memory mechanism,and the results show that this mechanism is capable of improving the performance of IGA to a large extent.Furthermore,through comparative experiments involving MLIGA and five state-of-the-art algorithms on 720 benchmarks,we have discovered that MLI-GA demonstrates significant potential for solving large-scale DPFSPs.This indicates that MLIGA is well-suited for real-world distributed flow shop scheduling.展开更多
The lattice parameter,measured with sufficient accuracy,can be utilized to evaluate the quality of single crystals and to determine the equation of state for materials.We propose an iterative method for obtaining more...The lattice parameter,measured with sufficient accuracy,can be utilized to evaluate the quality of single crystals and to determine the equation of state for materials.We propose an iterative method for obtaining more precise lattice parameters using the interaction points for the pseudo-Kossel pattern obtained from laser-induced X-ray diffraction(XRD).This method has been validated by the analysis of an XRD experiment conducted on iron single crystals.Furthermore,the method was used to calculate the compression ratio and rotated angle of an LiF sample under high pressure loading.This technique provides a robust tool for in-situ characterization of structural changes in single crystals under extreme conditions.It has significant implications for studying the equation of state and phase transitions.展开更多
In this paper,a new technique is introduced to construct higher-order iterative methods for solving nonlinear systems.The order of convergence of some iterative methods can be improved by three at the cost of introduc...In this paper,a new technique is introduced to construct higher-order iterative methods for solving nonlinear systems.The order of convergence of some iterative methods can be improved by three at the cost of introducing only one additional evaluation of the function in each step.Furthermore,some new efficient methods with a higher-order of convergence are obtained by using only a single matrix inversion in each iteration.Analyses of convergence properties and computational efficiency of these new methods are made and testified by several numerical problems.By comparison,the new schemes are more efficient than the corresponding existing ones,particularly for large problem sizes.展开更多
Currently,the main idea of iterative rendering methods is to allocate a fixed number of samples to pixels that have not been fully rendered by calculating the completion rate.It is obvious that this strategy ignores t...Currently,the main idea of iterative rendering methods is to allocate a fixed number of samples to pixels that have not been fully rendered by calculating the completion rate.It is obvious that this strategy ignores the changes in pixel values during the previous rendering process,which may result in additional iterative operations.展开更多
A Bayesian network reconstruction method based on norm minimization is proposed to address the sparsity and iterative divergence issues in network reconstruction caused by noise and missing values.This method achieves...A Bayesian network reconstruction method based on norm minimization is proposed to address the sparsity and iterative divergence issues in network reconstruction caused by noise and missing values.This method achieves precise adjustment of the network structure by constructing a preliminary random network model and introducing small-world network characteristics and combines L1 norm minimization regularization techniques to control model complexity and optimize the inference process of variable dependencies.In the experiment of game network reconstruction,when the success rate of the L1 norm minimization model’s existence connection reconstruction reaches 100%,the minimum data required is about 40%,while the minimum data required for a sparse Bayesian learning network is about 45%.In terms of operational efficiency,the running time for minimizing the L1 normis basically maintained at 1.0 s,while the success rate of connection reconstruction increases significantly with an increase in data volume,reaching a maximum of 13.2 s.Meanwhile,in the case of a signal-to-noise ratio of 10 dB,the L1 model achieves a 100% success rate in the reconstruction of existing connections,while the sparse Bayesian network had the highest success rate of 90% in the reconstruction of non-existent connections.In the analysis of actual cases,the maximum lift and drop track of the research method is 0.08 m.The mean square error is 5.74 cm^(2).The results indicate that this norm minimization-based method has good performance in data efficiency and model stability,effectively reducing the impact of outliers on the reconstruction results to more accurately reflect the actual situation.展开更多
For a large-scale dynamic system,the efficiency of computation becomes a vital work sometimes in engineering practices.As a layered structural system,ballastless track and substructure occupy most part of the degrees ...For a large-scale dynamic system,the efficiency of computation becomes a vital work sometimes in engineering practices.As a layered structural system,ballastless track and substructure occupy most part of the degrees of freedom of the whole system.It is,therefore,rather important to optimize the structural models in dynamic equation formulations.In this work,a three-dimensional and coupled model for multi-rigid-body of train and finite elements of track and substructures is pre-sented by multi-scale assemble and matrix reassemble method.The matrix reassembling tactic is based on the multi-scale assemble method,through which the finite element matrix bandwidth is greatly narrowed,and the Cholesky factorization,iterative and multi-time-step solution have been introduced to efficiently obtain the train,track and substructure responses.The subgrade and its subsoil works as a typical substructural system,and comparisons with the previous model without matrix reassembling,SIMPACK and ABAQUS have been conducted to fully validate the efficiency and accuracy of this train-track-subgrade dynamic interaction model.展开更多
Radiation dose reduction in computed tomography(CT)can be achieved by decreasing the number of projections.However,reconstructing CT images via filtered back projection algorithm from sparse-view projections often con...Radiation dose reduction in computed tomography(CT)can be achieved by decreasing the number of projections.However,reconstructing CT images via filtered back projection algorithm from sparse-view projections often contains severe streak artifacts,affecting clinical diagnosis.To address this issue,this paper proposes TransitNet,an iterative unrolling deep neural network that combines model-driven data consistency,a physical a prior constraint,with deep learning’s feature extraction capabilities.TransitNet employs a novel iterative architecture,implementing flexible physical constraints through learnable data consistency operations,utilizing Transformer’s self-attention mechanism to model long-range dependencies in image features,and introducing linear attention mechanisms to reduce self-attention’s computational complexity from quadratic to linear.Extensive experiments demonstrate that this method exhibits significant advantages in both reconstruction quality and computational efficiency,effectively suppressing streak artifacts while preserving structures and details of images.展开更多
文摘The performance analysis of the generalized Carlson iterating process,which can realize the rational approximation of fractional operator with arbitrary order,is presented in this paper.The reasons why the generalized Carlson iterating function possesses more excellent properties such as self-similarity and exponential symmetry are also explained.K-index,P-index,O-index,and complexity index are introduced to contribute to performance analysis.Considering nine different operational orders and choosing an appropriate rational initial impedance for a certain operational order,these rational approximation impedance functions calculated by the iterating function meet computational rationality,positive reality,and operational validity.Then they are capable of having the operational performance of fractional operators and being physical realization.The approximation performance of the impedance function to the ideal fractional operator and the circuit network complexity are also exhibited.
文摘Three dimensional Euler equations are solved in the finite volume form with van Leer's flux vector splitting technique. Block matrix is inverted by Gauss-Seidel iteration in two dimensional plane while strongly implicit alternating sweeping is implemented in the direction of the third dimension. Very rapid convergence rate is obtained with CFL number reaching the order of 100. The memory resources can be greatly saved too. It is verified that the reflection boundary condition can not be used with flux vector splitting since it will produce too large numerical dissipation. The computed flow fields agree well with experimental results. Only one or two grid points are there within the shock transition zone.
文摘Iteration problems such as compound interest calculations have well-specified parameters and aim to derive an exact value. Not all problems offer well-specified parameters, even for well-defined dynamic equations;the linear “weak field approximation” of general relativity is iteratively equivalent to Einstein’s non-linear field equation, but the exact parameters involved in some applications are unknown. This paper develops a theory based on “fuzzy” parameters that must produce exact results. The problem is analyzed and example calculations are produced.
基金Supported by NSFC(Nos.11661025,12161024)Natural Science Foundation of Guangxi(Nos.2020GXNSFAA159118,2021GXNSFAA196045)+2 种基金Guangxi Science and Technology Project(No.Guike AD20297006)Training Program for 1000 Young and Middle-aged Cadre Teachers in Universities of GuangxiNational College Student's Innovation and Entrepreneurship Training Program(No.202110595049)。
文摘In this paper,we present local functional law of the iterated logarithm for Cs?rg?-Révész type increments of fractional Brownian motion.The results obtained extend works of Gantert[Ann.Probab.,1993,21(2):1045-1049]and Monrad and Rootzén[Probab.Theory Related Fields,1995,101(2):173-192].
基金supported in part by the National Natural Science Foundation of China(62273310)the Natural Science Foundation of Zhejiang Province of China(LY22F030006,LZ24F030009)
文摘The increased demand for personalized customization calls for new production modes to enhance collaborations among a wide range of manufacturing practitioners who unnecessarily trust each other.In this article,a blockchain-enabled manufacturing collaboration framework is proposed,with a focus on the production capacity matching problem for blockchainbased peer-to-peer(P2P)collaboration.First,a digital model of production capacity description is built for trustworthy and transparent sharing over the blockchain.Second,an optimization problem is formulated for P2P production capacity matching with objectives to maximize both social welfare and individual benefits of all participants.Third,a feasible solution based on an iterative double auction mechanism is designed to determine the optimal price and quantity for production capacity matching with a lack of personal information.It facilitates automation of the matching process while protecting users'privacy via blockchainbased smart contracts.Finally,simulation results from the Hyperledger Fabric-based prototype show that the proposed approach increases social welfare by 1.4%compared to the Bayesian game-based approach,makes all participants profitable,and achieves 90%fairness of enterprises.
基金The National Natural Science Foundation of China(No.U19B2031).
文摘A new method based on the iterative adaptive algorithm(IAA)and blocking matrix preprocessing(BMP)is proposed to study the suppression of multi-mainlobe interference.The algorithm is applied to precisely estimate the spatial spectrum and the directions of arrival(DOA)of interferences to overcome the drawbacks associated with conventional adaptive beamforming(ABF)methods.The mainlobe interferences are identified by calculating the correlation coefficients between direction steering vectors(SVs)and rejected by the BMP pretreatment.Then,IAA is subsequently employed to reconstruct a sidelobe interference-plus-noise covariance matrix for the preferable ABF and residual interference suppression.Simulation results demonstrate the excellence of the proposed method over normal methods based on BMP and eigen-projection matrix perprocessing(EMP)under both uncorrelated and coherent circumstances.
基金supported by the National Natural Science Foundation of China(12072090).
文摘This work proposes the application of an iterative learning model predictive control(ILMPC)approach based on an adaptive fault observer(FOBILMPC)for fault-tolerant control and trajectory tracking in air-breathing hypersonic vehicles.In order to increase the control amount,this online control legislation makes use of model predictive control(MPC)that is based on the concept of iterative learning control(ILC).By using offline data to decrease the linearized model’s faults,the strategy may effectively increase the robustness of the control system and guarantee that disturbances can be suppressed.An adaptive fault observer is created based on the suggested ILMPC approach in order to enhance overall fault tolerance by estimating and compensating for actuator disturbance and fault degree.During the derivation process,a linearized model of longitudinal dynamics is established.The suggested ILMPC approach is likely to be used in the design of hypersonic vehicle control systems since numerical simulations have demonstrated that it can decrease tracking error and speed up convergence when compared to the offline controller.
基金supported in part by the National Key Research and Development Program of China under Grant No.2021YFF0901300in part by the National Natural Science Foundation of China under Grant Nos.62173076 and 72271048.
文摘The distributed permutation flow shop scheduling problem(DPFSP)has received increasing attention in recent years.The iterated greedy algorithm(IGA)serves as a powerful optimizer for addressing such a problem because of its straightforward,single-solution evolution framework.However,a potential draw-back of IGA is the lack of utilization of historical information,which could lead to an imbalance between exploration and exploitation,especially in large-scale DPFSPs.As a consequence,this paper develops an IGA with memory and learning mechanisms(MLIGA)to efficiently solve the DPFSP targeted at the mini-malmakespan.InMLIGA,we incorporate a memory mechanism to make a more informed selection of the initial solution at each stage of the search,by extending,reconstructing,and reinforcing the information from previous solutions.In addition,we design a twolayer cooperative reinforcement learning approach to intelligently determine the key parameters of IGA and the operations of the memory mechanism.Meanwhile,to ensure that the experience generated by each perturbation operator is fully learned and to reduce the prior parameters of MLIGA,a probability curve-based acceptance criterion is proposed by combining a cube root function with custom rules.At last,a discrete adaptive learning rate is employed to enhance the stability of the memory and learningmechanisms.Complete ablation experiments are utilized to verify the effectiveness of the memory mechanism,and the results show that this mechanism is capable of improving the performance of IGA to a large extent.Furthermore,through comparative experiments involving MLIGA and five state-of-the-art algorithms on 720 benchmarks,we have discovered that MLI-GA demonstrates significant potential for solving large-scale DPFSPs.This indicates that MLIGA is well-suited for real-world distributed flow shop scheduling.
文摘A survey of recent progress on the multiplicity and stability problems for closed characteristics on compact convex hypersurfaces in R^(2n) is given.
基金National Natural Science Foundation of China(12102410)Fund of National Key Laboratory of Shock Wave and Detonation Physics(JCKYS2022212005)。
文摘The lattice parameter,measured with sufficient accuracy,can be utilized to evaluate the quality of single crystals and to determine the equation of state for materials.We propose an iterative method for obtaining more precise lattice parameters using the interaction points for the pseudo-Kossel pattern obtained from laser-induced X-ray diffraction(XRD).This method has been validated by the analysis of an XRD experiment conducted on iron single crystals.Furthermore,the method was used to calculate the compression ratio and rotated angle of an LiF sample under high pressure loading.This technique provides a robust tool for in-situ characterization of structural changes in single crystals under extreme conditions.It has significant implications for studying the equation of state and phase transitions.
基金Supported by the National Natural Science Foundation of China(12061048)NSF of Jiangxi Province(20232BAB201026,20232BAB201018)。
文摘In this paper,a new technique is introduced to construct higher-order iterative methods for solving nonlinear systems.The order of convergence of some iterative methods can be improved by three at the cost of introducing only one additional evaluation of the function in each step.Furthermore,some new efficient methods with a higher-order of convergence are obtained by using only a single matrix inversion in each iteration.Analyses of convergence properties and computational efficiency of these new methods are made and testified by several numerical problems.By comparison,the new schemes are more efficient than the corresponding existing ones,particularly for large problem sizes.
基金supported partially by the National Natural Science Foundation of China(No.U19A2063)the Jilin Provincial Science&Technology Development Program of China(No.20230201080GX)。
文摘Currently,the main idea of iterative rendering methods is to allocate a fixed number of samples to pixels that have not been fully rendered by calculating the completion rate.It is obvious that this strategy ignores the changes in pixel values during the previous rendering process,which may result in additional iterative operations.
基金supported by the Scientific and Technological Developing Scheme of Jilin Province,China(No.20240101371JC)the National Natural Science Foundation of China(No.62107008).
文摘A Bayesian network reconstruction method based on norm minimization is proposed to address the sparsity and iterative divergence issues in network reconstruction caused by noise and missing values.This method achieves precise adjustment of the network structure by constructing a preliminary random network model and introducing small-world network characteristics and combines L1 norm minimization regularization techniques to control model complexity and optimize the inference process of variable dependencies.In the experiment of game network reconstruction,when the success rate of the L1 norm minimization model’s existence connection reconstruction reaches 100%,the minimum data required is about 40%,while the minimum data required for a sparse Bayesian learning network is about 45%.In terms of operational efficiency,the running time for minimizing the L1 normis basically maintained at 1.0 s,while the success rate of connection reconstruction increases significantly with an increase in data volume,reaching a maximum of 13.2 s.Meanwhile,in the case of a signal-to-noise ratio of 10 dB,the L1 model achieves a 100% success rate in the reconstruction of existing connections,while the sparse Bayesian network had the highest success rate of 90% in the reconstruction of non-existent connections.In the analysis of actual cases,the maximum lift and drop track of the research method is 0.08 m.The mean square error is 5.74 cm^(2).The results indicate that this norm minimization-based method has good performance in data efficiency and model stability,effectively reducing the impact of outliers on the reconstruction results to more accurately reflect the actual situation.
基金supported by the National Natural Science Foundation of China(Grant Nos.52378468)Science and Technology Research and Development Program Project of China railway group limited(Major Special Project,No.2022-Major-14,2021-Special-08,2021-Major-02)+3 种基金Young Elite Scientists Sponsorship Program by CAST(2020-2022QNRC002)Central South University Innovation-Driven Research Programme(2023CXQD073)the National Natural Science Foundation of Hunan Province(Grant Nos.2022JJ20071 and 2021JJ30850)National Key R&D Program‘Transportation Infrastructure’‘Reveal the list and take command’project(2022YFB2603301).
文摘For a large-scale dynamic system,the efficiency of computation becomes a vital work sometimes in engineering practices.As a layered structural system,ballastless track and substructure occupy most part of the degrees of freedom of the whole system.It is,therefore,rather important to optimize the structural models in dynamic equation formulations.In this work,a three-dimensional and coupled model for multi-rigid-body of train and finite elements of track and substructures is pre-sented by multi-scale assemble and matrix reassemble method.The matrix reassembling tactic is based on the multi-scale assemble method,through which the finite element matrix bandwidth is greatly narrowed,and the Cholesky factorization,iterative and multi-time-step solution have been introduced to efficiently obtain the train,track and substructure responses.The subgrade and its subsoil works as a typical substructural system,and comparisons with the previous model without matrix reassembling,SIMPACK and ABAQUS have been conducted to fully validate the efficiency and accuracy of this train-track-subgrade dynamic interaction model.
基金National Natural Science Foundation of China under grant (62071281)Local Science and Technology Development Fund Project Guided by the Central Government under grant (YDZJSX2021A003)。
文摘Radiation dose reduction in computed tomography(CT)can be achieved by decreasing the number of projections.However,reconstructing CT images via filtered back projection algorithm from sparse-view projections often contains severe streak artifacts,affecting clinical diagnosis.To address this issue,this paper proposes TransitNet,an iterative unrolling deep neural network that combines model-driven data consistency,a physical a prior constraint,with deep learning’s feature extraction capabilities.TransitNet employs a novel iterative architecture,implementing flexible physical constraints through learnable data consistency operations,utilizing Transformer’s self-attention mechanism to model long-range dependencies in image features,and introducing linear attention mechanisms to reduce self-attention’s computational complexity from quadratic to linear.Extensive experiments demonstrate that this method exhibits significant advantages in both reconstruction quality and computational efficiency,effectively suppressing streak artifacts while preserving structures and details of images.
