Pencarian Artikel Jurnal & Majalah

Menampilkan keseluruhan arsip dokumen (Halaman 722 dari 34197, Total: 341964 data)

A Sum of Squares Approximation of Nonnegative Polynomials

Nama Pengarang : -
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 49 (No. 4)
Nomor Halaman : 651-669
Abstraksi Narasi : We show that every real nonnegative polynomial f can be approximated as closely as desired (in the -norm of its coefficient vector) by a sequence of polynomials  that are sums of squares. The novelty is that each  has a simple and explicit form in terms of f and.

Uniform Asymptotics Applied to Ultrawideband Pulse Propagation

Nama Pengarang : Natalie A. Cartwright
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 49 (No. 4)
Nomor Halaman : 628-648
Abstraksi Narasi : A canonical problem of central importance in the theory of ultrawideband pulse propagation through temporally dispersive, absorptive materials is the propagation of a Heaviside step-function signal through a medium that exhibits anomalous dispersion. This problem is rich in the use of asymptotic theory. Sommerfeld and Brillouin provided the first (qualitatively accurate but quantitatively inaccurate) closed-form approximations of the dynamic evolution of this waveform through a single-resonance Lorentz model dielectric based upon Debye's method of steepest descent. An improved approximation has since been provided by Oughstun and Sherman using modern, uniform asymptotic methods that rely upon the saddle-point method. An accurate, uniform asymptotic approximation describing the dynamical evolution of the unit step-function modulated sine wave signal through a single-resonance Lorentz model dielectric is presented here based upon their work. This refined asymptotic description results in a continuous evolution of the propagated field for all space-time points.

Adaptive Polynomial Interpolation on Evenly Spaced Meshes

Nama Pengarang : Feldman, Allan,Nation, Molly Trendell
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 49 (No. 4)
Nomor Halaman : 604-627
Abstraksi Narasi : The problem of oscillatory polynomial interpolants arising from equally spaced mesh points is considered. It is shown that by making use of adaptive approaches the oscillations may be contained and the resulting polynomials are data-bounded and monotone on each interval. This is achieved at the cost of using a different polynomial on each subinterval. Computational results for a number of challenging functions including a number of problems similar to Runge's function with as many as 511 points per interval are shown.

Revisiting Hypergraph Models for Sparse Matrix Partitioning

Nama Pengarang : Cevdet Aykanat
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 49 (No. 4)
Nomor Halaman : 595-603
Abstraksi Narasi : We provide an exposition of hypergraph models for parallelizing sparse matrix-vector multiplies. Our aim is to emphasize the expressive power of hypergraph models. First, we set forth an elementary hypergraph model for the parallel matrix-vector multiply based on one-dimensional (1D) matrix partitioning. In the elementary model, the vertices represent the data of a matrix-vector multiply, and the nets encode dependencies among the data. We then apply a recently proposed hypergraph transformation operation to devise models for 1D sparse matrix partitioning. The resulting 1D partitioning models are equivalent to the previously proposed computational hypergraph models and are not meant to be replacements for them. Nevertheless, the new models give us insights into the previous ones and help us explain a subtle requirement, known as the consistency condition, of hypergraph partitioning models. Later, we demonstrate the flexibility of the elementary model on a few 1D partitioning problems that are hard to solve using the previously proposed models. We also discuss extensions of the proposed elementary model to two-dimensional matrix partitioning.

Stability Criteria for Switched and Hybrid Systems

Nama Pengarang : -
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 49 (No. 4)
Nomor Halaman : 545-592
Abstraksi Narasi : The study of the stability properties of switched and hybrid systems gives rise to a number of interesting and challenging mathematical problems. The objective of this paper is to outline some of these problems, to review progress made in solving them in a number of diverse communities, and to review some problems that remain open. An important contribution of our work is to bring together material from several areas of research and to present results in a unified manner. We begin our review by relating the stability problem for switched linear systems and a class of linear differential inclusions. Closely related to the concept of stability are the notions of exponential growth rates and converse Lyapunov theorems, both of which are discussed in detail. In particular, results on common quadratic Lyapunov functions and piecewise linear Lyapunov functions are presented, as they represent constructive methods for proving stability and also represent problems in which significant progress has been made. We also comment on the inherent difficulty in determining stability of switched systems in general, which is exemplified by NP-hardness and undecidability results. We then proceed by considering the stability of switched systems in which there are constraints on the switching rules, through both dwell-time requirements and state-dependent switching laws. Also in this case the theory of Lyapunov functions and the existence of converse theorems are reviewed. We briefly comment on the classical Lur'e problem and on the theory of stability radii, both of which contain many of the features of switched systems and are rich sources of practical results on the topic. Finally we present a list of questions and open problems which provide motivation for continued research in this area.

As Flat As Possible

Nama Pengarang : Jon Jacobsen
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 49 (No. 3)
Nomor Halaman : 491-507
Abstraksi Narasi : How does one determine a surface which is as flat as possible, such as those created by soap film surfaces? What does it mean to be as flat as possible? In this paper we address this question from two distinct points of view, one local and one global in nature. Continuing with this theme, we put a temporal twist on the question and ask how to evolve a surface so as to flatten it as efficiently as possible. This elementary discussion provides a platform to introduce a wide range of advanced topics in partial differential equations and helps students build geometric and analytic understanding of solutions of certain elliptic and parabolic partial differential equations.

Deciding the Nature of the Coarse Equation through Microscopic Simulations: The Baby-Bathwater Scheme

Nama Pengarang : -
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 49 (No. 3)
Nomor Halaman : 469-487
Abstraksi Narasi : Recent developments in multiscale computation allow the solution of coarse equations for the expected macroscopic behavior of microscopically evolving particles without ever obtaining these coarse equations in closed form. The closure is obtained on demand through appropriately initialized bursts of microscopic simulation. The effective coupling of microscopic simulators with macroscopic behavior requires certain decisions about the nature of the unavailable coarse equation. Such decisions include (a) the highest spatial derivative active in the coarse equation, (b) whether the equation satisfies certain conservation laws, or (c) whether the coarse dynamics is Hamiltonian or dissipative. These decisions affect the number and type of boundary conditions as well as the algorithms employed. In the absence of an explicit formula for the temporal derivative, we propose, implement, and validate a simple scheme for deciding these and other similar questions about the coarse equation using only the microscopic simulator. Simulations under periodic boundary conditions are carried out for appropriately chosen families of random initial conditions; evaluating the sample variance of certain statistics over the simulation ensemble allows us to infer the highest order of spatial derivatives active in the coarse equation. In the same spirit we show how to determine whether a certain coarse conservation law exists or not, and we discuss plausibility tests for the existence of a coarse Hamiltonian or integrability. We believe that such schemes constitute an important part of the equation-free approach to multiscale computation.

A Reduced-Order Kalman Filter for Data Assimilation in Physical Oceanography

Nama Pengarang : D. Rozier
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 49 (No. 3)
Nomor Halaman : 449-465
Abstraksi Narasi : A central task of physical oceanography is the prediction of ocean circulation at various time scales. Mathematical techniques are used in this domain not only for the modeling of ocean circulation but also for the enhancement of simulation through data assimilation. The ocean circulation model of concern here, namely, HYCOM, is briefly presented through its variables, equations, and specific vertical coordinate system. The main part of this paper focuses on the Kalman filter as a data assimilation method, and especially on how this mathematical technique, usually associated with a prohibitively high computing cost for operational sciences, is simplified in order to make it applicable to the simulation of realistic ocean circulation models. Some practical issues are presented, such as a brief explanation about ocean observation systems, together with examples of data assimilation results.

A Direct Formulation for Sparse PCA Using Semidefinite Programming

Nama Pengarang : Laurent El Ghaoui
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 49 (No. 3)
Nomor Halaman : 434-448
Abstraksi Narasi : iven a covariance matrix, we consider the problem of maximizing the variance explained by a particular linear combination of the input variables while constraining the number of nonzero coefficients in this combination. This problem arises in the decomposition of a covariance matrix into sparse factors or sparse principal component analysis (PCA), and has wide applications ranging from biology to finance. We use a modification of the classical variational representation of the largest eigenvalue of a symmetric matrix, where cardinality is constrained, and derive a semidefinite programming–based relaxation for our problem. We also discuss Nesterov's smooth minimization technique applied to the semidefinite program arising in the semidefinite relaxation of the sparse PCA problem. The method has complexity , where n is the size of the underlying covariance matrix and  is the desired absolute accuracy on the optimal value of the problem.

Buchberger's Algorithm and the Two-Locus, Two-Allele Model

Nama Pengarang : -
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 49 (No. 3)
Nomor Halaman : 421-433
Abstraksi Narasi : The present paper uses results from algebraic geometry to study the classical model describing the equilibrium frequencies of the four gametic types in the two-locus, two-allele genetic model under the assumption that the fitnesses are constant and that the cis- and trans- fitnesses are equal. It shows that there is a finite process for determining an upper bound on the maximum number of equilibrium frequencies for almost all choices of recombination and fitness parameters, and that this number is finite. It also shows that the solutions are locally continuous for almost all choices of parameters. The paper studies the equilibrium frequencies as functions of the recombination parameter, with attention to the cases when the recombination becomes infinite and when one of the equilibrium frequencies becomes infinite.
← Kembali ke Halaman Utama