An analog scheme for fixed-point computation-Part II: Applications

DOI10.1109/81.754845MaRDI QIDQ4505183zbMATH OpenOpenAlexFDO

Authors K. Soumyanath, Vivek Borkar

Publication date 26 September 2000

Published in IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

Markov chaincombinatorial optimizationdynamic programmingnonlinear programmingexponential convergencesystems of linear equationsfixed-point computationanalog networksingle source shortest path problemnetwork flow computations

Mathematics Subject Classification ID

Numerical analysis or methods applied to Markov chains (65C40) Numerical mathematical programming methods (65K05) Dynamic programming (90C39) Numerical computation of solutions to systems of equations (65H10)

Recommendations

• Solving the shortest path problem using an analog network
• Neural networks for solving systems of linear equations and related problems
• Analog circuit for solving assignment problems
• A discrete-time recurrent neural network for shortest-path routing
• Fast linear system solution by neural networks

Cited in

(10)

• Time-mode circuits for analog computation
• Managing interprocessor delays in distributed recursive algorithms
• Distributed computation of fixed points of \(\infty\)-nonexpansive maps
• Fixed-point attractors in analog neural computation
• An analog solution of programming problems
• Fixed-point calculation and error analysis of MLP neural network
• Solving the shortest path problem using an analog network
• Fixed Point Techniques in Analog Systems
• Optimal path finding with space‐ and time‐variant metric weights via multi‐layer CNN
• Analog circuit for solving assignment problems

This page was built for publication: An analog scheme for fixed-point computation-Part II: Applications

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