| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 50-2, JUNE (No. 1) |
| Nomor Halaman | : | 313-322 |
| Abstraksi Narasi | : | High-frequency oscillations of a rigid sphere in an incompressible viscous fluid moving normal to a rigid plane are considered when the ratio of minimum clearance to sphere radius is small. Asymptotic expansions are constructed that permit an analytical estimate of the force acting on the sphere as a result of its motion. An inner expansion, valid in the neighborhood of the minimum gap, reflects the dominance of viscous effects and fluid inertia. An outer expansion, valid outside the gap, reflects the dominance of fluid inertia with a correction for an oscillating viscous boundary layer. The results are applied to the hydrodynamics of the tapping mode of an atomic force microscope and to the dynamic calibration of its cantilevers. |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 50-2, JUNE (No. 1) |
| Nomor Halaman | : | 294-312 |
| Abstraksi Narasi | : | This paper deals with the problem of sensitivity analysis in calculus of variations. A perturbation technique is applied to derive the boundary value problem and the system of equations that allow us to obtain the partial derivatives (sensitivities) of the objective function value and the primal and dual optimal solutions with respect to all parameters. Two examples of applications, a simple mathematical problem and a slope stability analysis problem, are used to illustrate the proposed method. |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 50-2, JUNE (No. 1) |
| Nomor Halaman | : | 275-293 |
| Abstraksi Narasi | : | We present a new method for deriving asymptotic expansions of for small x. We only require that and have asymptotic expansions at and , respectively. Remarkably, it is a very general technique that unifies a certain set of asymptotic methods. Watson's lemma and other classical methods, Mellin transform techniques, McClure and Wong's distributional approach, and the method of analytic continuation turn out to be simple corollaries of this method. In addition, the most amazing thing about it is that its mathematics are absolutely elemental and do not involve complicated analytical tools as the aforementioned methods do: it consists of simple “sums and subtractions." Many known and new asymptotic expansions of important integral transforms are trivially derived from the approach presented here |
| Nama Pengarang | : | Robin Pemantle,Martin R. W. Hiebl |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 50-2, JUNE (No. 1) |
| Nomor Halaman | : | 199-272 |
| Abstraksi Narasi | : | Let be a d-dimensional array of numbers for which the generating function is meromorphic in a neighborhood of the origin. For example, F may be a rational multivariate generating function. We discuss recent results that allow the effective computation of asymptotic expansions for the coefficients of F. Our purpose is to illustrate the use of these techniques on a variety of problems of combinatorial interest. The survey begins by summarizing previous work on the asymptotics of univariate and multivariate generating functions. Next we describe the Morse-theoretic underpinnings of some new asymptotic techniques. We then quote and summarize these results in such a way that only elementary analyses are needed to check hypotheses and carry out computations. The remainder of the survey focuses on combinatorial applications, such as enumeration of words with forbidden substrings, edges and cycles in graphs, polyominoes, and descents in permutations. After the individual examples, we discuss three broad classes of examples, namely, functions derived via the transfer matrix method, those derived via the kernel method, and those derived via the method of Lagrange inversion. These methods have the property that generating functions derived from them are amenable to our asymptotic analyses, and we describe further machinery that facilitates computations for these classes of examples. |
| Nama Pengarang | : | John M.Stockie |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 53 (No. 2) |
| Nomor Halaman | : | 349-372 |
| Abstraksi Narasi | : | The Gaussian plume model is a standard approach for studying the transport of airborne contaminants due to turbulent diffusion and advection by the wind. This paper reviews the assumptions underlying the model, its derivation from the advection-diffusion equation, and the key properties of the plume solution. The results are then applied to solving an inverse problem in which emission source rates are determined from a given set of ground-level contaminant measurements. This source identification problem can be formulated as an overdetermined linear system of equations that is most easily solved using the method of least squares. Various generalizations of this problem are discussed, and we illustrate our results with an application to the study of zinc emissions from a smelting operation. |
| Nama Pengarang | : | Stephen A. Gourley |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 53 (No. 2) |
| Nomor Halaman | : | 321-345 |
| Abstraksi Narasi | : | We propose a mathematical model for an infestation of a wooded area by a beetle species in which the larvae develop deep in the wood of living trees. Due to the difficulties of detection, we presume that only a certain proportion of infested trees will be detected and that detection, if it happens, will occur only after some delay, which could be long. An infested tree once detected is immediately cut down and burned. The model is stage structured and contains a second time delay, which is the development time of the beetle from egg to adult. There is a delicate interplay between the two time delays due to the possibility in one case for a larva to mature even in a tree destined for destruction. We present conditions sufficient for infestation eradication and discuss the significance of the conditions, particularly in terms of the proportion of infested trees that need to be detected and removed. If the infestation is successfully eradicated, there are always a number of trees that completely escape infestation, and we compute lower bounds and an approximation for this number. Finally, we present the results of some numerical simulations. |
| Nama Pengarang | : | Rodrigo B.Platte |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 53 (No. 2) |
| Nomor Halaman | : | 308-318 |
| Abstraksi Narasi | : | It is shown that no stable procedure for approximating functions from equally spaced samples can converge exponentially for analytic functions. To avoid instability, one must settle for root-exponential convergence. The proof combines a Bernstein inequality of 1912 with an estimate due to Coppersmith and Rivlin in 1992. |
| Nama Pengarang | : | Steven J. Brams |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 53 (No. 2) |
| Nomor Halaman | : | 291-307 |
| Abstraksi Narasi | : | We analyze a class of proportional cake-cutting algorithms that use a minimal number of cuts ( if there are n players) to divide a cake that the players value along one dimension. While these algorithms may not produce an envy-free or efficient allocation—as these terms are used in the fair-division literature—one, divide-and-conquer (D&C), minimizes the maximum number of players that any single player can envy. It works by asking players successively to place marks on a cake—valued along a line—that divide it into equal halves (when n is even) or nearly equal halves (when n is odd), then halves of these halves, and so on. Among other properties, D&C ensures players of at least shares, as they each value the cake, if and only if they are truthful. However, D&C may not allow players to obtain proportional, connected pieces if they have unequal entitlements. Possible applications of D&C to land division are briefly discussed. |
| Nama Pengarang | : | N. Halko |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 53 (No. 2) |
| Nomor Halaman | : | 217-288 |
| Abstraksi Narasi | : | Low-rank matrix approximations, such as the truncated singular value decomposition and the rank-revealing QR decomposition, play a central role in data analysis and scientific computing. This work surveys and extends recent research which demonstrates that randomization offers a powerful tool for performing low-rank matrix approximation. These techniques exploit modern computational architectures more fully than classical methods and open the possibility of dealing with truly massive data sets. This paper presents a modular framework for constructing randomized algorithms that compute partial matrix decompositions. These methods use random sampling to identify a subspace that captures most of the action of a matrix. The input matrix is then compressed—either explicitly or implicitly—to this subspace, and the reduced matrix is manipulated deterministically to obtain the desired low-rank factorization. In many cases, this approach beats its classical competitors in terms of accuracy, robustness, and/or speed. These claims are supported by extensive numerical experiments and a detailed error analysis. The specific benefits of randomized techniques depend on the computational environment. Consider the model problem of finding the k dominant components of the singular value decomposition of an matrix. (i) For a dense input matrix, randomized algorithms require floating-point operations (flops) in contrast to for classical algorithms. (ii) For a sparse input matrix, the flop count matches classical Krylov subspace methods, but the randomized approach is more robust and can easily be reorganized to exploit multiprocessor architectures. (iii) For a matrix that is too large to fit in fast memory, the randomized techniques require only a constant number of passes over the data, as opposed to passes for classical algorithms. In fact, it is sometimes possible to perform matrix approximation with a single pass over the data. |
| Nama Pengarang | : | Tobin A. Driscoll |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 49 (No. 4) |
| Nomor Halaman | : | 673-692 |
| Abstraksi Narasi | : | The growth factor of a matrix quantifies the amount of potential error growth possible when a linear system is solved using Gaussian elimination with row pivoting. While it is an easy matter [N. J. Higham and D. J. Higham, SIAM J. Matrix Anal. Appl., 10 (1989), pp. 155–164] to construct examples of matrices having any growth factor up to the maximum of , the weight of experience and analysis [N. J. Higham, Accuracy and Stability of Numerical Algorithms, SIAM, Philadelphia, 1996], [L. N. Trefethen and R. S. Schreiber, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 335–360], [L. N. Trefethen and I. D. Bau, Numerical Linear Algebra, SIAM, Philadelphia, 1997] suggest that matrices with exponentially large growth factors are exceedingly rare. Here we show how to conduct numerical experiments on random matrices using a multicanonical Monte Carlo method to explore the tails of growth factor probability distributions. Our results suggest, for example, that the occurrence of an matrix with a growth factor of 40 is on the order of a once-in-the-age-of-the-universe event. |