scholarly journals Progressive Iterative Approximation with Preconditioners

Mathematics ◽  
2020 ◽  
Vol 8 (9) ◽  
pp. 1503
Author(s):  
Chengzhi Liu ◽  
Zhongyun Liu
Keyword(s):  
Computational Complexity ◽  
Convergence Rate ◽  
Iterative Methods ◽  
State Of The Art ◽  
Numerical Results ◽  
Iterative Approximation ◽  
Totally Positive ◽  
Positive Bases ◽  
Curve And Surface Fitting ◽  
Methods Numerical

The progressive iterative approximation (PIA) plays an important role in curve and surface fitting. By using the diagonally compensated reduction of the collocation matrix, we propose the preconditioned progressive iterative approximation (PPIA) to improve the convergence rate of PIA. For most of the normalized totally positive bases, we show that the presented PPIA can accelerate the convergence rate significantly in comparison with the weighted progressive iteration approximation (WPIA) and the progressive iterative approximation with different weights (DWPIA). Furthermore, we propose an inexact variant of the PPIA (IPPIA) to reduce the computational complexity of the PPIA. We introduce the inexact solver of the preconditioning system by employing some state-of-the-art iterative methods. Numerical results show that both the PPIA and the IPPIA converge faster than the WPIA and DWPIA, while the elapsed CPU times of the PPIA and IPPIA are less than those of the WPIA and DWPIA.

scholarly journals A Modified SSOR Preconditioning Strategy for Helmholtz Equations

2012 ◽  
Vol 2012 ◽  
pp. 1-9 ◽  
Author(s):  
Shi-Liang Wu ◽  
Cui-Xia Li
Keyword(s):  
Convergence Rate ◽  
Linear Systems ◽  
Iterative Methods ◽  
Low Cost ◽  
Computational Cost ◽  
Coefficient Matrix ◽  
Computational Time ◽  
Helmholtz Equations ◽  
Speed Up ◽  
Methods Numerical

The finite difference method discretization of Helmholtz equations usually leads to the large spare linear systems. Since the coefficient matrix is frequently indefinite, it is difficult to solve iteratively. In this paper, a modified symmetric successive overrelaxation (MSSOR) preconditioning strategy is constructed based on the coefficient matrix and employed to speed up the convergence rate of iterative methods. The idea is to increase the values of diagonal elements of the coefficient matrix to obtain better preconditioners for the original linear systems. Compared with SSOR preconditioner, MSSOR preconditioner has no additional computational cost to improve the convergence rate of iterative methods. Numerical results demonstrate that this method can reduce both the number of iterations and the computational time significantly with low cost for construction and implementation of preconditioners.

scholarly journals Multiple particle filtering for tracking wireless agents via Monte Carlo likelihood approximation

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Stephan Schlupkothen ◽  
Gerd Ascheid
Keyword(s):  
Monte Carlo ◽  
Computational Complexity ◽  
Particle Filtering ◽  
Gaussian Approximation ◽  
State Of The Art ◽  
Approximation Techniques ◽  
Accurate Localization ◽  
Likelihood Approximation ◽  
Current State ◽  
Multiple Particle

Abstract The localization of multiple wireless agents via, for example, distance and/or bearing measurements is challenging, particularly if relying on beacon-to-agent measurements alone is insufficient to guarantee accurate localization. In these cases, agent-to-agent measurements also need to be considered to improve the localization quality. In the context of particle filtering, the computational complexity of tracking many wireless agents is high when relying on conventional schemes. This is because in such schemes, all agents’ states are estimated simultaneously using a single filter. To overcome this problem, the concept of multiple particle filtering (MPF), in which an individual filter is used for each agent, has been proposed in the literature. However, due to the necessity of considering agent-to-agent measurements, additional effort is required to derive information on each individual filter from the available likelihoods. This is necessary because the distance and bearing measurements naturally depend on the states of two agents, which, in MPF, are estimated by two separate filters. Because the required likelihood cannot be analytically derived in general, an approximation is needed. To this end, this work extends current state-of-the-art likelihood approximation techniques based on Gaussian approximation under the assumption that the number of agents to be tracked is fixed and known. Moreover, a novel likelihood approximation method is proposed that enables efficient and accurate tracking. The simulations show that the proposed method achieves up to 22% higher accuracy with the same computational complexity as that of existing methods. Thus, efficient and accurate tracking of wireless agents is achieved.

scholarly journals Modified Filtered-X Hierarchical LMS Algorithm with Sequential Partial Updates for Active Noise Control

2020 ◽  
Vol 11 (1) ◽  
pp. 344
Author(s):  
Pedro Ramos Lorente ◽  
Raúl Martín Ferrer ◽  
Fernando Arranz Martínez ◽  
Guillermo Palacios-Navarro
Keyword(s):  
Computational Complexity ◽  
Convergence Rate ◽  
Noise Control ◽  
Active Noise Control ◽  
Adaptive Strategy ◽  
Lms Algorithm ◽  
Step Size ◽  
Periodic Disturbances ◽  
Active Noise ◽  
Dependent Parameter

In the field of active noise control (ANC), a popular method is the modified filtered-x LMS algorithm. However, it has two drawbacks: its computational complexity higher than that of the conventional FxLMS, and its convergence rate that could still be improved. Therefore, we propose an adaptive strategy which aims at speeding up the convergence rate of an ANC system dealing with periodic disturbances. This algorithm consists in combining the organization of the filter weights in a hierarchy of subfilters of shorter length and their sequential partial updates (PU). Our contribution is threefold: (1) we provide the theoretical basis of the existence of a frequency-dependent parameter, called gain in step-size. (2) The theoretical upper bound of the step-size is compared with the limit obtained from simulations. (3) Additional experiments show that this strategy results in a fast algorithm with a computational complexity close to that of the conventional FxLMS.

Solving Mono- and Multi-Objective Problems Using Hybrid Evolutionary Algorithms and Nelder-Mead Method

2021 ◽  
Vol 12 (4) ◽  
pp. 98-116
Author(s):  
Noureddine Boukhari ◽  
Fatima Debbat ◽  
Nicolas Monmarché ◽  
Mohamed Slimane
Keyword(s):  
Convergence Rate ◽  
Optimization Problem ◽  
Optimization Problems ◽  
State Of The Art ◽  
Hybrid Approach ◽  
Optimization Methods ◽  
Global Optimum ◽  
Stochastic Methods ◽  
Local Optima ◽  
Portfolio Optimization Problem

Evolution strategies (ES) are a family of strong stochastic methods for global optimization and have proved their capability in avoiding local optima more than other optimization methods. Many researchers have investigated different versions of the original evolution strategy with good results in a variety of optimization problems. However, the convergence rate of the algorithm to the global optimum stays asymptotic. In order to accelerate the convergence rate, a hybrid approach is proposed using the nonlinear simplex method (Nelder-Mead) and an adaptive scheme to control the local search application, and the authors demonstrate that such combination yields significantly better convergence. The new proposed method has been tested on 15 complex benchmark functions and applied to the bi-objective portfolio optimization problem and compared with other state-of-the-art techniques. Experimental results show that the performance is improved by this hybridization in terms of solution eminence and strong convergence.

scholarly journals CONVERGENCE OF COMONOTONE HISTOPOLATING SPLINES

2015 ◽  
Vol 20 (1) ◽  
pp. 124-138 ◽  
Author(s):  
Helle Hallik ◽  
Peeter Oja
Keyword(s):  
Convergence Rate ◽  
Finite Number ◽  
Numerical Results ◽  
Quadratic Polynomial

The convergence rate of histopolation on an interval with combined splines of class C1 having linear/linear rational or quadratic polynomial pieces is studied. The function to histopolate may have finite number of derivative zeros and established convergence rate depends mainly on the behaviour of the derivative near its zeros. Given numerical results are completely consistent with theoretical ones.

scholarly journals User-independent accelerometer-based gesture recognition for mobile devices

2013 ◽  
Vol 1 (3) ◽  
pp. 11-25 ◽  
Author(s):  
Xian Wang ◽  
Paula Tarrío ◽  
Ana María Bernardos ◽  
Eduardo Metola ◽  
José Ramón Casar
Keyword(s):  
Computational Complexity ◽  
Mobile Devices ◽  
Gesture Recognition ◽  
Inertial Sensors ◽  
Recognition Accuracy ◽  
State Of The Art ◽  
Smart Phone ◽  
Recognition System ◽  
Independent Manner ◽  
Wheeled Robot

Many mobile devices embed nowadays inertial sensors. This enables new forms of human-computer interaction through the use of gestures (movements performed with the mobile device) as a way of communication. This paper presents an accelerometer-based gesture recognition system for mobile devices which is able to recognize a collection of 10 different hand gestures. The system was conceived to be light and to operate in a user-independent manner in real time. The recognition system was implemented in a smart phone and evaluated through a collection of user tests, which showed a recognition accuracy similar to other state-of-the art techniques and a lower computational complexity. The system was also used to build a human-robot interface that enables controlling a wheeled robot with the gestures made with the mobile phone

scholarly journals Optimization Learning: Perspective, Method, and Applications

2020 ◽  
Author(s):  
Risheng Liu
Keyword(s):  
Inverse Problems ◽  
Theoretical Analysis ◽  
Iterative Methods ◽  
State Of The Art ◽  
Learning Paradigm ◽  
Rigorous Analysis ◽  
The Core ◽  
Globally Convergent ◽  
Ill Posed ◽  
Art Performance

Numerous tasks at the core of statistics, learning, and vision areas are specific cases of ill-posed inverse problems. Recently, learning-based (e.g., deep) iterative methods have been empirically shown to be useful for these problems. Nevertheless, integrating learnable structures into iterations is still a laborious process, which can only be guided by intuitions or empirical insights. Moreover, there is a lack of rigorous analysis of the convergence behaviors of these reimplemented iterations, and thus the significance of such methods is a little bit vague. We move beyond these limits and propose a theoretically guaranteed optimization learning paradigm, a generic and provable paradigm for nonconvex inverse problems, and develop a series of convergent deep models. Our theoretical analysis reveals that the proposed optimization learning paradigm allows us to generate globally convergent trajectories for learning-based iterative methods. Thanks to the superiority of our framework, we achieve state-of-the-art performance on different real applications.

scholarly journals Numerical methods for kinetic equations

Acta Numerica ◽  
2014 ◽  
Vol 23 ◽  
pp. 369-520 ◽  
Author(s):  
G. Dimarco ◽  
L. Pareschi
Keyword(s):  
Computational Complexity ◽  
Numerical Methods ◽  
State Of The Art ◽  
Kinetic Equations ◽  
Numerical Techniques ◽  
Asymptotic Preserving ◽  
Hybrid Schemes ◽  
Velocity Models ◽  
Current State ◽  
Number Of Particles

In this survey we consider the development and mathematical analysis of numerical methods for kinetic partial differential equations. Kinetic equations represent a way of describing the time evolution of a system consisting of a large number of particles. Due to the high number of dimensions and their intrinsic physical properties, the construction of numerical methods represents a challenge and requires a careful balance between accuracy and computational complexity. Here we review the basic numerical techniques for dealing with such equations, including the case of semi-Lagrangian methods, discrete-velocity models and spectral methods. In addition we give an overview of the current state of the art of numerical methods for kinetic equations. This covers the derivation of fast algorithms, the notion of asymptotic-preserving methods and the construction of hybrid schemes.

Computational Models of Bio Heuristics Based on Physical and Cognitive Processes (Review)

2021 ◽  
Vol 27 (11) ◽  
pp. 563-574
Author(s):  
V. V. Kureychik ◽  
◽  
S. I. Rodzin ◽  
Keyword(s):  
Computational Complexity ◽  
Convergence Rate ◽  
Rate Of Convergence ◽  
Cognitive Processes ◽  
Computational Models ◽  
Optimization Problems ◽  
Search Space ◽  
Experimental Results ◽  
Software Implementation ◽  
Minimum Total Length

Computational models of bio heuristics based on physical and cognitive processes are presented. Data on such characteristics of bio heuristics (including evolutionary and swarm bio heuristics) are compared.) such as the rate of convergence, computational complexity, the required amount of memory, the configuration of the algorithm parameters, the difficulties of software implementation. The balance between the convergence rate of bio heuristics and the diversification of the search space for solutions to optimization problems is estimated. Experimental results are presented for the problem of placing Peco graphs in a lattice with the minimum total length of the graph edges.

Sign in / Sign up

Export Citation Format

Share Document