Computational error and complexity in science and engineering
complexitycomputational erroreigenproblemsfloating point numbersIEEE 754Karmarkar's algorithmlinear programmingNP-problemnumerical differentiationP-problemparallel computationprobabilistic computationsingular systemstextbookTuring machines
Mathematics for nonmathematicians (engineering, social sciences, etc.) (00A06) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Monte Carlo methods (65C05) Numerical differentiation (65D25) Numerical quadrature and cubature formulas (65D32) Numerical linear algebra (65Fxx) Error analysis and interval analysis (65Gxx) Numerical mathematical programming methods (65K05) Complexity and performance of numerical algorithms (65Y20) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Theory of computing (68Qxx)
This monograph for graduates in engineering, computer science and mathematics focuses on error and complexity. Both topics allow to estimate the quality and the cost of the results produced by an algorithm. The nearly 250 pages consist of six chapters with further subdivisions. Chapter 1 introduces into the subject, discusses the distinction between science and engineering and considers capability, limitation, tools, types and models of computation. Moreover, it gives a first impression of computer representable numbers and highlights problem solving. The next two chapters are devoted to the two main topics of the book: Chapter 2 is an exposition of all that is connected with error. Among others it introduces errors, discusses the importance of relative errors, defines computable errors and shows how to compute and to estimate them. Complexity is the core of Chapter 3. Turing machines, Gödel's incompleteness theorem, P- and NP-problems, NP-completeness and probabilistic complexity are some of the keywords appearing here. Chapter 4 deals with errors and approximations in digital computers. Number representation is widely discussed including the importance of the base 2 system, floating point numbers and details of the IEEE 754 standard. Chapter 5 presents several numerical algorithms together with their error and complexity. Topics are interpolation, direct and iterative linear system solvers including singular systems, eigenproblems, linear programming with Karmarkar's algorithm, numerical differentiation and integration. Error and complexity in error-free computation as well as that in parallel and probabilistic computations are described in Chapter 6. Examples are included throughout the text to illustrate the underlying ideas. Sometimes program segments in Matlab are added. References are listed at the end of each chapter.
- Publication:4863764
- An Introduction to Numerical Analysis for Electrical and Computer Engineers
- scientific article; zbMATH DE number 50734
- Numerical computing with IEEE floating point arithmetic. Incl. one theorem, one rule of thumb, and one hundred and one exercises
- Numerical analysis for engineers and natural scientists.
- Golden ratio in science, as random sequence source, its computation and beyond
- How modeling can attract experimentalists to improve solar cell's efficiency: Divide-and-conquer approach
- The complexity of error metrics
- Best \(k\)-digit rational bounds for irrational numbers: pre- and super-computer era
- Interpolation for nonlinear BVP in circular membrane with known upper and lower solutions
- Chemical equation balancing: an integer programming approach
- Gas flow problem: solving non-linear BVP with given lower-upper solutions interactively
- Can fractional calculus be generalized? Problems and efforts
- scientific article; zbMATH DE number 2163480 (Why is no real title available?)
- On the epistemological analysis of modeling and computational error in the mathematical sciences
- scientific article; zbMATH DE number 838369 (Why is no real title available?)
- Solving linear program as linear system in polynomial time
- A quasi-shrinking rectangle algorithm for complex zeros of a function
- Best \(k\)-digit rational approximation of irrational numbers: pre-computer versus computer era
- Heartfelt tribute to the person with an amazing legacy
- Golden ratio versus pi as random sequence sources for Monte Carlo integration
- Zero-clusters of polynomials: best approach in supercomputing era
This page was built for publication: Computational error and complexity in science and engineering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1774498)
