An algorithm with randomly varying truncation for adaptive beam-formers

DOI10.1007/BF01895766MaRDI QIDQ1084780zbMATH OpenOpenAlexFDO

Authors Yunmin Zhu

Publication date 1986

Published in Applied Mathematics and Mechanics. (English Edition) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01895766

zbMATH Keywords

beam-formersglobal convergence almost everywhererandomly varying truncation

Mathematics Subject Classification ID

Strong limit theorems (60F15) Special processes (60K99) Inference from stochastic processes (62M99)

Review text

A recursive algorithm with randomly varying truncation for adaptive beam- formers is proposed. Simple conditions are obtained to guarantee for this algorithm the global convergence almost everywhere.

Cites work

• scientific article; zbMATH DE number 3782352 (Why is no real title available?)
• Stochastic approximation methods for constrained and unconstrained systems

Cited in

(1)

• Asymptotic properties of an adaptive beam former algorithm

This page was built for publication: An algorithm with randomly varying truncation for adaptive beam-formers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1084780)