期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到3,831篇文章
< 1 2 … 192 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Effect of Tooth Geometry on Multi-cycle Meshing Temperature of POM Worm Gears:Parametric Study via an Adaptive Iteration Algorithm 认领 引用
1
作者 Kaixing Li Wujiao Xu +1 位作者 Yonggang Liu Datong Qin 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2025年第2期427-439,共13页
Meshing temperature analyses of polymer gears reported in the literature mainly concern the effects of various material combinations and loading conditions,as their impacts could be seen in the first few meshing cycle... Meshing temperature analyses of polymer gears reported in the literature mainly concern the effects of various material combinations and loading conditions,as their impacts could be seen in the first few meshing cycles.However,the effects of tooth geometry parameters could manifest as the meshing cycles increase.This study investigated the effects of tooth geometry parameters on the multi-cycle meshing temperature of polyoxymethylene(POM)worm gears,aiming to control the meshing temperature elevation by tuning the tooth geometry.Firstly,a finite element(FE)model capable of separately calculating the heat generation and simulating the heat propagation was established.Moreover,an adaptive iteration algorithm was proposed within the FE framework to capture the influence of the heat generation variation from cycle to cycle.This algorithm proved to be feasible and highly efficient compared with experimental results from the literature and simulated results via the full-iteration algorithm.Multi-cycle meshing temperature analyses were conducted on a series of POM worm gears with different tooth geometry parameters.The results reveal that,within the range of 14.5°to 25°,a pressure angle of 25°is favorable for reducing the peak surface temperature and overall body temperature of POM worm gears,which influence flank wear and load-carrying capability,respectively.However,addendum modification should be weighed because it helps with load bearing but increases the risk of severe flank wear.This paper proposes an efficient iteration algorithm for multi-cycle meshing temperature analysis of polymer gears and proves the feasibility of controlling the meshing temperature elevation during multiple cycles by tuning tooth geometry. 展开更多
关键词 POM worm gears Multi-cycle meshing temperature Adaptive iteration algorithm Tooth geometry parameters Parametric study
暂未订购 下载PDF
An online value iteration method for stochastic linear quadratic control with multiplicative noise 认领 引用
2
作者 Shumei Li Bing-Chang Wang Baoqiang Zhang 《Control Theory and Technology》 EI CSCD 2026年第3期451-461,共11页
This paper proposes a model-free online value iteration(VI)algorithm for solving stochastic linear quadratic control problems with ergodic cost functions,where the diffusion term in the dynamics equation is influenced... This paper proposes a model-free online value iteration(VI)algorithm for solving stochastic linear quadratic control problems with ergodic cost functions,where the diffusion term in the dynamics equation is influenced by both the state and control variables.First,we propose an offline VI algorithm based on the idea of stochastic approximation.However,this algorithm requires prior knowledge of the system parameters,which are not always readily available.To overcome this limitation,we then develop a(partially)model-free online learning algorithm based on VI.This algorithm only requires a single system trajectory and does not need the initial control to be stabilizing.By exploiting the growth rate of Itô’s integrals to handle the stochastic term generated by multiplicative noise,we provide a rigorous proof of the algorithm’s convergence.Finally,a simulation example is presented to validate the convergence of the proposed algorithms. 展开更多
关键词 Stochastic linear quadratic problem Model-free Value iteration algorithm Ergodic control Robust dynamic programming
DDoS Attack Tracking Using Multi-Round Iterative Viterbi Algorithm in Satellite Internet 认领 引用 被引量：1
3
作者 Guo Wei Xu Jin +2 位作者 Pei Yukui Yin Liuguo Feng Wei 《China Communications》 SCIE EI CSCD 2025年第3期148-163,共16页
Satellite Internet(SI)provides broadband access as a critical information infrastructure in 6G.However,with the integration of the terrestrial Internet,the influx of massive terrestrial traffic will bring significant ... Satellite Internet(SI)provides broadband access as a critical information infrastructure in 6G.However,with the integration of the terrestrial Internet,the influx of massive terrestrial traffic will bring significant threats to SI,among which DDoS attack will intensify the erosion of limited bandwidth resources.Therefore,this paper proposes a DDoS attack tracking scheme using a multi-round iterative Viterbi algorithm to achieve high-accuracy attack path reconstruction and fast internal source locking,protecting SI from the source.Firstly,to reduce communication overhead,the logarithmic representation of the traffic volume is added to the digests after modeling SI,generating the lightweight deviation degree to construct the observation probability matrix for the Viterbi algorithm.Secondly,the path node matrix is expanded to multi-index matrices in the Viterbi algorithm to store index information for all probability values,deriving the path with non-repeatability and maximum probability.Finally,multiple rounds of iterative Viterbi tracking are performed locally to track DDoS attack based on trimming tracking results.Simulation and experimental results show that the scheme can achieve 96.8%tracking accuracy of external and internal DDoS attack at 2.5 seconds,with the communication overhead at 268KB/s,effectively protecting the limited bandwidth resources of SI. 展开更多
关键词 DDoS tracking iterative Viterbi algorithm satellite Internet 6G
暂未订购 下载PDF
Design of quantum VQ iteration and quantum VQ encoding algorithm taking O(√N) steps for data compression 认领 引用 被引量：2
4
作者 庞朝阳 周正威 +1 位作者 陈平形 郭光灿 《Chinese Physics B》 CAS 2006年第3期618-623,共6页
Vector quantization （VQ） is an important data compression method. The key of the encoding of VQ is to find the closest vector among N vectors for a feature vector. Many classical linear search algorithms take O（N）... Vector quantization （VQ） is an important data compression method. The key of the encoding of VQ is to find the closest vector among N vectors for a feature vector. Many classical linear search algorithms take O（N） steps of distance computing between two vectors. The quantum VQ iteration and corresponding quantum VQ encoding algorithm that takes O（√N） steps are presented in this paper. The unitary operation of distance computing can be performed on a number of vectors simultaneously because the quantum state exists in a superposition of states. The quantum VQ iteration comprises three oracles, by contrast many quantum algorithms have only one oracle, such as Shor＇s factorization algorithm and Grover＇s algorithm. Entanglement state is generated and used, by contrast the state in Grover＇s algorithm is not an entanglement state. The quantum VQ iteration is a rotation over subspace, by contrast the Grover iteration is a rotation over global space. The quantum VQ iteration extends the Grover iteration to the more complex search that requires more oracles. The method of the quantum VQ iteration is universal. 展开更多
关键词 data compression vector quantization Grover＇s algorithm quantum VQ iteration
暂未订购 下载PDF
A two-grid algorithm based on Newton iteration for the stream function form of the Navier-Stokes equations 认领 引用 被引量：1
5
作者 SHAO Xin-ping HAN Dan-fu 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 2011年第3期368-378,共11页
In this paper,we propose a two-grid algorithm for solving the stream function formulation of the stationary Navies-Stokes equations.The algorithm is constructed by reducing the original system to one small,nonlinear s... In this paper,we propose a two-grid algorithm for solving the stream function formulation of the stationary Navies-Stokes equations.The algorithm is constructed by reducing the original system to one small,nonlinear system on the coarse mesh space and two similar linear systems(with same stiffness matrix but different right-hand side)on the fine mesh space.The convergence analysis and error estimation of the algorithm are given for the case of conforming elements.Furthermore,the Mgorithm produces a numerical solution with the optimal asymptotic H^2-error.Finally,we give a numerical illustration to demonstrate the effectiveness of the two-grid algorithm for solving the Navier-Stokes equations. 展开更多
关键词 Two-grid algorithm Navier-Stokes equations Stream function form Reynolds number Newton iteration.
暂未订购 下载PDF
3D finite-difference numerical simulation of the gravitational field using a preconditioned GMRES iterative solver 认领 引用
6
作者 TONG Xiao-zhong XIE Wei +3 位作者 MA Hui-ying WEN Xin-yue ZHU Wen-di ZHANG Chen 《Journal of Central South University》 SCIE EI CAS CSCD 2026年第2期847-860,共14页
With the evolution of geophysical surveys from traditional two-dimensional(2 D)to three-dimensional(3 D)models,the resulting large data volumes pose significant challenges to inversion,particularly when resolving larg... With the evolution of geophysical surveys from traditional two-dimensional(2 D)to three-dimensional(3 D)models,the resulting large data volumes pose significant challenges to inversion,particularly when resolving large-scale 3 D structures.A direct solver for solving an ill-conditioned linear system resulting from the finite-difference approximation of a boundary value problem requires more memory and time than iterative solvers.To overcome this limitation,an efficient iterative solver for 3 D finite-difference approach is introduced to calculate the 3 D gravitational potential and the associated gravitational field.Firstly,the boundary value problem associated with 3 D gravitational potential is discretized using central finite-difference technique based on right rectangular prismatic grids.The resulting large unsymmetric sparse systems are then solved using the generalized minimal residual algorithm(GMRES)iterative solver in combination with incomplete LU factorization.Secondly,to obtain high-accuracy partial derivatives of gravitational potential,a high-degree Lagrange interpolation scheme is employed.Finally,three density models are applied to test the accuracy,reliability,and flexibility of our 3 D finite-difference algorithm.All computational results demonstrate that our method provides an accurate approximation of the gravitational field and is applicable to 3 D forward modeling. 展开更多
关键词 3 D gravitational potential boundary value problem numerical simulation finite-difference algorithm GMRES iterative solver
暂未订购 下载PDF
Distributed Iterative Learning Control for Load Balancing in Flexible AC/DC Hybrid Distribution Systems 认领 引用
7
作者 Hong Zhang Bin Xu +4 位作者 Jinzhong Li Xiaoxiao Meng Cheng Qian Wei Ma Yuguang Xie 《Energy Engineering》 EI 2026年第5期298-316,共19页
The increasing integration of distributed renewable energy sources in the distribution network leads to unbalanced load rates in the distribution network.The traditional load balancing methods are mainly based on netw... The increasing integration of distributed renewable energy sources in the distribution network leads to unbalanced load rates in the distribution network.The traditional load balancing methods are mainly based on network reconfiguration,which have problems such as a long time scale and poor adaptability.In response to these issues,this paper proposes a distributed iterative learning control(ILC)strategy for load balancing in flexible AC/DC hybrid distribution systems.This method combines the consensus algorithm with the ILC mechanism to construct a multi-terminal AC/DC flexible interconnection system model.It is only necessary to measure the load rate of adjacent units without observing the overall system status,which greatly reduces complexity and enhances robustness.In this paper,a new energy photovoltaic and energy storage integrated system was built through MATLAB/Simulink simulation,and the effectiveness of the proposed strategy under normal working conditions and port faults was verified through this system.Through comparative studies with event-triggered control and traditional consensus algorithms,as well as real-time simulations on the RT-LAB simulation platform,it has been confirmed that this method has superior performance in terms of convergence speed,steady-state accuracy,and dynamic response,and has the potential to be applied in practical models.It is suitable for application in medium and low voltage distribution systems with new energy access. 展开更多
关键词 AC/DC hybrid distribution systems iterative learning algorithm load rate
暂未订购 下载PDF
Calculation of Mass Concrete Temperature Containing Cooling Water Pipe Based on Substructure and Iteration Algorithm 认领 引用
8
作者 Heng Zhang Chao Su +2 位作者 Zhizhong Song Zhenzhong Shen Huiguang Lei 《Computer Modeling in Engineering & Sciences》 SCIE EI 2024年第1期813-826,共14页
Mathematical physics equations are often utilized to describe physical phenomena in various fields of science and engineering.One such equation is the Fourier equation,which is a commonly used and effective method for... Mathematical physics equations are often utilized to describe physical phenomena in various fields of science and engineering.One such equation is the Fourier equation,which is a commonly used and effective method for evaluating the effectiveness of temperature control measures for mass concrete.One important measure for temperature control in mass concrete is the use of cooling water pipes.However,the mismatch of grids between large-scale concrete models and small-scale cooling pipe models can result in a significant waste of calculation time when using the finite element method.Moreover,the temperature of the water in the cooling pipe needs to be iteratively calculated during the thermal transfer process.The substructure method can effectively solve this problem,and it has been validated by scholars.The Abaqus/Python secondary development technology provides engineers with enough flexibility to combine the substructure method with an iteration algorithm,which enables the creation of a parametric modeling calculation for cooling water pipes.This paper proposes such a method,which involves iterating the water pipe boundary and establishing the water pipe unit substructure to numerically simulate the concrete temperature field that contains a cooling water pipe.To verify the feasibility and accuracy of the proposed method,two classic numerical examples were analyzed.The results showed that this method has good applicability in cooling pipe calculations.When the value of the iteration parameterαis 0.4,the boundary temperature of the cooling water pipes can meet the accuracy requirements after 4∼5 iterations,effectively improving the computational efficiency.Overall,this approach provides a useful tool for engineers to analyze the temperature control measures accurately and efficiently for mass concrete,such as cooling water pipes,using Abaqus/Python secondary development. 展开更多
关键词 Fourier equation cooling water pipe mass concrete iteration algorithm
暂未订购 下载PDF
An Iterated Greedy Algorithm with Memory and Learning Mechanisms for the Distributed Permutation Flow Shop Scheduling Problem 认领 引用
9
作者 Binhui Wang Hongfeng Wang 《Computers, Materials & Continua》 SCIE EI 2025年第1期371-388,共18页
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. 展开更多
关键词 Distributed permutation flow shop scheduling makespan iterated greedy algorithm memory mechanism cooperative reinforcement learning
暂未订购 下载PDF
TWO PARALLEL ALGORITHMS FOR A CLASS OF SPLIT COMMON SOLUTION PROBLEMS 认领 引用
10
作者 Truong Minh TUYEN Nguyen Thi TRANG Tran Thi HUONG 《Acta Mathematica Scientia》 SCIE CSCD 2026年第1期505-518,共14页
We study the split common solution problem with multiple output sets for monotone operator equations in Hilbert spaces.To solve this problem,we propose two new parallel algorithms.We establish a weak convergence theor... We study the split common solution problem with multiple output sets for monotone operator equations in Hilbert spaces.To solve this problem,we propose two new parallel algorithms.We establish a weak convergence theorem for the first and a strong convergence theorem for the second. 展开更多
关键词 iterative algorithm Hilbert space metric projection proximal point algorithm
暂未订购 下载PDF
AN ITERATION ALGORITHM FOR SOLVING POSTBUCKLING EQUILIBRIUM PATH OF SIMPLY-SUPPORTED RECTANGULAR PLATES UNDER BIAXIAL COMPRESSION 认领 引用
11
作者 乔宗椿 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 1993年第6期517-526,共10页
In this paper, on the basis of von Karman large deflection equations and its double trigonometric series solution, we present a simple, fast and effective iteration algorithm for solving simply-supported rectangular p... In this paper, on the basis of von Karman large deflection equations and its double trigonometric series solution, we present a simple, fast and effective iteration algorithm for solving simply-supported rectangular plate subjected to biaxial compression. 展开更多
关键词 rectangular plates postbuckling equilibrium path iteration algorithm
暂未订购 下载PDF
Geometrically Nonlinear Deformation Reconstruction Based on iQS4 Elements Using a Linearized Iterative iFEM Algorithm 认领 引用 被引量：3
12
作者 Mengying Li Dawei Jia +2 位作者 He Huang Ziyan Wu Adnan Kefal 《Acta Mechanica Solida Sinica》 SCIE EI CSCD 2023年第1期166-180,共15页
Structural shape monitoring plays a vital role in the structural health monitoring systems.The inverse finite element method(iFEM)has been demonstrated to be a practical method of deformation reconstruction owing to i... Structural shape monitoring plays a vital role in the structural health monitoring systems.The inverse finite element method(iFEM)has been demonstrated to be a practical method of deformation reconstruction owing to its unique advantages.Current iFEM formulations have been applied to small deformation of structures based on the small-displacement assumption of linear theory.However,this assumption may be inapplicable to some structures with large displacements in practical applications.Therefore,geometric nonlinearity needs to be considered.In this study,to expand the practical utility of iFEM for large displacement monitoring,we propose a nonlinear iFEM algorithm based on a four-node inverse quadrilateral shell element iQS4.Taking the advantage of an iterative iFEM algorithm,a nonlinear response is linearized to compute the geometrically nonlinear deformation reconstruction,like the basic concept of nonlinear FE analysis.Several examples are solved to verify the proposed approach.It is demonstrated that large displacements can be accurately estimated even if the in-situ sensor data includes different levels of randomly generated noise.It is proven that the nonlinear iFEM algorithm provides a more accurate displacement response as compared to the linear iFEM methodology for structures undergoing large displacement.Hence,the proposed approach can be utilized as a viable tool to effectively characterize geometrically nonlinear deformations of structures in real-time applications. 展开更多
关键词 Deformation reconstruction iQS4 element Iterative algorithm Nonlinear iFEM Geometric nonlinearity
暂未订购 下载PDF
Comparison between iterative wavefront control algorithm and direct gradient wavefront control algorithm for adaptive optics system 认领 引用 被引量：3
13
作者 程生毅 刘文劲 +3 位作者 陈善球 董理治 杨平 许冰 《Chinese Physics B》 SCIE EI CAS CSCD 2015年第8期391-397,共7页
Among all kinds of wavefront control algorithms in adaptive optics systems, the direct gradient wavefront control algorithm is the most widespread and common method. This control algorithm obtains the actuator voltage... Among all kinds of wavefront control algorithms in adaptive optics systems, the direct gradient wavefront control algorithm is the most widespread and common method. This control algorithm obtains the actuator voltages directly from wavefront slopes through pre-measuring the relational matrix between deformable mirror actuators and Hartmann wavefront sensor with perfect real-time characteristic and stability. However, with increasing the number of sub-apertures in wavefront sensor and deformable mirror actuators of adaptive optics systems, the matrix operation in direct gradient algorithm takes too much time, which becomes a major factor influencing control effect of adaptive optics systems. In this paper we apply an iterative wavefront control algorithm to high-resolution adaptive optics systems, in which the voltages of each actuator are obtained through iteration arithmetic, which gains great advantage in calculation and storage. For AO system with thousands of actuators, the computational complexity estimate is about O(n2) ～ O(n3) in direct gradient wavefront control algorithm, while the computational complexity estimate in iterative wavefront control algorithm is about O(n) ～(O(n)3/2), in which n is the number of actuators of AO system. And the more the numbers of sub-apertures and deformable mirror actuators, the more significant advantage the iterative wavefront control algorithm exhibits. 展开更多
关键词 adaptive optics iterative wavefront control algorithm direct gradient wavefront control algorithm
暂未订购 下载PDF
Iterative Algorithm of Steered Minimum Variance and Its Application in Weak Targets Detection 认领 引用 被引量：3
14
作者 朱代柱 李关防 +2 位作者 惠俊英 陈阳 黄雯华 《Journal of Shanghai Jiaotong university(Science)》 EI 2010年第6期694-701,共8页
The steered covariance matrix(STCM) and its inverse matrix should be calculated in each beam for steered minimum variance(STMV) . The inverse matrix needs complex computation and restricts its application in engineeri... The steered covariance matrix(STCM) and its inverse matrix should be calculated in each beam for steered minimum variance(STMV) . The inverse matrix needs complex computation and restricts its application in engineering. Combining the integration character of one-phase regressive filter with the iterative formula of inverse matrix,an STMV iterative algorithm is proposed. The computational cost of the iterative algorithm is reduced approximately to be 2/M times of the original one when there are M sensors,and is more advantaged for the realization of the algorithm in real time. Simulation results show that the STMV iterative algorithm can preserve the characters of STMV on high azimuth resolution and weak target detection while the computational cost reduced sharply. The analysis on sea trial data proves that the proposed algorithm can estimate each target's azimuth even when the source powers differ in large scales or their bearings are very approximate. 展开更多
关键词 beamforming steered minimum variance (STMV) iterative algorithm computational cost weak target detection
暂未订购 下载PDF
Calculation of Extraction Equilibrium in Multi-Component System by Newton-Raphson Algorithm 认领 引用 被引量：1
15
作者 贾江涛 王建方 +3 位作者 严纯华 廖春生 吴声 李标国 《Journal of Rare Earths》 SCIE EI CAS 1999年第4期246-249,共4页
Based on the extraction equilibrium and mass balances in countercurrent extraction systems, a novel method was studied for dealing with the extraction equilibrium and the mass distribution in a multi-component(gamma-c... Based on the extraction equilibrium and mass balances in countercurrent extraction systems, a novel method was studied for dealing with the extraction equilibrium and the mass distribution in a multi-component(gamma-component) system. The relationships of mass distribution (x(i), y(i), i = 1, ..., lambda) between two phases were expressed by 2 lambda dimensional simultaneous equations. These simultaneous equations can be converted to a one-dimension nonlinear equation, then it was solved by Newton-Raphson algorithm within a few number of iteration. Compared with the regular calculation method for the 2 lambda dimensional simultaneous equations, Newton-Raphson algorithm can decrease the number of iteration, increase the convergence of the equations and accelerate the speed of simulation. It was verified in many multi-component systems with satisfactory results. As an example, a five-component system is demonstrated in this paper. 展开更多
关键词 rare earths multi-component system extraction equilibrium Newton-Raphson algorithm
暂未订购 下载PDF
Jointly-check iterative decoding algorithm for quantum sparse graph codes 认领 引用 被引量：2
16
作者 邵军虎 白宝明 +1 位作者 林伟 周林 《Chinese Physics B》 SCIE EI CAS 2010年第8期116-122,共7页
For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with standard belief-propagation （BP） algorithm. ... For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with standard belief-propagation （BP） algorithm. In this paper, we present a jointly-check iterative algorithm suitable for decoding quantum sparse graph codes efficiently. Numerical simulations show that this modified method outperforms standard BP algorithm with an obvious performance improvement. 展开更多
关键词 quantum error correction sparse graph code iterative decoding belief-propagation algorithm
暂未订购 下载PDF
Fast parallel algorithm for three-dimensional distance-driven model in iterative computed tomography reconstruction 认领 引用 被引量：1
17
作者 陈建林 李磊 +5 位作者 王林元 蔡爱龙 席晓琦 张瀚铭 李建新 闫镔 《Chinese Physics B》 SCIE EI CAS CSCD 2015年第2期513-520,共8页
The projection matrix model is used to describe the physical relationship between reconstructed object and projection.Such a model has a strong influence on projection and backprojection,two vital operations in iterat... The projection matrix model is used to describe the physical relationship between reconstructed object and projection.Such a model has a strong influence on projection and backprojection,two vital operations in iterative computed tomographic reconstruction.The distance-driven model（DDM） is a state-of-the-art technology that simulates forward and back projections.This model has a low computational complexity and a relatively high spatial resolution;however,it includes only a few methods in a parallel operation with a matched model scheme.This study introduces a fast and parallelizable algorithm to improve the traditional DDM for computing the parallel projection and backprojection operations.Our proposed model has been implemented on a GPU（graphic processing unit） platform and has achieved satisfactory computational efficiency with no approximation.The runtime for the projection and backprojection operations with our model is approximately 4.5 s and 10.5 s per loop,respectively,with an image size of 256×256×256 and 360 projections with a size of 512×512.We compare several general algorithms that have been proposed for maximizing GPU efficiency by using the unmatched projection/backprojection models in a parallel computation.The imaging resolution is not sacrificed and remains accurate during computed tomographic reconstruction. 展开更多
关键词 computed tomography iterative reconstruction parallelizable algorithm distance-driven model
暂未订购 下载PDF
ITERATIVE ALGORITHM FOR AXIALLY ACCELERATING STRINGS WITH INTEGRAL CONSTITUTIVE LAW 认领 引用 被引量：2
18
作者 Weijia Zhao Liqun Chen 《Acta Mechanica Solida Sinica》 SCIE EI 2008年第5期449-456,共8页
A numerical method is proposed to simulate the transverse vibrations of a viscoelastic moving string constituted by an integral law. In the numerical computation, the Galerkin method based on the Hermite functions is ... A numerical method is proposed to simulate the transverse vibrations of a viscoelastic moving string constituted by an integral law. In the numerical computation, the Galerkin method based on the Hermite functions is applied to discretize the state variables, and the Runge- Kutta method is applied to solve the resulting differential-integral equation system. A linear iterative process is designed to compute the integral terms at each time step, which makes the numerical method more efficient and accurate. As examples, nonlinear parametric vibrations of an axially moving viscoelastic string are analyzed. 展开更多
关键词 iterative algorithm partial-differential-integral equation Hermite function Galerkin method axially moving string integral constitutive law
暂未订购 下载PDF
AN ITERATIVE ALGORITHM FOR MAXIMAL MONOTONE MULTIVALUED OPERATOR EQUATIONS 认领 引用 被引量：1
19
作者 Xiao Jinsheng Sun Lelin 《Acta Mathematica Scientia》 SCIE 2001年第2期152-158,共7页
A proximal iterative algorithm for the mulitivalue operator equation 0∈T(x)is presented,where T is a maximal monotone operator.It is an improvement of the proximal point algorithm as well know.The convergence of the ... A proximal iterative algorithm for the mulitivalue operator equation 0∈T(x)is presented,where T is a maximal monotone operator.It is an improvement of the proximal point algorithm as well know.The convergence of the algorithm is discussed and all example is given. 展开更多
关键词 Iterative algorithm maximal monotone operator multivalued operator
暂未订购 下载PDF
AN ITERATIVE ALGORITHM FOR OPTIMAL DESIGN OF NON-FREQUENCY-SELECTIVE FIR DIGITAL FILTERS 认领 引用 被引量：1
20
作者 Tian Xinguang Duan Miyi +1 位作者 Sun Chunlai Liu Xin 《Journal of Electronics(China)》 2008年第5期667-672,共6页
This paper proposes a novel iterative algorithm for optimal design of non-frequency-selective Finite Impulse Response(FIR) digital filters based on the windowing method.Different from the traditional optimization conc... This paper proposes a novel iterative algorithm for optimal design of non-frequency-selective Finite Impulse Response(FIR) digital filters based on the windowing method.Different from the traditional optimization concept of adjusting the window or the filter order in the windowing design of an FIR digital filter,the key idea of the algorithm is minimizing the approximation error by succes-sively modifying the design result through an iterative procedure under the condition of a fixed window length.In the iterative procedure,the known deviation of the designed frequency response in each iteration from the ideal frequency response is used as a reference for the next iteration.Because the approximation error can be specified variably,the algorithm is applicable for the design of FIR digital filters with different technical requirements in the frequency domain.A design example is employed to illustrate the efficiency of the algorithm. 展开更多
关键词 Finite Impulse Response （FIR） digital filters Optimal design Windowing method Approximation error Iterative algorithm
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 192 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈