Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
A Natural Gradient Descent Algorithm for the Solution of Lyapunov Equations Based on the Geodesic Distance
View through CrossRef
A new framework based on the curved Riemannian manifold is proposed to calculate the numerical solution of the Lyapunov matrix equation by using a natural gradient descent algorithm and taking the geodesic distance as the objective function. Moreover, a gradient descent algorithm based on the classical Euclidean distance is provided to compare with this natural gradient descent algorithm. Furthermore, the behaviors of two proposed algorithms and the conventional modified conjugate gradient algorithm are compared and demonstrated by two simulation examples. By comparison, it is shown that the convergence speed of the natural gradient descent algorithm is faster than both of the gradient descent algorithm and the conventional modified conjugate gradient algorithm in solving the Lyapunov equation.
Global Science Press
Title: A Natural Gradient Descent Algorithm for the Solution of Lyapunov Equations Based on the Geodesic Distance
Description:
A new framework based on the curved Riemannian manifold is proposed to calculate the numerical solution of the Lyapunov matrix equation by using a natural gradient descent algorithm and taking the geodesic distance as the objective function.
Moreover, a gradient descent algorithm based on the classical Euclidean distance is provided to compare with this natural gradient descent algorithm.
Furthermore, the behaviors of two proposed algorithms and the conventional modified conjugate gradient algorithm are compared and demonstrated by two simulation examples.
By comparison, it is shown that the convergence speed of the natural gradient descent algorithm is faster than both of the gradient descent algorithm and the conventional modified conjugate gradient algorithm in solving the Lyapunov equation.
Related Results
The Geodesic Edge Center of a Simple Polygon
The Geodesic Edge Center of a Simple Polygon
Abstract
The geodesic edge center of a simple polygon is a point c inside the polygon that minimizes the maximum geodesic distance from c to any edge of the polygon, wher...
Scaling and interleaving of subsystem Lyapunov exponents for spatio-temporal systems
Scaling and interleaving of subsystem Lyapunov exponents for spatio-temporal systems
The computation of the entire Lyapunov spectrum for extended dynamical systems is a very time consuming task. If the system is in a chaotic spatio-temporal regime it is possible to...
Comparing Functional Connectivity Matrices: A Geometry-Aware Approach applied to Participant Identification
Comparing Functional Connectivity Matrices: A Geometry-Aware Approach applied to Participant Identification
Abstract
Understanding the correlation structure associated with multiple brain measurements informs about potential “functional groupings” and n...
Mathematics in Chemical Engineering
Mathematics in Chemical Engineering
Abstract
The article contains sections titled:
...
An Improved Method In Speech Signal Input Representation Based On DTW Technique For NN Speech Recognition System
An Improved Method In Speech Signal Input Representation Based On DTW Technique For NN Speech Recognition System
Kertas kerja ini membentangkan pemprosesan semula ciri pertuturan pemalar Pengekodan Ramalan Linear (LPC) bagi menyediakan template rujukan yang boleh diharapkan untuk set perkataa...
Interactive Music Distance Education Platform Based on RBF Algorithm
Interactive Music Distance Education Platform Based on RBF Algorithm
INTRODUCTION: Since the 21st century, Internet technology has been developing rapidly, and the field of education has gradually broken through the traditional offline teaching mode...
The geodesic dynamic relaxation method for problems of equilibrium with equality constraint conditions
The geodesic dynamic relaxation method for problems of equilibrium with equality constraint conditions
SUMMARYThis paper presents an extension to the existing dynamic relaxation method to include equality constraint conditions in the process. The existing dynamic relaxation method i...
SPGD: Search Party Gradient Descent Algorithm, a Simple Gradient-Based Parallel Algorithm for Bound-Constrained Optimization
SPGD: Search Party Gradient Descent Algorithm, a Simple Gradient-Based Parallel Algorithm for Bound-Constrained Optimization
Nature-inspired metaheuristic algorithms remain a strong trend in optimization. Human-inspired optimization algorithms should be more intuitive and relatable. This paper proposes a...