| Nama Pengarang | : | Masters, Heidi |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 50-3, SEPTEMBER (No. 3) |
| Nomor Halaman | : | 570-584 |
| Abstraksi Narasi | : | The fact that the eigenvalues of the family of matrices do not determine the stability of nonautonomous differential equations is well known. This point is often illustrated using examples in which the matrices have constant eigenvalues with negative real part, but the solutions of the corresponding differential equation grow in time. Here we provide an intuitive, geometric explanation of the idea that underlies these examples. The discussion is accompanied by a number of animations and easily modifiable Mathematica programs. We conclude with a discussion of possible extensions of the ideas that may provide suitable topics for undergraduate research. |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 50-3, SEPTEMBER (No. 3) |
| Nomor Halaman | : | 553-569 |
| Abstraksi Narasi | : | We illustrate the problems that can arise in writing differential equations that include Dirac delta functions to model equations with state-dependent impulsive forcing. Specifically, difficulties arise in the interpretation of the products of distributions with discontinuous functions. We suggest several methods to resolve these ambiguities, such as using limiting sequences and asymptotic analysis, with applications of the results given for discrete maps. These suggestions are applied to a popular model describing synaptic connections in the brain. |
| Nama Pengarang | : | Campbell, Todd,Melville, Wayne ,Verma, Geeta |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 50-3, SEPTEMBER (No. 3) |
| Nomor Halaman | : | 523-549 |
| Abstraksi Narasi | : | We describe in detail the application of importance sampling to numerical simulations of large noise-induced perturbations in soliton-based optical transmission systems governed by the nonlinear Schrödinger equation. The method allows one to concentrate the samples in Monte Carlo simulations around those noise realizations that are most likely to produce the large pulse deformations connected with errors, and it yields computational speedups of several orders of magnitude over standard Monte Carlo simulations. We demonstrate the method by using it to calculate the probability density functions associated with pulse amplitude, frequency, timing, and phase fluctuations in a prototypical soliton-based communication system. |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 50-3, SEPTEMBER (No. 3) |
| Nomor Halaman | : | 504-520 |
| Abstraksi Narasi | : | Inverting the Laplace transform is a paradigm for exponentially ill-posed problems. For a class of operators, including the Laplace transform, we give forward and inverse formulae that have fast implementations using the fast Fourier transform. These formulae lead easily to regularized inverses whose effects on noise and filtered data can be precisely described. Our results give cogent reasons for the general sense of dread most mathematicians feel about inverting the Laplace transform. |
| Nama Pengarang | : | L. Suwanto |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 50-3, SEPTEMBER (No. 3) |
| Nomor Halaman | : | 485-503 |
| Abstraksi Narasi | : | We analyze necessary and sufficient conditions on a nonsingular matrix A such that, for any initial vector , an orthogonal basis of the Krylov subspaces is generated by a short recurrence. Orthogonality here is meant with respect to some unspecified positive definite inner product. This question is closely related to the question of existence of optimal Krylov subspace solvers for linear algebraic systems, where optimal means the smallest possible error in the norm induced by the given inner product. The conditions on A we deal with were first derived and characterized more than 20 years ago by Faber and Manteuffel (SIAM J. Numer. Anal., 21 (1984), pp. 352–362). Their main theorem is often quoted and appears to be widely known. Its details and underlying concepts, however, are quite intricate, with some subtleties not covered in the literature we are aware of. Our paper aims to present and clarify the existing important results in the context of the Faber–Manteuffel theorem. Furthermore, we review attempts to find an easier proof of the theorem and explain what remains to be done in order to complete that task. |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 50-3, SEPTEMBER (No. 3) |
| Nomor Halaman | : | 459-482 |
| Abstraksi Narasi | : | Finding asymptotic solutions to two-point boundary value problems for linear singularly perturbed second-order ordinary differential equations is now quite well understood. Troublesome exceptions involving turning points, known as problems of boundary layer resonance, have been studied by many experts since the initial work of Ackerberg and O'Malley [Stud. Appl. Math., 49 (1970), pp. 277–295]; this significant work is surveyed here. Closely related literature involves the canard phenomena. New, generally more geometric, approaches, including Gevrey asymptotics and “blowup," promise improved understanding of such sensitive asymptotics and their generalizations. |
| Nama Pengarang | : | Yi Ma,W. Dean Pesnell |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 50-3, SEPTEMBER (No. 3) |
| Nomor Halaman | : | 413-458 |
| Abstraksi Narasi | : | Recently many scientific and engineering applications have involved the challenging task of analyzing large amounts of unsorted high-dimensional data that have very complicated structures. From both geometric and statistical points of view, such unsorted data are considered mixed as different parts of the data have significantly different structures which cannot be described by a single model. In this paper we propose to use subspace arrangements—a union of multiple subspaces—for modeling mixed data: each subspace in the arrangement is used to model just a homogeneous subset of the data. Thus, multiple subspaces together can capture the heterogeneous structures within the data set. In this paper, we give a comprehensive introduction to a new approach for the estimation of subspace arrangements. This is known as generalized principal component analysis (GPCA). In particular, we provide a comprehensive summary of important algebraic properties and statistical facts that are crucial for making the inference of subspace arrangements both efficient and robust, even when the given data are corrupted by noise or contaminated with outliers. This new method in many ways improves and generalizes extant methods for modeling or clustering mixed data. There have been successful applications of this new method to many real-world problems in computer vision, image processing, and system identification. In this paper, we will examine several of those representative applications. This paper is intended to be expository in nature. However, in order that this may serve as a more complete reference for both theoreticians and practitioners, we take the liberty of filling in several gaps between the theory and the practice in the existing literature. |
| Nama Pengarang | : | E. Petajan |
| Nama Majalah/Jurnal | : | Proceedings of the IEEE |
| Volume / Nomor Edisi | : | 83-7, JULY (No. 7) |
| Nomor Halaman | : | 1094-1105 |
| Abstraksi Narasi | : | The Grand Alliance (GA) was formed to define and construct a system for the delivery of HDTV using terrestrial broadcast channels. This system is composed of the best components from previously competing systems considered by the FCC. MPEG-2 syntax is used with novel encoding techniques to deliver a set of video scanning formats for a variety of applications. The paper focuses on video compression technology and also describes the important features and concepts embodied in the GA system as compared to the previous digital HDTV systems. |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | Proceedings of the IEEE |
| Volume / Nomor Edisi | : | 83-7, JULY (No. 7) |
| Nomor Halaman | : | 1086-1093 |
| Abstraksi Narasi | : | High definition television (HDTV) services will play the most important role in the digital television systems for the future. HDTV is already broadcast daily in Japan and advanced television (ATV) standards will soon be established in the US. The hardware systems for two HDTV systems, the 1125/60 and 1250/50 systems, have already been developed. Their outlines are described in the paper. Signal processing of HDTV is mainly carried out by digital methods on both the studio and receiver sides. The principles of processing are the same as for conventional television but the higher clock frequency and larger quantity of information require more sophisticated hardware. Digital signal processing methods are the key technology in HDTV broadcasting systems regardless of whether modulation is analog or digital. Some broadcasting systems are already practical use while others, are experimental. The author discusses these systems. The aim of the article is to present a global scope of the HDTV technology. |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | Proceedings of the IEEE |
| Volume / Nomor Edisi | : | 83-7, JULY (No. 7) |
| Nomor Halaman | : | 1071-1085 |
| Abstraksi Narasi | : | Interactive television (ITV) is a new form of residential consumer video service that gives viewers far greater control over the contents of programs than is possible with conventional television. There are substantial technical challenges to offering a ITV service on a large scale, both in content creation and delivery. The paper discusses those challenges and presents a new system architecture for offering ITV, along with a broad range of other interactive video services, to consumers in their homes. A new suite of tools to simplify the creation of compelling interactive programming is also described. |