Bibliographic record
Abstract
A First Course in Numerical Methods is designed for students and researchers who seek practical knowledge of modern techniques in scientific computing. Avoiding encyclopedic and heavily theoretical exposition, the book provides an in-depth treatment of fundamental issues and methods, the reasons behind the success and failure of numerical software, and fresh and easy-to-follow approaches and techniques. The authors focus on current methods, issues and software while providing a comprehensive theoretical foundation, enabling those who need to apply the techniques to successfully design solutions to nonstandard problems. The book also illustrates algorithms using the programming environment of MATLAB(r), with the expectation that the reader will gradually become proficient in it while learning the material covered in the book. A variety of exercises are provided within each chapter along with review questions aimed at self-testing. The book takes an algorithmic approach, focusing on techniques that have a high level of applicability to engineering, computer science, and industrial mathematics. Audience: A First Course in Numerical Methods is aimed at undergraduate and beginning graduate students. It may also be appropriate for researchers whose main area of expertise is not scientific computing and who are interested in learning the basic concepts of the field. Contents: Chapter One: Numerical Algorithms; Chapter Two: Roundoff Errors; Chapter Three: Nonlinear Equations in One Variable; Chapter Four: Linear Algebra Background; Chapter Five: Linear Systems: Direct Methods; Chapter Six: Linear Least Squares Problems; Chapter Seven: Linear Systems: Iterative Methods; Chapter Eight: Eigenvalues and Singular Values; Chapter Nine: Nonlinear Systems and Optimization; Chapter Ten: Polynomial Interpolation; Chapter Eleven: Piecewise Polynomial Interpolation; Chapter Twelve: Best Approximation; Chapter Thirteen: Fourier Transform; Chapter Fourteen: Numerical Differentiation; Chapter Fifteen: Numerical Integration; Chapter Sixteen: Differential Equations.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.005 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.002 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.003 | 0.003 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.002 | 0.005 |
| Insufficient payload (model declined to judge) | 0.140 | 0.104 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".