Curtin University Homepage
  • Library
  • Help
    • Admin

    espace - Curtin’s institutional repository

    JavaScript is disabled for your browser. Some features of this site may not work without it.
    View Item 
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item

    The CBFM-Enhanced Jacobi Method for Efficient Finite Antenna Array Analysis

    Access Status
    Fulltext not available
    Authors
    Ludick, D.
    Botha, M.
    Maaskant, R.
    Davidson, David
    Date
    2017
    Type
    Journal Article
    
    Metadata
    Show full item record
    Citation
    Ludick, D. and Botha, M. and Maaskant, R. and Davidson, D. 2017. The CBFM-Enhanced Jacobi Method for Efficient Finite Antenna Array Analysis. IEEE Antennas and Wireless Propagation Letters. 16: pp. 2700-2703.
    Source Title
    IEEE Antennas and Wireless Propagation Letters
    DOI
    10.1109/LAWP.2017.2742059
    ISSN
    1536-1225
    School
    Curtin Institute of Radio Astronomy (Engineering)
    URI
    http://hdl.handle.net/20.500.11937/72057
    Collection
    • Curtin Research Publications
    Abstract

    © 2017 IEEE. An enhancement to the iterative Jacobi technique with the characteristic basis function method is presented. The resulting method is intended for efficient method of moments (MoM)-based analysis of large, disjoint finite antenna arrays. The enhancement improves the convergence rate of the Jacobi method by better accounting for mutual coupling between array elements. This involves solving a small, global problem at each iterative step, using macrobasis functions that are iteratively generated. Results are presented, and it is found that the proposed method can recover fast convergence in cases where the Jacobi method diverges or converges slowly. The proposed method also converges significantly faster than a conventional, preconditioned, iterative solution of the MoM matrix equation.

    Related items

    Showing items related by title, author, creator and subject.

    • Robustness of convergence proofs in numerical methods in unconstrained optimization
      Goh, B.; Leong, W.; Teo, Kok Lay (2014)
      An iterative method to compute the minimum point in an unconstrained optimization problem can be viewed as a control system. Thus to achieve robust solutions it is desirable to have feedback solution rather than open ...
    • A New Algorithm of Geometric Mean for Solving High-Order Fredholm Integro-differential Equations
      Aruchunan, E.; Khajohnsaksumeth, N.; Wiwatanapataphee, Benchawan (2016)
      © 2016 IEEE.The Fredholm Integro-differential equations (IDEs) of the second kind appear in many scientific applications. Mathematical methods for the solution of the Fredholm IDEs have been developed over the last decade. ...
    • Partial Newton methods for a system of equations
      Goh, Bean; Leong, Wah; Siri, Zailan (2013)
      We define and analyse partial Newton iterations for the solutions of a system of algebraic equations. Firstly we focus on a linear system of equations which does not require a line search. To apply a partial Newton method ...
    Advanced search

    Browse

    Communities & CollectionsIssue DateAuthorTitleSubjectDocument TypeThis CollectionIssue DateAuthorTitleSubjectDocument Type

    My Account

    Admin

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    Follow Curtin

    • 
    • 
    • 
    • 
    • 

    CRICOS Provider Code: 00301JABN: 99 143 842 569TEQSA: PRV12158

    Copyright | Disclaimer | Privacy statement | Accessibility

    Curtin would like to pay respect to the Aboriginal and Torres Strait Islander members of our community by acknowledging the traditional owners of the land on which the Perth campus is located, the Whadjuk people of the Nyungar Nation; and on our Kalgoorlie campus, the Wongutha people of the North-Eastern Goldfields.