A Control-Theoretic Approach to the Design of Zero Finding Numerical Methods

DOI10.1109/TAC.2007.899109MaRDI QIDQ5282142zbMATH OpenOpenAlexFDO

Authors Amit Bhaya, Eugenius Kaszkurewicz

Publication date 27 July 2017

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tac.2007.899109

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Cited in

(12)

• A proportional-derivative control strategy for restarting the GMRES(\(m\)) algorithm
• State estimation and reconstruction of unknown inputs with arbitrary relative degree via a predefined-time algebraic solver
• Cooperative concurrent asynchronous computation of the solution of symmetric linear systems
• On the robustness of numerical algorithms for linear systems and signal processing in finite precision arithmetic
• Continuous and discrete Zhang dynamics for real-time varying nonlinear optimization
• A vector regularization method to solve linear inverse problems
• A control-theoretic study on iterative solutions to nonlinear equations for applications in embedded systems
• Sliding mode control: a survey with applications in math
• An adaptive gradient-descent-based neural networks for the on-line solution of linear time variant equations and its applications
• Control-theoretic methods for solving linear algebraic equations: a continuous-time perspective
• Distributed algorithms for solving linear algebraic equations: an optimal control perspective
• A numerical study of basins of attraction of zero-finding neural nets designed using control theory

This page was built for publication: A Control-Theoretic Approach to the Design of Zero Finding Numerical Methods

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