O algorytmie Kaczmarza

• Autorzy: Cegielski A.
• Języki publikacji: PL

Słowa kluczowe

PL

Kaczmarz Stefan; metoda Kaczmarza

• Wydawca: Polskie Towarzystwo Matematyczne
• Czasopismo: Wiadomości Matematyczne
• Rocznik: 2010
• Tom: T. 46, Nr 1
• Strony: 27--35
• Opis fizyczny: Bibliogr. 40 poz.

Twórcy

autor

Cegielski A.

• Wydział Matematyki, Informatyki i Ekonometrii, Uniwersytet Zielonogórski,

Bibliografia

• [1] S. Agmon, The relaxation method for linear inequalities, Canadian J. Math. 6 (1954), 382-392.
• [2] R. Ansorge, Connections between the Cimmino-method and the Kaczmarz--method for the solution of singular and regular systems of equations, Computing 33 (1984), no. 3-4, 367-375.
• [3] A. Auslender, Optimisation, Masson, Paris, 1976. Méthodes numériques; Maıtrise de Mathématiques et Applications Fondamentales.
• [4] H. H. Bauschke, J. M. Borwein, On projection algorithms for solving convex feasibility problems, SIAM Rev. 38 (1996), no. 3, 367-426.
• [5] M. Benzi, Gianfranco Cimmino's Contributions to Numerical Mathematics (2004). Technical Report.
• [6] E. Bodewig, Bericht über die verschiedenen Methoden zur L¨osung eines Systems linearer Gleichungen mit reellen Koeffizienten. IV, V, Nederl. Akad. Wetensch., Proc. 51 (1948), 53-64, 211-219.
• [7] F. E. Browder, Nonexpansive nonlinear operators in a Banach space, Proc. Nat. Acad. Sci. U.S.A. 54 (1965), 1041-1044.
• [8] D. Butnariu, Y. Censor, On the behavior of a block-iterative projection method for solving convex feasibility problems, Intern. J. Computer Math 34 (1990), 79-94.
• [9] C. Byrne, A unified treatment of some iterative algorithms in signal processing and image reconstruction, Inverse Problems 20 (2004), no. 1, 103-120.
• [10] A. Cegielski, Metody relaksacyjne w problemach optymalizacji wypukłej, Monografie, vol. 67, Wyzsza Szkoła Inzynierska w Zielonej Górze, Zielona Góra, 1993.
• [11] Y. Censor, Row-action methods for huge and sparse systems and their applications, SIAM Rev. 23 (1981), no. 4, 444-466.
• [12] Y. Censor, G. T. Herman, On some optimization techniques in image reconstruction from projections, Appl. Numer. Math. 3 (1987), no. 5, 365-391.
• [13] G. Cimmino, Calcolo approssimato per le soluzioni dei sistemi di equazioni lineari, La Ricerca Scientifica II 9 (1938), 326-333.
• [14] P. L. Combettes, Inconsistent Signal Feasibility Problem: Lest Square Solutions in a Product Space, IEEE Transactions on Signal Processing 42 (1994), 2955-2965.
• [15] A. R. De Pierro, A. N. Iusem, On the asymptotic behavior of some alternate smoothing series expansion iterative methods, Linear Algebra Appl. 130 (1990), 3-24.
• [16] S. D. Flam, J. Zowe, Relaxed outer projections, weighted averages and convex feasibility, BIT 30 (1990), no. 2, 289-300.
• [17] G. E. Forsythe, Solving linear algebraic equations can be interesting, Bull. Amer. Math. Soc. 59 (1953), 299-329.
• [18] K. Goebel, Twierdzenia o punktach stałych, Wydawnictwo UMCS, Lublin, 2005.
• [19] R. Gordon, R. Bender, G. T. Herman, Algebraic Reconstruction Techniques (ART) for three-dimensional electron microscopy and X-ray photography, Journal of Theoretical Biology 29 (1970), 471-481.
• [20] L. G. Gurin, B. T. Poljak, `E. V. Ra˘ık, Projection methods for finding a common point of convex sets, ˇZ. Vyˇcisl. Mat. i Mat. Fiz. 7 (1967), 1211-1228.
• [21] G. T. Herman, A relaxation method for reconstructing objects from noisy X-rays, Math. Programming 8 (1975), 1-19.
• [22] W. L. Hart, T. S. Motzkin, A composite Newton-Raphson gradient method for the solution of systems of equations, Pacific J. Math. 6 (1956), 691-707.
• [23] G. T. Herman, A. Lent, P. H. Lutz, Iterative relaxation methods for image reconstruction, Comm. ACM 21 (1978), no. 2, 152-158.
• [24] G. T. Herman, A. Lent, S. W. Rowland, ART: Mathematics and Applications. A report on the mathematical foundations and on the applicability to real data of the algebraic reconstruction techniques, J. Theor. Biol. 42 (1973), 1-32.
• [25] A. S. Householder, Some numerical methods for solving systems of linear equations, Amer. Math. Monthly 57 (1950), 453-459.
• [26] A. N. Iusem, A. R. De Pierro, Convergence results for an accelerated nonlinear Cimmino algorithm, Numer. Math. 49 (1986), no. 4, 367-378.
• [27] S. Kaczmarz, Angenährte Aufl¨osung von Systemen linearer Gleichungen (Przyblizone rozwiazywanie układów równan liniowych), Bull. Intern. Acad. Polonaise Sci. Lett., Cl. Sci. Math. Nat. A 35 (1937), 355-357. Tłumaczenie angielskie: Approximate solution of systems of linear equations, International Journal of Control 57 (1993) 1269-1271.
• [28] S. Kaczmarz, H. Steinhaus, Theorie der Orthogonalreihen, Monografie Matematyczne, vol. VI,Warszawa-Lwów, 1935.Wersja elektroniczna dostępna na stronie http://matwbn.icm.edu.pl.
• [29] K. C. Kiwiel, Block-iterative surrogate projection methods for convex feasibility problems, Linear Algebra Appl. 215 (1995), 225-259.
• [30] L. Maligranda, Stefan Kaczmarz (1895-1939 ), Antiquitates Mathematicae 1 (2007), 15-61.
• [31] S. F. McCormick, The methods of Kaczmarz and row orthogonalization for solving linear equations and least squares problems in Hilbert space, Indiana Univ. Math. J. 26 (1977), no. 6, 1137-1150.
• [32] T. S. Motzkin, I. J. Schoenberg, The relaxation method for linear inequalities, Canadian J. Math. 6 (1954), 393-404.
• [33] J. Musielak, Wstep do analizy funkcjonalnej, PWN, Warszawa, 1989.
• [34] W. Orlicz, Stefan Kaczmarz (1895-1939 ), Wiad. Mat. 26 (1985), 155-164.
• [35] P. C. Parks, S. Kaczmarz (1895-1939 ), Internat. J. Control 57 (1993), no. 6, 1263-1267.
• [36] G. Pierra, Decomposition through formalization in a product space, Math. Programming 28 (1984), no. 1, 96-115.
• [37] K. Tanabe, Projection method for solving a singular system of linear equations and its applications, Numer. Math. 17 (1971), 203-214.
• [38] C. Tompkins, Projection methods in calculation of some linear problems, multilithed typescript, 52 pp., part of Engineering Research Associates, Logistic papers, issue no. IV, Appendix I to Bimonthly Progress report No. 17, Contract N6onr-240, Task Order I, Office of Naval Research, Project NR 047 010.
• [39] C. Tompkins, Projection methods in calculation of some linear problems, Bull. Amer. Math. Soc. 55 (1949), 520.
• [40] Ch. B. Tompkins, Methods of steepest descent, in: Modern Mathematics for Engineer I (E. F. Beckenbach, ed.), McGraw-Hill, New York, 1956. Polskie tłumaczenie: Nowoczesna matematyka dla inzynierów, PWN, Warszawa, 1962.