Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A modified orthogonal-descent algorithm for finding the zero of a complex function

From MaRDI portal
Publication:1333696
Jump to:navigation, search

DOI10.1007/BF01130091zbMath0925.65087MaRDI QIDQ1333696

I. A. Shubenkova, M. B. Shchepakin

Publication date: 5 October 1994

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)



Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)


Related Items (1)

Orthogonalizing linear operators in convex programming. I, II



Cites Work

  • Unnamed Item
  • Unnamed Item
  • An orthogonal descent algorithm to find the zero of a convex function, unsolvability test, and rate of convergence


This page was built for publication: A modified orthogonal-descent algorithm for finding the zero of a complex function

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1333696&oldid=13459993"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 12:56.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki