東華大學圖書館 |

Concise guide to numerical algorithmics = the foundations and spirit of scientific computing /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Concise guide to numerical algorithmics/ by John Lawrence Nazareth.
Reminder of title:	the foundations and spirit of scientific computing /
Author:	Nazareth, J. L.
Published:	Cham :Springer International Publishing : : 2023.,
Description:	xiv, 69 p. :ill. (some col.), digital ;24 cm.
[NT 15003449]:	PART I: RATIONALE AND FOUNDATIONS -- The discussion here is premised on the paper that accompanies this proposal. -- Chapter 1: Algorithmics---The Spirit of Computing -- Chapter 2: Number ---The Language of Science -- Chapter 3: Bringing Number Under the Rubric of Algorithm -- PART II: NUMERICAL ALGORITHMIC SCIENCE -- Chapter 4: Algorithms on Graphs and Networks -- Chapter 5: Uni-Dimensional Equation-Solving and Optimization -- Chapter 6: Matrix-Based and Tensor-Based Computations -- Chapter 7: Linear Programming before the 1984 Revolution -- Chapter 8: Unconstrained Nonlinear Optimization -- Chapter 9: Nonlinear Equation-Solving -- Chapter 10: Constrained Nonlinear Optimization -- Chapter 11: Linear Programming after the 1984 Revolution -- Chapter 12: The Many Other Facets of Numerical Algorithmics -- PART III: CONVERGENCE, COMPLEXITY, AND NUMERICAL ERROR -- Chapter 13: Global Convergence and Asymptotic Rate-of-Convergence -- Chapter 14: Complexity Classes and Analysis -- Chapter 15: Roundoff-Error Analysis -- PART IV: NUMERICAL ALGORITHMIC ENGINEERING -- Chapter 16: Languages and Systems -- Chapter 17: Implementation Techniques and Software Development.
Contained By:	Springer Nature eBook
Subject:	Algorithms. -
Online resource:	https://doi.org/10.1007/978-3-031-21762-3
ISBN:	9783031217623

Concise guide to numerical algorithmics = the foundations and spirit of scientific computing /
Nazareth, J. L.

Concise guide to numerical algorithmicsthe foundations and spirit of scientific computing /[electronic resource] :by John Lawrence Nazareth. - Cham :Springer International Publishing :2023. - xiv, 69 p. :ill. (some col.), digital ;24 cm. - SpringerBriefs in computer science,2191-5776. - SpringerBriefs in computer science..

PART I: RATIONALE AND FOUNDATIONS -- The discussion here is premised on the paper that accompanies this proposal. -- Chapter 1: Algorithmics---The Spirit of Computing -- Chapter 2: Number ---The Language of Science -- Chapter 3: Bringing Number Under the Rubric of Algorithm -- PART II: NUMERICAL ALGORITHMIC SCIENCE -- Chapter 4: Algorithms on Graphs and Networks -- Chapter 5: Uni-Dimensional Equation-Solving and Optimization -- Chapter 6: Matrix-Based and Tensor-Based Computations -- Chapter 7: Linear Programming before the 1984 Revolution -- Chapter 8: Unconstrained Nonlinear Optimization -- Chapter 9: Nonlinear Equation-Solving -- Chapter 10: Constrained Nonlinear Optimization -- Chapter 11: Linear Programming after the 1984 Revolution -- Chapter 12: The Many Other Facets of Numerical Algorithmics -- PART III: CONVERGENCE, COMPLEXITY, AND NUMERICAL ERROR -- Chapter 13: Global Convergence and Asymptotic Rate-of-Convergence -- Chapter 14: Complexity Classes and Analysis -- Chapter 15: Roundoff-Error Analysis -- PART IV: NUMERICAL ALGORITHMIC ENGINEERING -- Chapter 16: Languages and Systems -- Chapter 17: Implementation Techniques and Software Development.

Numerical Algorithmic Science and Engineering (NAS&E), or more compactly, Numerical Algorithmics, is the theoretical and empirical study and the practical implementation and application of algorithms for solving finite-dimensional problems of a numeric nature. The variables of such problems are either discrete-valued, or continuous over the reals, or, and as is often the case, a combination of the two, and they may or may not have an underlying network/graph structure. This re-emerging discipline of numerical algorithmics within computer science is the counterpart of the now well-established discipline of numerical analysis within mathematics, where the latter's emphasis is on infinite-dimensional, continuous numerical problems and their finite-dimensional, continuous approximates. A discussion of the underlying rationale for numerical algorithmics, its foundational models of computation, its organizational details, and its role, in conjunction with numerical analysis, in support of the modern modus operandi of scientific computing, or computational science & engineering, is the primary focus of this short monograph. It comprises six chapters, each with its own bibliography. Chapters 2, 3 and 6 present the book's primary content. Chapters 1, 4, and 5 are briefer, and they provide contextual material for the three primary chapters and smooth the transition between them. Mathematical formalism has been kept to a minimum, and, whenever possible, visual and verbal forms of presentation are employed and the discussion enlivened through the use of motivating quotations and illustrative examples. The reader is expected to have a working knowledge of the basics of computer science, an exposure to basic linear algebra and calculus (and perhaps some real analysis), and an understanding of elementary mathematical concepts such as convexity of sets and functions, networks and graphs, and so on. Although this book is not suitable for use as the principal textbook for a course on numerical algorithmics (NAS&E), it will be of value as a supplementary reference for a variety of courses. It can also serve as the primary text for a research seminar. And it can be recommended for self-study of the foundations and organization of NAS&E to graduate and advanced undergraduate students with sufficient mathematical maturity and a background in computing. When departments of computer science were first created within universities worldwide during the middle of the twentieth century, numerical analysis was an important part of the curriculum. Its role within the discipline of computer science has greatly diminished over time, if not vanished altogether, and specialists in that area are now to be found mainly within other fields, in particular, mathematics and the physical sciences. A central concern of this monograph is the regrettable, downward trajectory of numerical analysis within computer science and how it can be arrested and suitably reconstituted. Resorting to a biblical metaphor, numerical algorithmics (NAS&E) as envisioned herein is neither old wine in new bottles, nor new wine in old bottles, but rather this re-emerging discipline is a decantation of an age-old vintage that can hopefully find its proper place within the larger arena of computer science, and at what appears now to be an opportune time.

ISBN: 9783031217623

Standard No.: 10.1007/978-3-031-21762-3doiSubjects--Topical Terms:

536374
Algorithms.

LC Class. No.: QA9.58 / .N39 2023

Dewey Class. No.: 518.1

Concise guide to numerical algorithmics = the foundations and spirit of scientific computing /
LDR:05611nmm a2200337 a 4500 001 2314190
003 DE-He213
005 20230102101631.0
006 m d
007 cr nn 008mamaa
008 230902s2023 sz s 0 eng d
020 $a 9783031217623 $q (electronic bk.)
020 $a 9783031217616 $q (paper)
024 7 $a 10.1007/978-3-031-21762-3 $2 doi
035 $a 978-3-031-21762-3
040 $a GP $c GP
041 0 $a eng
050 4 $a QA9.58 $b .N39 2023
072 7 $a UYA $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 518.1 $2 23
090 $a QA9.58 $b .N335 2023
100 1 $a Nazareth, J. L. $3 3625399
245 1 0 $a Concise guide to numerical algorithmics $h [electronic resource] : $b the foundations and spirit of scientific computing / $c by John Lawrence Nazareth.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2023.
300 $a xiv, 69 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a SpringerBriefs in computer science, $x 2191-5776
505 0 $a PART I: RATIONALE AND FOUNDATIONS -- The discussion here is premised on the paper that accompanies this proposal. -- Chapter 1: Algorithmics---The Spirit of Computing -- Chapter 2: Number ---The Language of Science -- Chapter 3: Bringing Number Under the Rubric of Algorithm -- PART II: NUMERICAL ALGORITHMIC SCIENCE -- Chapter 4: Algorithms on Graphs and Networks -- Chapter 5: Uni-Dimensional Equation-Solving and Optimization -- Chapter 6: Matrix-Based and Tensor-Based Computations -- Chapter 7: Linear Programming before the 1984 Revolution -- Chapter 8: Unconstrained Nonlinear Optimization -- Chapter 9: Nonlinear Equation-Solving -- Chapter 10: Constrained Nonlinear Optimization -- Chapter 11: Linear Programming after the 1984 Revolution -- Chapter 12: The Many Other Facets of Numerical Algorithmics -- PART III: CONVERGENCE, COMPLEXITY, AND NUMERICAL ERROR -- Chapter 13: Global Convergence and Asymptotic Rate-of-Convergence -- Chapter 14: Complexity Classes and Analysis -- Chapter 15: Roundoff-Error Analysis -- PART IV: NUMERICAL ALGORITHMIC ENGINEERING -- Chapter 16: Languages and Systems -- Chapter 17: Implementation Techniques and Software Development.
520 $a Numerical Algorithmic Science and Engineering (NAS&E), or more compactly, Numerical Algorithmics, is the theoretical and empirical study and the practical implementation and application of algorithms for solving finite-dimensional problems of a numeric nature. The variables of such problems are either discrete-valued, or continuous over the reals, or, and as is often the case, a combination of the two, and they may or may not have an underlying network/graph structure. This re-emerging discipline of numerical algorithmics within computer science is the counterpart of the now well-established discipline of numerical analysis within mathematics, where the latter's emphasis is on infinite-dimensional, continuous numerical problems and their finite-dimensional, continuous approximates. A discussion of the underlying rationale for numerical algorithmics, its foundational models of computation, its organizational details, and its role, in conjunction with numerical analysis, in support of the modern modus operandi of scientific computing, or computational science & engineering, is the primary focus of this short monograph. It comprises six chapters, each with its own bibliography. Chapters 2, 3 and 6 present the book's primary content. Chapters 1, 4, and 5 are briefer, and they provide contextual material for the three primary chapters and smooth the transition between them. Mathematical formalism has been kept to a minimum, and, whenever possible, visual and verbal forms of presentation are employed and the discussion enlivened through the use of motivating quotations and illustrative examples. The reader is expected to have a working knowledge of the basics of computer science, an exposure to basic linear algebra and calculus (and perhaps some real analysis), and an understanding of elementary mathematical concepts such as convexity of sets and functions, networks and graphs, and so on. Although this book is not suitable for use as the principal textbook for a course on numerical algorithmics (NAS&E), it will be of value as a supplementary reference for a variety of courses. It can also serve as the primary text for a research seminar. And it can be recommended for self-study of the foundations and organization of NAS&E to graduate and advanced undergraduate students with sufficient mathematical maturity and a background in computing. When departments of computer science were first created within universities worldwide during the middle of the twentieth century, numerical analysis was an important part of the curriculum. Its role within the discipline of computer science has greatly diminished over time, if not vanished altogether, and specialists in that area are now to be found mainly within other fields, in particular, mathematics and the physical sciences. A central concern of this monograph is the regrettable, downward trajectory of numerical analysis within computer science and how it can be arrested and suitably reconstituted. Resorting to a biblical metaphor, numerical algorithmics (NAS&E) as envisioned herein is neither old wine in new bottles, nor new wine in old bottles, but rather this re-emerging discipline is a decantation of an age-old vintage that can hopefully find its proper place within the larger arena of computer science, and at what appears now to be an opportune time.
650 0 $a Algorithms. $3 536374
650 0 $a Numerical analysis. $3 517751
650 1 4 $a Design and Analysis of Algorithms. $3 3538532
650 2 4 $a Numerical Analysis. $3 892626
650 2 4 $a Theory and Algorithms for Application Domains. $3 3594704
650 2 4 $a Computational Mathematics and Numerical Analysis. $3 891040
650 2 4 $a Discrete Mathematics in Computer Science. $3 892513
650 2 4 $a Operations Research and Decision Theory. $3 3591727
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a SpringerBriefs in computer science. $3 1567571
856 4 0 $u https://doi.org/10.1007/978-3-031-21762-3
950 $a Computer Science (SpringerNature-11645)