9783030909062 - Elements of the General Theory of Optimal Algorithms: 188 (Springer Optimization and Its Applications, 188) de Sergienko, Ivan V.; Lytvyn, Oleg M.; Zadiraka, Valeri... (13 resultados)

Condición: Brand New. Ships SAME or NEXT business day. We Ship to APO/FPO addr. Choose EXPEDITED shipping and receive in 2-5 business days within the United States. See our member profile for customer support contact info. We have an easy return policy.

Hardcover. Condición: new. Hardcover. In this monograph, the authors develop a methodology that allows one to construct and substantiate optimal and suboptimal algorithms to solve problems in computational and applied mathematics. Throughout the book, the authors explore well-known and proposed algorithms with a view toward analyzing their quality and the range of their efficiency. The concept of the approach taken is based on several theories (of computations, of optimal algorithms, of interpolation, interlination, and interflatation of functions, to name several). Theoretical principles and practical aspects of testing the quality of algorithms and applied software, are a major component of the exposition. The computer technology in construction of T-efficient algorithms for computing e-solutions to problems of computational and applied mathematics, is also explored. The readership for this monograph is aimed at scientists, postgraduate students, advanced students, and specialists dealing with issues of developingalgorithmic and software support for the solution of problems of computational and applied mathematics. In this monograph, the authors develop a methodology that allows one to construct and substantiate optimal and suboptimal algorithms to solve problems in computational and applied mathematics. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Condición: New. 1st ed. 2021 edition NO-PA16APR2015-KAP.

Condición: New.

Buch. Condición: Neu. Neuware -In this monograph, the authors develop a methodology that allows one to construct and substantiate optimal and suboptimal algorithms to solve problems in computational and applied mathematics. Throughout the book, the authors explore well-known and proposed algorithms with a view toward analyzing their quality and the range of their efficiency. The concept of the approach taken is based on several theories (of computations, of optimal algorithms, of interpolation, interlination, and interflatation of functions, to name several). Theoretical principles and practical aspects of testing the quality of algorithms and applied software, are a major component of the exposition. The computer technology in construction of T-efficient algorithms for computing ¿-solutions to problems of computational and applied mathematics, is also explored. The readership for this monograph is aimed at scientists, postgraduate students, advanced students, and specialists dealing with issues of developingalgorithmic and software support for the solution of problems of computational and applied mathematics.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 396 pp. Englisch.

Buch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - In this monograph, the authors develop a methodology that allows one to construct and substantiate optimal and suboptimal algorithms to solve problems in computational and applied mathematics. Throughout the book, the authors explore well-known and proposed algorithms with a view toward analyzing their quality and the range of their efficiency. The concept of the approach taken is based on several theories (of computations, of optimal algorithms, of interpolation, interlination, and interflatation of functions, to name several). Theoretical principles and practical aspects of testing the quality of algorithms and applied software, are a major component of the exposition. The computer technology in construction of T-efficient algorithms for computing -solutions to problems of computational and applied mathematics, is also explored. The readership for this monograph is aimed at scientists, postgraduate students, advanced students, and specialists dealing with issues of developingalgorithmic and software support for the solution of problems of computational and applied mathematics.

Hardcover. Condición: new. Hardcover. In this monograph, the authors develop a methodology that allows one to construct and substantiate optimal and suboptimal algorithms to solve problems in computational and applied mathematics. Throughout the book, the authors explore well-known and proposed algorithms with a view toward analyzing their quality and the range of their efficiency. The concept of the approach taken is based on several theories (of computations, of optimal algorithms, of interpolation, interlination, and interflatation of functions, to name several). Theoretical principles and practical aspects of testing the quality of algorithms and applied software, are a major component of the exposition. The computer technology in construction of T-efficient algorithms for computing e-solutions to problems of computational and applied mathematics, is also explored. The readership for this monograph is aimed at scientists, postgraduate students, advanced students, and specialists dealing with issues of developingalgorithmic and software support for the solution of problems of computational and applied mathematics. In this monograph, the authors develop a methodology that allows one to construct and substantiate optimal and suboptimal algorithms to solve problems in computational and applied mathematics. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Condición: new. Questo è un articolo print on demand.

Hardcover. Condición: Brand New. 395 pages. 9.25x6.10x9.21 inches. In Stock. This item is printed on demand.

Buch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -In this monograph, the authors develop a methodology that allows one to construct and substantiate optimal and suboptimal algorithms to solve problems in computational and applied mathematics. Throughout the book, the authors explore well-known and proposed algorithms with a view toward analyzing their quality and the range of their efficiency. The concept of the approach taken is based on several theories (of computations, of optimal algorithms, of interpolation, interlination, and interflatation of functions, to name several). Theoretical principles and practical aspects of testing the quality of algorithms and applied software, are a major component of the exposition. The computer technology in construction of T-efficient algorithms for computing -solutions to problems of computational and applied mathematics, is also explored. The readership for this monograph is aimed at scientists, postgraduate students, advanced students, and specialists dealing with issues of developingalgorithmic and software support for the solution of problems of computational and applied mathematics. 396 pp. Englisch.

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. In this monograph, the authors develop a methodology that allows one to construct and substantiate optimal and suboptimal algorithms to solve problems in computational and applied mathematics.In this monograph, the authors develop a methodology that all.

Buch. Condición: Neu. Elements of the General Theory of Optimal Algorithms | Ivan V. Sergienko (u. a.) | Buch | Springer Optimization and Its Applications | xvii | Englisch | 2022 | Springer | EAN 9783030909062 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.

Condición: New. PRINT ON DEMAND.