Abstract
The Hartley-type ( Ht) algebras are used to face efficiently the solution of structured linear systems and to define low complexity methods for solving general (nonstructured) nonlinear problems. Displacement formulas for the inverse of a symmetric Toeplitz matrix in terms of Ht transforms are compared with the well known Ammar–Gader formula. The LQN unconstrained optimization methods, which define Hessian approximations by updating n× n matrices from an algebra L , can be implemented for L=Ht with an O( n) amount of memory allocations and O( nlog n) arithmetic operations per step. The LQN methods with the lowest experimental rate of convergence are shown to be linearly convergent.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
