| Algorithm 555: Chow-Yorke Algorithm for Fixed Points or Zeros of C2 Maps [C5] |
| Full text |
Pdf
(429 KB)
|
| Source
|
ACM Transactions on Mathematical Software (TOMS)
archive
Volume 6 , Issue 2 (June 1980)
table of contents
Pages: 252 - 259
Year of Publication: 1980
ISSN:0098-3500
|
|
Authors
|
|
Layne T. Watson
|
Department of Computer Science, Virginia Polytechnic Institute, Blacksburg, VA
|
|
Dan Fenner
|
Johns Hopkins Applied Physics Laboratory, Johns Hopkins Road, Laurel, MD
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 2, Downloads (12 Months): 30, Citation Count: 7
|
|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
BOGGS, P. The solution of nonlinear systems of equations by A-stable integration techmques. SIAM J. Numer. Anal 8 (1971), 767-785.
|
| |
2
|
BUSlNGER, P, AND GOLUB, G.H Linear least squares solutions by Householder transformations. Nurner. Math. 7 (1965), 269-276.
|
| |
3
|
CHOW, S.N., MALLET-PARET, J, AND YORKE, J.A. Finding zeros of maps: Homotopy methods that are constructive with probability one. Math Comput. 32 (1978), 887-899.
|
| |
4
|
|
| |
5
|
EAVES, B.C. Homotoples for the computation of fixed points. Math. Program. 3 (1972), 1-22.
|
| |
6
|
EAVES, B.C., AND SAmAL, R. Homotopies for computation of fixed points on unbounded regmns. Math. Program 3 (1972), 225-237.
|
| |
7
|
KELLER, H.B Numerical solution of bifurcation and nonlinear elgenvalue problems. In Appli. catmns of B~furcatzon Theory. Academm Press, New York, 1977.
|
| |
8
|
KELLOGG, R.B., LI, T.Y., AND YORKE, J. A constructive proof of the Brouwer fLxed-point theorem and computational results. SIAM J. Numer. Anal. 13 (1976), 473-483.
|
 |
9
|
|
 |
10
|
|
| |
11
|
|
| |
12
|
SHAMPIN~, L.F, AND GORDON, M.K. Computer Solution of Ordinary D~fferentml Equatmns The Initial Value Problem. Freeman, San Francisco, 1975.
|
| |
13
|
WATSON, L.T. A globally convergent algorithm for computing fixed points of C2 maps. Appl. Math. Cornput. 5 (1979), 297-311.
|
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen
, Daniel D. Gajski
|