The Theory of Matrices. By F R. Gantmacher. Two volumes, pp. 374 and 276. 1959. (Translated from the Russian by K. A. Hirsch; Chelsea Publishing Company, New York)

We substantially update the capabilities of the open-source software instrument Modules for Experiments in Stellar Astrophysics (MESA). MESA can now simultaneously evolve an interacting pair of differentially rotating stars undergoing transfer and loss of mass and angular momentum, greatly enhancing the prior ability to model binary evolution. New MESA capabilities in fully coupled calculation of nuclear networks with hundreds of isotopes now allow MESA to accurately simulate advanced burning stages needed to construct supernova progenitor models. Implicit hydrodynamics with shocks can now be treated with MESA, enabling modeling of the entire massive star lifecycle, from pre-main sequence evolution to the onset of core collapse and nucleosynthesis from the resulting explosion. Coupling of the GYRE non-adiabatic pulsation instrument with MESA allows for new explorations of the instability strips for massive stars while also accelerating the astrophysical use of asteroseismology data. We improve treatment of mass accretion, giving more accurate and robust near-surface profiles. A new MESA capability to calculate weak reaction rates "on-the-fly" from input nuclear data allows better simulation of accretion induced collapse of massive white dwarfs and the fate of some massive stars. We discuss the ongoing challenge of chemical diffusion in the strongly coupled plasma regime, and exhibit improvements in MESA that now allow for the simulation of radiative levitation of heavy elements in hot stars. We close by noting that the MESA software infrastructure provides bit-for-bit consistency for all results across all the supported platforms, a profound enabling capability for accelerating MESA's development.

https://iopscience.iop.org/article/10.1088/0067-0049/220/1/15/pdf

Modules for experiments in stellar astrophysics (mesa): binaries, pulsations, and explosions

This ebook is the first authorized digital version of Kernighan and Ritchie's 1988 classic, The C Programming Language (2nd Ed.). One of the best-selling programming books published in the last fifty years, "K&R" has been called everything from the "bible" to "a landmark in computer science" and it has influenced generations of programmers. Available now for all leading ebook platforms, this concise and beautifully written text is a "must-have" reference for every serious programmers digital library.

As modestly described by the authors in the Preface to the First Edition, this "is not an introductory programming manual; it assumes some familiarity with basic programming concepts like variables, assignment statements, loops, and functions. Nonetheless, a novice programmer should be able to read along and pick up the language, although access to a more knowledgeable colleague will help."

The C programming language

This unique book provides an introduction to a subject whose use has steadily increased over the past 40 years. An update of Ramon Moore s previous books on the topic, it provides broad coverage of the subject as well as the historical perspective of one of the originators of modern interval analysis. The authors provide a hands-on introduction to INTLAB, a high-quality, comprehensive MATLAB toolbox for interval computations, making this the first interval analysis book that does with INTLAB what general numerical analysis texts do with MATLAB. Readers will find the following features of interest: elementary motivating examples and notes that help maximize the reader s chance of success in applying the techniques; exercises and hands-on MATLAB-based examples woven into the text; INTLAB-based examples and explanations integrated into the text, along with a comprehensive set of exercises and solutions, and an appendix with INTLAB commands; an extensive bibliography and appendices that will continue to be valuable resources once the reader is familiar with the subject; and a Web page with links to computational tools and other resources of interest. Audience: Introduction to Interval Analysis will be valuable to engineers and scientists interested in scientific computation, especially in reliability, effects of roundoff error, and automatic verification of results. The introductory material is particularly important for experts in global optimization and constraint solution algorithms. This book is suitable for introducing the subject to students in these areas. Contents: Preface; Chapter 1: Introduction; Chapter 2: The Interval Number System; Chapter 3: First Applications of Interval Arithmetic; Chapter 4: Further Properties of Interval Arithmetic; Chapter 5: Introduction to Interval Functions; Chapter 6: Interval Sequences; Chapter 7: Interval Matrices; Chapter 8: Interval Newton Methods; Chapter 9: Integration of Interval Functions; Chapter 10: Integral and Differential Equations; Chapter 11: Applications; Appendix A: Sets and Functions; Appendix B: Formulary; Appendix C: Hints for Selected Exercises; Appendix D: Internet Resources; Appendix E: INTLAB Commands and Functions; References; Index.

Introduction to Interval Analysis

Applied Interval Analysis

INTLAB is a toolbox for Matlab supporting real and complex intervals, and vectors, full matrices and sparse matrices over those. It is designed to be very fast. In fact, it is not much slower than the fastest pure floating point algorithms using the fastest compilers available (the latter, of course, without verification of the result). Beside the basic arithmetical operations, rigorous input and output, rigorous standard functions, gradients, slopes and multiple precision arithmetic is included in INTLAB. Portability is assured by implementing all algorithms in Matlab itself with exception of exactly one routine for switching the rounding downwards, upwards and to nearest. Timing comparisons show that the used concept achieves the anticipated speed with identical code on a variety of computers, ranging from PC’s to parallel computers. INTLAB is freeware and may be copied from our home page.

INTLAB — INTerval LABoratory

INTLAB - INTerval LABoratory.

Algorithms for summation and dot product of floating-point numbers are presented which are fast in terms of measured computing time. We show that the computed results are as accurate as if computed in twice or K-fold working precision, $K\ge 3$. For twice the working precision our algorithms for summation and dot product are some 40% faster than the corresponding XBLAS routines while sharing similar error estimates. Our algorithms are widely applicable because they require only addition, subtraction, and multiplication of floating-point numbers in the same working precision as the given data. Higher precision is unnecessary, algorithms are straight loops without branch, and no access to mantissa or exponent is necessary.

Accurate Sum and Dot Product

A classical mathematical proof is constructed using pencil and paper. However, there are many ways in which computers may be used in a mathematical proof. But ‘proof by computer’, or even the use of computers in the course of a proof, is not so readily accepted (the December 2008 issue of the Notices of the American Mathematical Society is devoted to formal proofs by computer).In the following we introduce verification methods and discuss how they can assist in achieving a mathematically rigorous result. In particular we emphasize how floating-point arithmetic is used.

Verification methods: Rigorous results using floating-point arithmetic

Publisher Summary This chapter presents the new methods of solving algebraic problems with high accuracy. Examples of such problems are the solving of linear systems, eigenvalue/eigenvector determination, computing zeros of polynomials, sparse matrix problems, computation of the value of an arbitrary arithmetic expression, in particular, the value of a polynomial at a point, nonlinear systems, linear, quadratic, and convex programming over the field of real or complex numbers as well as over the corresponding interval spaces. All the algorithms based on new methods have some key properties in common: (1) every result is automatically verified to be correct by the algorithm; (2) the results are of high accuracy, that is, the error of every component of the result is of the magnitude of the relative rounding error unit; (3) the solution of the given problem is automatically shown to exist and to be unique within the given error bounds; and (4) the computing time is of the same order as comparable floating-point algorithm. The key property of the algorithms is that error control is performed automatically by the computer without any requirement on the part of the user, such as estimating spectral radii. The error bounds for all components of the inverse of the Hilbert 15 × 15 matrix are as small as possible, that is, left and right bounds differ only by one in the 12 place of the mantissa of each component. It is called least significant bit accuracy.

Siegfried M. Rump

Papers

INTLAB — INTerval LABoratory

INTLAB - INTerval LABoratory.

Accurate Sum and Dot Product

Verification methods: Rigorous results using floating-point arithmetic

Solving algebraic problems with high accuracy