Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • AMS(MOS): 65F10, 65N30  (1)
  • Recursive least squares  (1)
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Mathematics of control, signals, and systems 5 (1992), S. 23-39 
    ISSN: 1435-568X
    Keywords: Adaptive algorithms ; Condition estimation ; Recursive least squares ; Signal processing ; Singular values
    Source: Springer Online Journal Archives 1860-2000
    Topics: Electrical Engineering, Measurement and Control Technology , Mathematics , Technology
    Notes: Abstract We apply a fast adaptive condition estimation scheme, calledACE, to recursive least squares (RLS) computations in signal processing.ACE is fast in the sense that onlyO(n) operations are required forn parameter problems, and is adaptive over time, i.e., estimates at timet are used to produce estimates at timet + 1. RLS algorithms for linear prediction of time series are applied in various fields of signal processing: identification, estimation, and control. However, RLS algorithms are known to suffer from numerical instability problems under finite word-length conditions, due to ill-conditioning. We apply adaptive procedures, linear in the order of the problem, for accurately tracking relevant extreme eigen-values or singular values and the associated condition numbers over timet. In this paper exponentially weighted data windows are considered. The sliding data window case, which involves downdating as well as updating, is considered else-where. Numerical experiments indicate thatACE yields an accurate, yet inexpensive, RLS condition estimator for signal processing applications.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 57 (1990), S. 625-633 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65F10, 65N30 ; CR: G1.3, G1.8
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary The topic of iterative substructuring methods, and more generally domain decomposition methods, has been extensively studied over the past few years, and the topic is well advanced with respect to first and second order elliptic problems. However, relatively little work has been done on more general constrained least squares problems (or equivalent formulations) involving equilibrium equations such as those arising, for example, in realistic structural analysis applications. The potential is good for effective use of iterative algorithms on these problems, but such methods are still far from being competitive with direct methods in industrial codes. The purpose of this paper is to investigate an order reducing, preconditioned conjugate gradient method proposed by Barlow, Nichols and Plemmons for solving problems of this type. The relationships between this method and nullspace methods, such as the force method for structures and the dual variable method for fluids, are examined. Convergence properties are discussed in relation to recent optimality results for Varga's theory ofp-cyclic SOR. We suggest a mixed approach for solving equilibrium equations, consisting of both direct reduction in the substructures and the conjugate gradient iterative algorithm to complete the computations.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...