The University of Southampton
University of Southampton Institutional Repository

A method of adaptation between steepest-descent and Newton's algorithm for multichannel active control of tonal noise and vibration

A method of adaptation between steepest-descent and Newton's algorithm for multichannel active control of tonal noise and vibration
A method of adaptation between steepest-descent and Newton's algorithm for multichannel active control of tonal noise and vibration
Active control methods have been applied to a number of practical problems in which it is necessary to control a tonal disturbance. For example, the control of engine noise and vibration in vehicles, propeller noise in aircraft and the vibration produced by reciprocating machinery in many industrial systems. In such applications the steepest-descent algorithm has been widely employed, in part due to its robustness to variations in the plant response. This robustness, however, comes at the expense of a potentially slow convergence speed and this may limit the performance in applications where the disturbance is non-stationary. To improve the speed of convergence, an iterative least-squares algorithm can be employed, such as Newton’s algorithm. The convergence of these algorithms is less dependent on the potentially large eigenvalue spread of a multichannel plant matrix and, therefore, can theoretically achieve more rapid convergence. However, these algorithms are significantly less robust to plant response variations and, therefore, their practical performance can be somewhat limited. Generalised algorithms have been presented which combine steepest-descent and Newton’s method in or- der to provide a fixed compromise between convergence and robustness. This paper presents a method of adaptively combining steepest-descent and Newton’s method in order to achieve both rapid convergence and robustness to plant response variations. The two algorithms are combined into a single update equation in which a single mixing parameter facilitates a trade-off between the two algorithms. A method of adapting this parameter to minimise the cost function is presented and the performance of the proposed algorithm is assessed through a series of simulations. The proposed combination algorithm is shown to improve the control performance in the presence of plant response variations compared to both the steepest-descent and Newton’s algorithms.
International Institute of Acoustics and Vibration
Cheer, Jordan
8e452f50-4c7d-4d4e-913a-34015e99b9dc
Daley, Stephen
53cef7f1-77fa-4a4c-9745-b6a0ba4f42e6
Cheer, Jordan
8e452f50-4c7d-4d4e-913a-34015e99b9dc
Daley, Stephen
53cef7f1-77fa-4a4c-9745-b6a0ba4f42e6

Cheer, Jordan and Daley, Stephen (2014) A method of adaptation between steepest-descent and Newton's algorithm for multichannel active control of tonal noise and vibration. In Proceedings of the 21st International Congress on Sound and Vibration. International Institute of Acoustics and Vibration. 8 pp .

Record type: Conference or Workshop Item (Paper)

Abstract

Active control methods have been applied to a number of practical problems in which it is necessary to control a tonal disturbance. For example, the control of engine noise and vibration in vehicles, propeller noise in aircraft and the vibration produced by reciprocating machinery in many industrial systems. In such applications the steepest-descent algorithm has been widely employed, in part due to its robustness to variations in the plant response. This robustness, however, comes at the expense of a potentially slow convergence speed and this may limit the performance in applications where the disturbance is non-stationary. To improve the speed of convergence, an iterative least-squares algorithm can be employed, such as Newton’s algorithm. The convergence of these algorithms is less dependent on the potentially large eigenvalue spread of a multichannel plant matrix and, therefore, can theoretically achieve more rapid convergence. However, these algorithms are significantly less robust to plant response variations and, therefore, their practical performance can be somewhat limited. Generalised algorithms have been presented which combine steepest-descent and Newton’s method in or- der to provide a fixed compromise between convergence and robustness. This paper presents a method of adaptively combining steepest-descent and Newton’s method in order to achieve both rapid convergence and robustness to plant response variations. The two algorithms are combined into a single update equation in which a single mixing parameter facilitates a trade-off between the two algorithms. A method of adapting this parameter to minimise the cost function is presented and the performance of the proposed algorithm is assessed through a series of simulations. The proposed combination algorithm is shown to improve the control performance in the presence of plant response variations compared to both the steepest-descent and Newton’s algorithms.

Text
Adaptation_between_steepest_descent_and_newtons_algorithm_for_multichannel_tonal_noise_and_Vibration.pdf - Author's Original
Download (853kB)

More information

Published date: 16 July 2014
Venue - Dates: 21st International Congress on Sound and Vibration, Beijing, Beijing, China, 2014-07-13 - 2014-07-17
Related URLs:
Organisations: Signal Processing & Control Grp

Identifiers

Local EPrints ID: 367245
URI: http://eprints.soton.ac.uk/id/eprint/367245
PURE UUID: 40e713a7-58c3-4ba3-acdb-4785c470be9e
ORCID for Jordan Cheer: ORCID iD orcid.org/0000-0002-0552-5506

Catalogue record

Date deposited: 25 Jul 2014 07:56
Last modified: 15 Mar 2024 03:37

Export record

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×