Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Irani, Kashmira M."'
Autor:
Irani, Kashmira M.
There are algorithms for finding zeros or fixed points of nonlinear systems of equations that are globally convergent for almost all starting points, i.e., with probability one. The essence of all such algorithms is the construction of an appropriate
Externí odkaz:
http://hdl.handle.net/10919/41971
http://scholar.lib.vt.edu/theses/available/etd-04082009-040342/
http://scholar.lib.vt.edu/theses/available/etd-04082009-040342/
Homotopy algorithms are a class of methods for solving systems of nonlinear equations that are globally convergent with probability one. All homotopy algorithms are based on the construction of an appropriate homotopy map and then the tracking of a c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2485::c79ec4734e2978efa5e3f5c1c289801b
https://hdl.handle.net/10919/19711
https://hdl.handle.net/10919/19711
Results are reported for a series of experiments involving numerical curve tracking on a shared memory parallel computer. Several algorithms exist for finding zeros or fixed points of nonlinear systems of equations that are globally convergent for al
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2485::6d91062a079875b6f4a4158bfc80699c
https://hdl.handle.net/10919/19687
https://hdl.handle.net/10919/19687
Autor:
Irani, Kashmira M., Kamat, Manohar P., Ribbens, Calvin J., Walker, Homer F., Watson, Layne T.
There are algorithms for finding zeros or fixed points of nonlinear systems of equations that are globally convergent for almost all starting points, i.e., with probability one. The essence of all such algorithms is the construction of an appropriate
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2485::15011154dfabcb61ed7ea84cdeb8ec5d
http://eprints.cs.vt.edu/archive/00000217/
http://eprints.cs.vt.edu/archive/00000217/
Autor:
Irani, Kashmira M., Ribbens, Calvin J., Walker, Homer F., Watson, Layne T., Kamat, Manohar P.
These are alogorithms for finding zeros or fixed points of nonlinear systems of equations that are globally convergent for almost all starting points, i.e., with probability one. The essence of all such algorithms is the construction of an appropriat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2485::58fdfdf0ef6c86aa92f5e8d813937d28
https://hdl.handle.net/10919/19533
https://hdl.handle.net/10919/19533
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.