| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 48 (No. 2) |
| Nomor Halaman | : | 207-304 |
| Abstraksi Narasi | : | Cheetahs and beetles run, dolphins and salmon swim, and bees and birds fly with grace and economy surpassing our technology. Evolution has shaped the breathtaking abilities of animals, leaving us the challenge of reconstructing their targets of control and mechanisms of dexterity. In this review we explore a corner of this fascinating world. We describe mathematical models for legged animal locomotion, focusing on rapidly running insects and highlighting past achievements and challenges that remain. Newtonian body--limb dynamics are most naturally formulated as piecewise-holonomic rigid body mechanical systems, whose constraints change as legs touch down or lift off. Central pattern generators and proprioceptive sensing require models of spiking neurons and simplified phase oscillator descriptions of ensembles of them. A full neuromechanical model of a running animal requires integration of these elements, along with proprioceptive feedback and models of goal-oriented sensing, planning, and learning. We outline relevant background material from biomechanics and neurobiology, explain key properties of the hybrid dynamical systems that underlie legged locomotion models, and provide numerous examples of such models, from the simplest, completely soluble "peg-leg walker" to complex neuromuscular subsystems that are yet to be assembled into models of behaving animals. This final integration in a tractable and illuminating model is an outstanding challenge. |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 48 (No. 1) |
| Nomor Halaman | : | 133-146 |
| Abstraksi Narasi | : | Exponentially decaying functions can be successfully introduced as early as high school. However, obtaining the equations for the resulting effect of absorption and elimination of drug processes acting simultaneously, even in simplified models like the single dose case in a one-compartment model with an order 1 kinetic (Bateman equation), requires one to solve a nontrivial differential equation. Therefore, this equation is normally taught to second- or third-year students in the schools of medicine and pharmacy. An alternative approach is presented that uses a computer algebra system to calculate a limit and allows one to bypass the use of differential equations. |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 48 (No. 1) |
| Nomor Halaman | : | 99-130 |
| Abstraksi Narasi | : | A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size . The bisection cost is the number of edges connecting the two sets. The problem of finding a bisection of minimum cost is prototypical to graph partitioning problems, which arise in numerous contexts. This problem is NP-hard. We present an algorithm that finds a bisection whose cost is within a factor of from the minimum. For graphs excluding any fixed graph as a minor (e.g., planar graphs) we obtain an improved approximation ratio of . The previously known approximation ratio for bisection was roughly . |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 48 (No. 1) |
| Nomor Halaman | : | 76-96 |
| Abstraksi Narasi | : | Laplace's method is a preeminent technique in the asymptotic approximation of integrals. Its utility was enhanced enormously in 1956 when Erdélyi found a way to apply Watson's lemma and thereby obtain an infinite asymptotic expansion valid, in principle, for any integral of Laplace type. Erdélyi's formulation requires tedious computation of coefficients for each specific application of the method, and traditionally this has involved reverting a series. Recently, it was shown that the coefficients can be computed via a simple, explicit expression that is probably computationally optimal, which avoids the reversion approach altogether. The formula is made possible by recognizing the central role of Faà di Bruno's formula, alongside Watson's lemma, in Erdélyi's formulation of Laplace's classical method. Laplace's method can now be implemented cleanly and relatively quickly, provided one has the luck and the patience to get to the point where implementation becomes automatic. The present paper outlines the recent discovery of the role of Faà di Bruno's formula in Laplace's method, gives examples of the application of the explicit expression for the coefficients and provides grounds for a possible generalization of the result. |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 48 (No. 1) |
| Nomor Halaman | : | 66-75 |
| Abstraksi Narasi | : | Many strategies for constructing different structures of sparse approximate inverse preconditioners for large linear systems have been proposed in the literature. In a more general framework, this paper analyzes the theoretical effectiveness of the optimal preconditioner (in the Frobenius norm) of a linear system over an arbitrary subspace of . For this purpose, the spectral analysis of the Frobenius orthogonal projections of the identity matrix onto the linear subspaces of is performed. This analysis leads to a simple, general criterion: The effectiveness of the optimal approximate inverse preconditioners (parametrized by any vectorial structure)\ improves at the same time as the smallest singular value (or the smallest eigenvalue's modulus) of the corresponding preconditioned matrices increases to 1. |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 48 (No. 1) |
| Nomor Halaman | : | 43-65 |
| Abstraksi Narasi | : | Deskripsi abstrak ringkas tidak tersedia untuk artikel ini. |
| Nama Pengarang | : | Arno B. J. Kuijlaars |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 48 (No. 1) |
| Nomor Halaman | : | 3-40 |
| Abstraksi Narasi | : | Krylov subspace iterations are among the best-known and most widely used numerical methods for solving linear systems of equations and for computing eigenvalues of large matrices. These methods are polynomial methods whose convergence behavior is related to the behavior of polynomials on the spectrum of the matrix. This leads to an extremal problem in polynomial approximation theory: How small can a monic polynomial of a given degree be on the spectrum? This survey gives an introduction to a recently developed technique to analyze this extremal problem in the case of symmetric matrices. It is based on global information on the spectrum in the sense that the eigenvalues are assumed to be distributed according to a certain measure. Then, depending on the number of iterations, the Lanczos method for the calculation of eigenvalues finds those eigenvalues that lie in a certain region, which is characterized by means of a constrained equilibrium problem from potential theory. The same constrained equilibrium problem also describes the superlinear convergence of conjugate gradients and other iterative methods for solving linear systems. |
| Nama Pengarang | : | Armin Baur |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 47 (No. 4) |
| Nomor Halaman | : | 775-798 |
| Abstraksi Narasi | : | This paper presents a mathematical model for basketball free throws. It is intended to be a supplement to an existing calculus course and could easily be used as a basis for a calculus project. Students will learn how to apply calculus to model an interesting real-world problem, from problem identification all the way through to interpretation and verification. Along the way we will introduce topics such as optimization (univariate and multiobjective), numerical methods, and differential equations. |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 47 (No. 4) |
| Nomor Halaman | : | 749-772 |
| Abstraksi Narasi | : | Individuals in streams are constantly subject to predominantly unidirectional flow. The question of how these populations can persist in upper stream reaches is known as the "drift paradox." We employ a general mechanistic movement-model framework and derive dispersal kernels for this situation. We derive thin- as well as fat-tailed kernels. We then introduce population dynamics and analyze the resulting integrodifferential equation. In particular, we study how the critical domain size and the invasion speed depend on the velocity of the stream flow. We give exact conditions under which a population can persist in a finite domain in the presence of stream flow, as well as conditions under which a population can spread against the direction of the flow. We find a critical stream velocity above which a population cannot persist in an arbitrarily large domain. At exactly the same stream velocity, the invasion speed against the flow becomes zero; for larger velocities, the population retreats with the flow. |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 47 (No. 4) |
| Nomor Halaman | : | 722-745 |
| Abstraksi Narasi | : | The paper presents a computer algebra package that facilitates Lie algebraic symbolic computations required in the solution of a variety of problems, such as the solution of right-invariant differential equations evolving on Lie groups. Lie theory is a powerful tool, helpful in the analysis and design of modern nonlinear control laws, nonlinear filters, and the study of particle dynamics. The practical application of Lie theory often results in highly complex symbolic expressions that are difficult to handle efficiently without the aid of a computer software tool. The aim of the package is to facilitate and encourage further research relying on Lie algebraic computations. |