Pencarian Artikel Jurnal & Majalah

Menampilkan keseluruhan arsip dokumen (Halaman 63 dari 34194, Total: 341939 data)

Mind Your Threes and Twos

Nama Pengarang : Suzanne Dorée, Robert Hanson & Matthew Richey
Nama Majalah/Jurnal : Mathematics Magazine
Volume / Nomor Edisi : 99 (No. 1)
Nomor Halaman : 30-38
Abstraksi Narasi : The Boltzmann Game begins with group of students having $1 each. In each round of the game, a student is selected to give $1, if they have it, to another selected student. In the long run, what is the probability that any given student has $0, $1, $2, …? This game originated in a Chemistry class to model the famous Boltzmann distribution where the students represent particles and the dollars represent quanta of energy. In studying this game, we encountered a curious phenomenon involving when students have $2 versus $3. Explaining this phenomenon is the heart of this paper, going from pattern to conjecture to a proof and, not satisfied with just any proof we dig deeper to find an elegant proof that reveals the underlying structure.

An Introduction to and a Further Variation of the Steinbart Theorem

Nama Pengarang : Hans Humenberger
Nama Majalah/Jurnal : Mathematics Magazine
Volume / Nomor Edisi : 99 (No. 1)
Nomor Halaman : 20-29
Abstraksi Narasi : We present a geometric proof of the Steinbart theorem (this is not new), highlight that the point P mentioned in the Steinbart theorem can also lie in the exterior of the triangle, highlight several special cases of the Steinbart point, and answer the question: Given a point Q (either in the interior of a triangle ABC or on its sides), how many points P yielding Steinbart point Q are there in the plane?

Generalizing a Limit Involving Iterated nth Roots

Nama Pengarang : Rajib? Mukherjee
Nama Majalah/Jurnal : Mathematics Magazine
Volume / Nomor Edisi : 99 (No. 1)
Nomor Halaman : 17-19
Abstraksi Narasi : In this article we discuss an interesting result regarding generalization of a limit involving iterated nth roots.

Committees: An Alternative Financing Method from South Asia

Nama Pengarang : Muhammad Maaz
Nama Majalah/Jurnal : Mathematics Magazine
Volume / Nomor Edisi : 99 (No. 1)
Nomor Halaman : 12-16
Abstraksi Narasi : The so-called committee is a method of communal finance which has been used for centuries in South Asia, primarily by women, to help pay for weddings or other large purchases. In this note, I describe it and mathematically analyze some of its advantages and tradeoffs.

Popular Problems in Wasan and the Curvature Theorem

Nama Pengarang : Jun Ozone
Nama Majalah/Jurnal : Mathematics Magazine
Volume / Nomor Edisi : 99 (No. 1)
Nomor Halaman : 4-11
Abstraksi Narasi : A Researcher of old Japanese mathematics requested readers find a solution 150 years ago to a group of handwritten figures. They are contact problems of many circles, for which the identical curvature invariant equation 1?????1+1????3=1????2+1????4 holds. However, subsequent solutions by mathematicians and researchers mainly used the inversion method, often solving each problem individually. This paper gives theorems that solve for the expected properties in a unified way. Further, we show that the Steiner chain is closely related to Japanese pattern culture.

A Gentle Introduction to Interpolation on the Grassmann Manifold

Nama Pengarang : Gabriele Ciaramella, Martin J. Gander, Tommaso Vanzan
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 68 (No. 1)
Nomor Halaman : 173-203
Abstraksi Narasi : This paper offers a self-contained exposition of the fundamental mathematical and computational tools for interpolation on the Grassmann manifold, including detailed derivations of geodesics and explicit formulations of the exponential and logarithmic maps. The presentation emphasizes intuition and draws continuous parallels with the Euclidean setting. This pedagogical approach facilitates the understanding of linear, piecewise linear, and high-order interpolation algorithms, as well as their extension to more general manifolds. Two numerical examples are finally used to illustrate the potential of these algorithms: one in the context of parametric model order reduction, and another drawn from stationary iterative methods for linear systems.

Parameter Identifiability, Parameter Estimation, and Model Prediction for Differential Equation Models

Nama Pengarang : Matthew J. Simpson, Ruth E. Baker
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 68 (No. 1)
Nomor Halaman : 153-171
Abstraksi Narasi : Interpreting data with mathematical models is an important aspect of real-world industrial and applied mathematical modeling. Often we are interested to understand the extent to which a particular set of data informs and constrains model parameters. This question is closely related to the concept of parameter identifiability, and in this article we present a series of computational exercises to introduce tools that can be used to assess parameter identifiability, estimate parameters, and generate model predictions. Taking a likelihood-based approach, we show that very similar ideas and algorithms can be used to deal with a range of different mathematical modeling frameworks. The exercises and results presented in this article are supported by a suite of open access codes that can be accessed on GitHub.

Compositional Function Spaces for Deep Learning

Nama Pengarang : Rahul Parhi, Robert D. Nowak
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 68 (No. 1)
Nomor Halaman : 127-149
Abstraksi Narasi : We present a variational framework for studying functions learned by deep neural networks with rectified linear unit nonlinearities. We introduce a function space built from compositions of functions of second-order Radon-domain bounded variation. The compositional form of these functions captures the structure of deep neural networks. We prove a representer theorem that shows that deep neural networks with finite width solve regularized data-fitting problems over this space. The critical width is controlled by the square of the number of training data. This perspective explains the effect of weight-decay regularization in neural network training, the importance of skip connections, and the role of sparsity in neural networks. By considering the function-space perspective, we provide sharp links between deep learning and variational methods.

Quantitative Estimates: How Well Does the Discrete Fourier Transform Approximate the Fourier Transform on ??

Nama Pengarang : Martin Ehler, Karlheinz Gröchenig, Andreas Klotz
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 68 (No. 1)
Nomor Halaman : 93-123
Abstraksi Narasi : In order to compute the Fourier transform of a function ???? on the real line numerically, one samples ???? on a grid and then takes the discrete Fourier transform. We derive exact error estimates for this procedure in terms of the decay and smoothness of ????. The analysis provides an asymptotically optimal recipe for how to relate the number of samples, the sampling interval, and the grid size.

Landmarks in the History of Iterative Methods

Nama Pengarang : Martin J. Gander, Philippe Henry, Gerhard Wanner
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 68 (No. 1)
Nomor Halaman : 3-90
Abstraksi Narasi : “One of the ways to help make computer science respectable is to show that it is deeply rooted in history …” (Donald E. Knuth, Comm. ACM, 15 (1972), p. 671). A great many of the “respectable” modern numerical methods proceed iteratively, and we give an overview of them in the final section 11. Teaching and learning science from a historical perspective also leads to a “respectable” deeper understanding. The first problems requiring iterative processes were square-root calculations in Babylon, Greece, and India. More complicated problems such as sine tables in the Arabic, Indian, and medieval calculations, including Kepler’s Problem, were performed with fixed point iterations. With Newton, Raphson, and Simpson we enter the “respectable” realm of methods based on derivatives. Mourraille and Cayley contribute geometric insights in both ? and ?, while Fourier, Cauchy, and Kantorovich provide rigorous error estimations. Surprisingly, even linear problems became interesting for very large dimensions, beginning with the work of Gauss, Seidel, Young, Richardson, and Krylov to domain decomposition and multigrid methods. We explain all of these methods and illustrate them using the “Montreal test problem.”
← Kembali ke Halaman Utama