Showing 881 - 900 results of 3,044 for search '"ITER"', query time: 0.04s Refine Results
  1. 881

    A Comparison of Chaotic Electromagnetic Field Optimization Algorithms by Olympia Roeva, Dafina Zoteva

    Published 2024-12-01
    “…Ten chaotic maps are incorporated in EFO – Chebyshev, Circle, Gauss, Iterative, Logistic, Piecewise, Sine, Singer, Sinusoidal and Tent. …”
    Get full text
    Article
  2. 882

    Applications of Symmetric and Nonsymmetric MSSOR Preconditioners to Large-Scale Biot's Consolidation Problems with Nonassociated Plasticity by Xi Chen, Kok Kwang Phoon

    Published 2012-01-01
    “…One solution scheme results in the nonsymmetric linear equations due to the Newton iteration, while the other leads to the symmetric linear systems due to the symmetrized stiffness strategies. …”
    Get full text
    Article
  3. 883

    Scalable Alternating Projection and Proximal Splitting for Array Pattern Synthesis by Yubing Han, Chuan Wan

    Published 2015-01-01
    “…Then the scalable pattern projection and iterative procedure for optimum pattern scaling factor are studied in detail. …”
    Get full text
    Article
  4. 884

    StrideHD: A Binary Hyperdimensional Computing System Utilizing Window Striding for Image Classification by Dehua Liang, Jun Shiomi, Noriyuki Miura, Hiromitsu Awano

    Published 2024-01-01
    “…Under the same inference memory cost, our single-pass mode StrideHD averagely achieves 13.56% accuracy improvement in comparison with the single-pass baseline HD, which is a similar performance even in comparison with the costly iterative baseline HD models. As an extension, the iterative retraining mode of StrideHD averagely provides 11.33% accuracy improvement to its single-pass mode, which can be accomplished in fewer iterations in comparison with the baseline HD algorithms. …”
    Get full text
    Article
  5. 885

    A Numerical Algorithm for a Kirchhoff-Type Nonlinear Static Beam by Jemal Peradze

    Published 2009-01-01
    “…An approximate solution is found using the Galerkin method and the Jacobi nonlinear iteration process. A theorem on the algorithm error is proved.…”
    Get full text
    Article
  6. 886

    Bound-State Solution of s-Wave Klein-Gordon Equation for Woods-Saxon Potential by Eser Olğar, Haydar Mutaf

    Published 2015-01-01
    “…The bound-state solution of s-wave Klein-Gordon equation is calculated for Woods-Saxon potential by using the asymptotic iteration method (AIM). The energy eigenvalues and eigenfunctions are obtained for the required condition of bound-state solutions.…”
    Get full text
    Article
  7. 887

    Traveling Waves in the Underdamped Frenkel–Kontorova Model by Hengyan Li, Shaowei Liu

    Published 2018-01-01
    “…By using Nash–Moser iteration scheme, we prove that such model has a family of smooth traveling wave solutions.…”
    Get full text
    Article
  8. 888

    On the Numerical Solution of Differential-Algebraic Equations with Hessenberg Index-3 by Melike Karta, Ercan Çelik

    Published 2012-01-01
    “…Numerical solution of differential-algebraic equations with Hessenberg index-3 is considered by variational iteration method. We applied this method to two examples, and solutions have been compared with those obtained by exact solutions.…”
    Get full text
    Article
  9. 889

    Size Optimization Design of 3T1R Parallel Mechanism based on Workspace by Liu Zhenkun, Luo Yufeng, Shi Zhixin, Xia Yongqiang, Xie Dongfu

    Published 2018-01-01
    “…An iterative rapid search algorithm of spherical coordinate variable step size is used to analyze the reachable workspace of a 3 T1 R parallel mechanism. …”
    Get full text
    Article
  10. 890

    Blind equalization algorithm based on complex support vector regression by Ling YANG, Liang CHEN, Bin ZHAO, Guolong ZHANG, Yuan LI

    Published 2019-10-01
    “…A new blind equalization algorithm for complex valued signals was proposed based on the framework of complex support vector regression(CSVR).In the proposed algorithm,the error function of multi-modulus algorithm (MMA) was substituted into CSVR to construct the cost function,and the regression relationship was established by widely linear estimation,and the equalizer coefficients were determined by the iterative re-weighted least square (IRWLS) method.Different from spliting the complex valued signals into real valued signals used in support vector regression,the Wirtinger’s calculus was used in complex support vector regression to analyze the complex signals directly in the complex regenerative kernel Hilbert space.Simulation experiments show that for QPSK modulated signals,compared with the blind equalization algorithm based on support vector regression,the equalization performance of the proposed algorithm is significantly improved in linear channel and nonlinear channel by choosing appropriate kernel function and iterative optimization method.…”
    Get full text
    Article
  11. 891

    FSE-RBFNN-Based AILC of Finite Time Complete Tracking for a Class of Time-Varying NPNL Systems with Initial State Errors by Chunli Zhang, Lei Yan, Yangjie Gao

    Published 2024-01-01
    “…The paper proposed an adaptive iterative learning control (AILC) strategy for the unmatched uncertain time-varying nonparameterized nonlinear systems (NPNL systems). …”
    Get full text
    Article
  12. 892

    METHOD OF FIRST-ORDER APPROXIMATIONS OF INTER FORCE FOR STRUCTURAL TOPOLOGY OPTIMIZATION WITH STRESS CONSTRAINTS by PENG XiRong, SUI YunKang

    Published 2016-01-01
    “…The results of the topology optimization show that the first-order approximate of internal force is better than full stress method and the first-order approximation of stress with reciprocal variable. The number of iterations is the least. The solution efficiency is the highest. …”
    Get full text
    Article
  13. 893

    A Novel Approach with Comparative Computational Simulation of Analytical Solutions of Fractional Order Volterra Type Integral Equations by Javed Iqbal, Khurram Shabbir, Liliana Guran, Homan Emadifer

    Published 2024-01-01
    “…The main purpose of this article is to reconsider the theory of variational iteration method and embed it with Laplace transform to construct the conjoined technique variational iteration Laplace transform method. …”
    Get full text
    Article
  14. 894

    Adaptive clustering federated learning via similarity acceleration by Suxia ZHU, Binke GU, Guanglu SUN

    Published 2024-03-01
    “…In order to solve the problem of model performance degradation caused by data heterogeneity in the federated learning process, it is necessary to consider personalizing in the federated model.A new adaptively clustering federated learning (ACFL) algorithm via similarity acceleration was proposed, achieving adaptive acceleration clustering based on geometric properties of local updates and the positive feedback mechanism during clients federated training.By dividing clients into different task clusters, clients with similar data distribution in the same cluster was cooperated to improve the performance of federated model.It did not need to determine the number of clusters in advance and iteratively divide the clients, so as to avoid the problems of high computational cost and slow convergence speed in the existing clustering federation methods while ensuring the performance of models.The effectiveness of ACFL was verified by using deep convolutional neural networks on commonly used datasets.The results show that the performance of ACFL is comparable to the clustered federated learning (CFL) algorithm, it is better than the traditional iterative federated cluster algorithm (IFCA), and has faster convergence speed.…”
    Get full text
    Article
  15. 895

    Pattern synthesis method for arbitrary arrays with desired mainloble response by Dian-fei PAN, Nai-ping CHENG

    Published 2014-09-01
    “…A pattern synthesis method based on adaptive array theory and convex optimization principle was proposed for arbitrary arrays,especially considering the influence of different orientation on array pattern.Firstly,the array pattern with special sideloble shape is obtained by adaptive array theory method; and then,the mainloble pointing to 0° is taken as reference to determine the pattern mainloble with variant steering angle.Finally,the optimal array pattern synthesis with desired mainloble response is converted to a second-order cone programming problem.The resulting optimization problem is nonconvex and is implemented via iterative algorithms of convex optimization,which can be solved using the second-order cone programming method at each iteration.Taking the method developed can obtain satisfied mainlobe response and less synthesized error in sideloble region.Theoretical analyses and simulation results show that the synthe-sized pattern has the same mainloble performance as the desired mainlabole in different orientation,and also the sideloble can maintain the shape to suppress the dynamic interference.…”
    Get full text
    Article
  16. 896

    Forward Position Solution of Redundantly Constrained Cable-driven Parallel Robot by Tao Ye, Zhang Shangying, Wang Yanwei

    Published 2020-07-01
    “…The nonlinear equations of forward kinematics are established,and the original pose of the end effector is taken as the iterative initial value to solve the forward position solution problem by applying the proposed algorithm. …”
    Get full text
    Article
  17. 897

    ADAPTIVE GROWTH TECHNIQUE OF TRUSS STRUCTURE BASED ON MMA by HUA Min, DING XiaoHong, WU ChunPing

    Published 2019-01-01
    “…The existing adaptive growth technique deducted the optimization iteration formula according to the condition named Karush-Kuhn-Tucker condition. …”
    Get full text
    Article
  18. 898

    Divergence correction for three-dimensional magnetotelluric forward modelling with arbitrary electrical anisotropy by Guo Yu, Jing Han

    Published 2025-01-01
    “…The method accelerates the convergence of iterative solvers in solving forward equations in anisotropic media. …”
    Get full text
    Article
  19. 899

    Fuzzy co-clustering algorithm for high-order heterogeneous data by Shao-bin HUANG, Xin-xin YANG, Lin-shan SHEN, Yan-mei LI

    Published 2014-06-01
    “…The update rules for fuzzy memberships of objects and weights of features were derived, and then an iterative algorithm was designed for the clus-tering process. …”
    Get full text
    Article
  20. 900

    Lightweight detection system of shared spam attacks by Shao-qing LV, Dan FAN, Yu-qing ZHANG

    Published 2015-07-01
    “…Spam is one of the most serious attacks against online social networks (OSN).Recently a new type of spam attack occurs,which named shared spam attack.The shared spam attack can separate the storage and dissemination of spam content,making the existing detection systems no longer effective.To address this problem,an empirical analysis of the process and properties of this new spam attack is performed.A novel lightweight iterative detection algorithm (LIDA) is proposed to detect spam accounts in OSN with these properties.LIDA contains two steps:target filter and content detection.It also noteworthy that LIDA is a lightweight algorithm to infer more spam accounts by exploiting spam accounts’ sharing instead of scanning or analyzing all accounts.Experimental results in RenRen,which has successfully detected 9 568 spam accounts,30 732 spam albums and 2 626 780 spam URL in four round iterations,indicate that LIDA is effective and efficiency in detecting shared spam accounts.…”
    Get full text
    Article