Book Description

This book presents the author’s new method of two-stage maximization of likelihood function, which helps to solve a series of non-solving before the well-posed and ill-posed problems of pseudosolution computing systems of linear algebraic equations (or, in statistical terminology, parameters’ estimators of functional relationships) and linear integral equations in the presence of deterministic and random errors in the initial data. This book, for the first time, presents a solution of the problem of reciprocal influence of passive errors of regressors and of active errors of predictors by computing point estimators of functional relationships. ... Read more

Book Description

The book is the Proceedings of the Conference ENUMATH 2003, the 5th European Conference on Numerical Mathematics, concerned with most recent achievements in scientific computing, computational mathematics, numerical analysis and their applications. These proceedings contain a selection of invited plenary lectures, papers presented in minisymposia and contributed papers. All contributions to these proceedings have been reviewed by members of the Scientific Committee. Attention is paid to theoretical aspects of new numerical techniques and algorithms, as well as to applications, for example in fluid dynamics, electromagnetic fields, structural mechanics, free boundary problems. The book will be very useful for a wide range of readers, giving them an excellent overview of the most modern methods, techniques, algorithms and results in numerical mathematics, scientific computing and their applications.

Book Description

Of considerable importance to numerical analysts, this text contains the proceedings of the 18th Dundee Biennial Conference on Numerical Analysis, featuring eminent analysts and current topics. The papers cover everything from partial differential equations to linear algebra and approximation theory and contain contributions from the leading experts in the field. The applications range from image processing and molecular dynamics to superconductivity.If you rely on numerical methods, Numerical Analysis 1999 will serve as an essential guide to the direction of current research. ... Read more

Book Description

In August 2003, ETHZ Computational Laboratory (CoLab), together with the Swiss Center for Scientific Computing in Manno and the Università della Svizzera Italiana (USI), organized the Summer School in ... Read more

Book Description

This book is an introduction to modern cardinal arithmetic in the frame of the axioms of Zermelo-Fraenkel set theory together with the axiom of choice. A first part describes the classical theory developed by Bernstein, Cantor, Hausdorff, König and Tarski between 1870 and 1930. Next, the development in the seventies led by Galvin, Hajnal and Silver is characterized. The third part presents the fundamental investigations in pcf theory which have been worked out by Shelah to answer the questions left open n the seventies.

This text is the first self-contained introduction to cardinal arithmetic which also includes pcf theory. It is aimed at undergraduate, and also postgraduate students as well as researchers who want to broaden their knowledge of cardinal arithmetic. It gives a relatively complete survey of results provable in ZFC. ... Read more

Book Description

"An important topic, which is on the boundary between numerical analysis and computer science …. I found the book well written and containing much interesting material, most of the time disseminated in specialized papers published in specialized journals difficult to find. Moreover, there are very few books on these topics and they are not recent."  —Numerical Algorithms (review of the first edition)

This unique book provides concepts and background necessary to understand and build algorithms for computing the elementary functions. The author presents and structures the algorithms (hardware-oriented as well as software-oriented), and also discusses issues related to accurate floating-point implementation. The purpose is not to give "cookbook recipes" that allow one to implement a given function, but rather to provide the reader with tools necessary to build, or adapt, algorithms to their specific computing environment.

The expanded second edition contains a number of revisions and additions, which incorporate numerous new results obtained during the last few years. New algorithms invented since 1997—such as Matula’s bipartite method, another table-based method due to Ercegovac, Lang, Tisserand, and Muller—as well as a new chapter on multiple-precision arithmetic have been added. In addition, the section on correct rounding of elementary functions has been fully reworked, also in the context of new results. Finally, the introductory presentation of floating-point arithmetic has been expanded, with more emphasis given to the use of the fused multiply-accumulate instruction. The book is an up-to-date presentation of information needed to understand and accurately use mathematical functions and algorithms in computational work and design. Graduates, professionals, and researchers in scientific computing, software engineering, and computer engineering will find the book a useful reference and resource.

Book Description

The aim of the annual ALENEX workshop is to provide a forum for the presentation of original research in the implementation and experimental evaluation of algorithms and data structures. This research presents significant studies in experimental analysis or in the implementation, testing, and evaluation of algorithms for realistic environments and scenarios. The paper presentations address specific applied areas that present unique challenges in their underlying algorithmic problems as well as methodological issues and standards in the context of empirical research on algorithms and data structures.

The ANALCO workshop presents a collection of original research in the analysis of algorithms and associated combinatorial structures. The papers study properties of fundamental combinatorial structures that arise in practical computational applications (such as permutations, trees, strings, tries, and graphs) and address the precise analysis of algorithms for processing such structures, including average-case analysis; analysis of moments, extrema, and distributions; and probabilistic analysis of randomized algorithms.

This proceedings collects extended versions of the 14 papers that were selected for presentation from the ALENEX workshop and 10 papers selected for presentation from the ANALCO workshop. ... Read more