Author : David Gottlieb
Publisher : SIAM
Page : 167 pages
File Size : 19,4 MB
Release : 1977-01-01
Category : Technology & Engineering
ISBN : 0898710235
A unified discussion of the formulation and analysis of special methods of mixed initial boundary-value problems. The focus is on the development of a new mathematical theory that explains why and how well spectral methods work. Included are interesting extensions of the classical numerical analysis.
Author : Brian Sutton
Publisher : SIAM
Page : 448 pages
File Size : 36,54 MB
Release : 2019-04-18
Category : Mathematics
ISBN : 1611975700
This textbook develops the fundamental skills of numerical analysis: designing numerical methods, implementing them in computer code, and analyzing their accuracy and efficiency. A number of mathematical problems?interpolation, integration, linear systems, zero finding, and differential equations?are considered, and some of the most important methods for their solution are demonstrated and analyzed. Notable features of this book include the development of Chebyshev methods alongside more classical ones; a dual emphasis on theory and experimentation; the use of linear algebra to solve problems from analysis, which enables students to gain a greater appreciation for both subjects; and many examples and exercises. Numerical Analysis: Theory and Experiments is designed to be the primary text for a junior- or senior-level undergraduate course in numerical analysis for mathematics majors. Scientists and engineers interested in numerical methods, particularly those seeking an accessible introduction to Chebyshev methods, will also be interested in this book.
Author : Uri M. Ascher
Publisher : SIAM
Page : 574 pages
File Size : 50,27 MB
Release : 2011-07-14
Category : Mathematics
ISBN : 0898719976
Offers students a practical knowledge of modern techniques in scientific computing.
Author : Ake Bjorck
Publisher : SIAM
Page : 425 pages
File Size : 26,58 MB
Release : 1996-01-01
Category : Mathematics
ISBN : 9781611971484
The method of least squares was discovered by Gauss in 1795. It has since become the principal tool to reduce the influence of errors when fitting models to given observations. Today, applications of least squares arise in a great number of scientific areas, such as statistics, geodetics, signal processing, and control. In the last 20 years there has been a great increase in the capacity for automatic data capturing and computing. Least squares problems of large size are now routinely solved. Tremendous progress has been made in numerical methods for least squares problems, in particular for generalized and modified least squares problems and direct and iterative methods for sparse problems. Until now there has not been a monograph that covers the full spectrum of relevant problems and methods in least squares. This volume gives an in-depth treatment of topics such as methods for sparse least squares problems, iterative methods, modified least squares, weighted problems, and constrained and regularized problems. The more than 800 references provide a comprehensive survey of the available literature on the subject.
Author : Jan S. Hesthaven
Publisher : SIAM
Page : 571 pages
File Size : 44,51 MB
Release : 2018-01-30
Category : Science
ISBN : 1611975107
Conservation laws are the mathematical expression of the principles of conservation and provide effective and accurate predictive models of our physical world. Although intense research activity during the last decades has led to substantial advances in the development of powerful computational methods for conservation laws, their solution remains a challenge and many questions are left open; thus it is an active and fruitful area of research. Numerical Methods for Conservation Laws: From Analysis to Algorithms offers the first comprehensive introduction to modern computational methods and their analysis for hyperbolic conservation laws, building on intense research activities for more than four decades of development; discusses classic results on monotone and finite difference/finite volume schemes, but emphasizes the successful development of high-order accurate methods for hyperbolic conservation laws; addresses modern concepts of TVD and entropy stability, strongly stable Runge-Kutta schemes, and limiter-based methods before discussing essentially nonoscillatory schemes, discontinuous Galerkin methods, and spectral methods; explores algorithmic aspects of these methods, emphasizing one- and two-dimensional problems and the development and analysis of an extensive range of methods; includes MATLAB software with which all main methods and computational results in the book can be reproduced; and demonstrates the performance of many methods on a set of benchmark problems to allow direct comparisons. Code and other supplemental material will be available online at publication.
Author : Willy J. F. Govaerts
Publisher : SIAM
Page : 384 pages
File Size : 37,39 MB
Release : 2000-01-01
Category : Mathematics
ISBN : 9780898719543
Dynamical systems arise in all fields of applied mathematics. The author focuses on the description of numerical methods for the detection, computation, and continuation of equilibria and bifurcation points of equilibria of dynamical systems. This subfield has the particular attraction of having links with the geometric theory of differential equations, numerical analysis, and linear algebra.
Author : Amparo Gil
Publisher : SIAM
Page : 431 pages
File Size : 42,2 MB
Release : 2007-01-01
Category : Mathematics
ISBN : 9780898717822
Special functions arise in many problems of pure and applied mathematics, mathematical statistics, physics, and engineering. This book provides an up-to-date overview of numerical methods for computing special functions and discusses when to use these methods depending on the function and the range of parameters. Not only are standard and simple parameter domains considered, but methods valid for large and complex parameters are described as well. The first part of the book (basic methods) covers convergent and divergent series, Chebyshev expansions, numerical quadrature, and recurrence relations. Its focus is on the computation of special functions; however, it is suitable for general numerical courses. Pseudoalgorithms are given to help students write their own algorithms. In addition to these basic tools, the authors discuss other useful and efficient methods, such as methods for computing zeros of special functions, uniform asymptotic expansions, Padé approximations, and sequence transformations. The book also provides specific algorithms for computing several special functions (like Airy functions and parabolic cylinder functions, among others).
Author : Nicholas J. Higham
Publisher : SIAM
Page : 710 pages
File Size : 44,43 MB
Release : 2002-01-01
Category : Mathematics
ISBN : 9780898718027
Accuracy and Stability of Numerical Algorithms gives a thorough, up-to-date treatment of the behavior of numerical algorithms in finite precision arithmetic. It combines algorithmic derivations, perturbation theory, and rounding error analysis, all enlivened by historical perspective and informative quotations. This second edition expands and updates the coverage of the first edition (1996) and includes numerous improvements to the original material. Two new chapters treat symmetric indefinite systems and skew-symmetric systems, and nonlinear systems and Newton's method. Twelve new sections include coverage of additional error bounds for Gaussian elimination, rank revealing LU factorizations, weighted and constrained least squares problems, and the fused multiply-add operation found on some modern computer architectures.
Author : Curtis R. Vogel
Publisher : SIAM
Page : 195 pages
File Size : 29,42 MB
Release : 2002-01-01
Category : Mathematics
ISBN : 0898717574
Provides a basic understanding of both the underlying mathematics and the computational methods used to solve inverse problems.
Author : Marek Cygan
Publisher : Springer
Page : 618 pages
File Size : 18,18 MB
Release : 2015-07-20
Category : Computers
ISBN : 3319212753
This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area. The book covers many of the recent developments of the field, including application of important separators, branching based on linear programming, Cut & Count to obtain faster algorithms on tree decompositions, algorithms based on representative families of matroids, and use of the Strong Exponential Time Hypothesis. A number of older results are revisited and explained in a modern and didactic way. The book provides a toolbox of algorithmic techniques. Part I is an overview of basic techniques, each chapter discussing a certain algorithmic paradigm. The material covered in this part can be used for an introductory course on fixed-parameter tractability. Part II discusses more advanced and specialized algorithmic ideas, bringing the reader to the cutting edge of current research. Part III presents complexity results and lower bounds, giving negative evidence by way of W[1]-hardness, the Exponential Time Hypothesis, and kernelization lower bounds. All the results and concepts are introduced at a level accessible to graduate students and advanced undergraduate students. Every chapter is accompanied by exercises, many with hints, while the bibliographic notes point to original publications and related work.
