Nonlinear iterative methods and parallel computation
Applications of Mathematics, Tome 21 (1976) no. 4, pp. 252-262
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Nonlinear iterative methods are investigated and a generalization of a direct method for linear systems is presented which is suitable for parallel computation and for sparse occurrence matrices.
Nonlinear iterative methods are investigated and a generalization of a direct method for linear systems is presented which is suitable for parallel computation and for sparse occurrence matrices.
DOI : 10.21136/AM.1976.103645
Classification : 65H10, 65K05, 90C30
@article{10_21136_AM_1976_103645,
     author = {Sloboda, Fridrich},
     title = {Nonlinear iterative methods and parallel computation},
     journal = {Applications of Mathematics},
     pages = {252--262},
     year = {1976},
     volume = {21},
     number = {4},
     doi = {10.21136/AM.1976.103645},
     mrnumber = {0426411},
     zbl = {0356.65057},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/AM.1976.103645/}
}
TY  - JOUR
AU  - Sloboda, Fridrich
TI  - Nonlinear iterative methods and parallel computation
JO  - Applications of Mathematics
PY  - 1976
SP  - 252
EP  - 262
VL  - 21
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.21136/AM.1976.103645/
DO  - 10.21136/AM.1976.103645
LA  - en
ID  - 10_21136_AM_1976_103645
ER  - 
%0 Journal Article
%A Sloboda, Fridrich
%T Nonlinear iterative methods and parallel computation
%J Applications of Mathematics
%D 1976
%P 252-262
%V 21
%N 4
%U http://geodesic.mathdoc.fr/articles/10.21136/AM.1976.103645/
%R 10.21136/AM.1976.103645
%G en
%F 10_21136_AM_1976_103645
Sloboda, Fridrich. Nonlinear iterative methods and parallel computation. Applications of Mathematics, Tome 21 (1976) no. 4, pp. 252-262. doi: 10.21136/AM.1976.103645

[1] J. M. Ortega W. C. Rheinboldt: Iterative solution of nonlinear equations in several variables. AP, New York, 1970. | MR

[2] M. J. D. Powell: A survey of numerical methods for unconstrained optimization. SIAM Review, 1 (1970), 79-97. | DOI | MR | Zbl

[3] D. Chazan W. Miranker: A nongradient and parallel algorithm for unconstrained minimization. SIAM J. Control, 2 (1970), 207-217. | MR

[4] D. M. Himmelblau: Decomposition of large-scale problems. North-Holl. publ. соmр., New York, 1973. | MR | Zbl

[5] R. M. Karp W. L. Miranker: Parallel minimax search for a maximum. J. of Combinatioral Theory, 1 (1968), 19-35. | MR

[6] R. P. Brent: Algorithms for minimization without derivatives. Prentice-Hall, Englewood Cliffs, New Jersey, 1973. | MR | Zbl

[7] W. I. Zangwill: Minimizing a function without calculating derivatives. Соmр. J., 7 (1967), 293-296. | MR | Zbl

[8] M. J. D. Powell: An efficient method for finding minimum of a function of several variables without calculating derivatives. Compt. J., 7 (1964), 155- 162. | DOI | MR

[9] H. T. Kung J. F. Traub: On the efficiency of parallel iterative algorithms for non-linear equations. Symposium on complexity of sequential and parallel numerical algorithms, Cornegie-Mellon University, 1973. | MR

[10] W. Miranker: Parallel methods for approximating the root of a function. IBM J. of Research and Development, vol. 13, 1967, 297-301. | DOI | MR

[11] S. Winograd: Parallel iteration methods, Complexity of computer computations. R. E. Miller and J. W. Thatcher, Plenum Press, New York, 1972, 53 - 60. | MR

[12] N. Anderson A. Brörck: A new high order method of regula falsi type for computing a root of an equation. BIT, 13 (1973), 253-264. | DOI | MR

[13] F. Sloboda: A parallel projection method for linear algebraic systems. to appear. | MR | Zbl

[14] F. Sloboda: Parallel method of conjugate directions for minimization. Apl. mat. 6 (1975), 436-446. | MR | Zbl

Cité par Sources :