Abstract

A second-order learning algorithm based on differential geometry is used to numerically solve the linear matrix equation Q=x+∑i=1mAiTxAi−∑i=1nBiTxBi. An extended Hamiltonian algorithm is proposed based on the manifold of symmetric positive definite matrices. The algorithm is compared with traditional coupled fixed-point algorithm. Numerical experiments illustrate that the convergence speed of the provided algorithm is faster than that of the coupled fixed-point algorithm.

Full Text
Published version (Free)

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 call